Results 1 to 10 of about 5,549 (211)
Some of the next articles are maybe not open access.
A parallel optimal routing algorithm
Parallel Computing, 1992zbMATH Open Web Interface contents unavailable due to conflicting licenses.
C. Ribeiro, Didier El Baz
openaire +2 more sources
An optimal distributed routing algorithm
IEEE Transactions on Communications, 1991The authors present a distributed optimal one-level routing algorithm. The algorithm, based on the Newton method, considers the interdependence among the variables. Using the variable reduction method, the Hessian matrix becomes diagonal. The objective function is proved to be convex and the algorithm is shown to be convergent, both under a mild ...
Zhonghe Wang, Douglas W. Browning
openaire +1 more source
Routing algorithms for anycast messages
Proceedings. 1998 International Conference on Parallel Processing (Cat. No.98EX205), 2002We propose and analyze three routing algorithms for anycast packets: source-destination based routing with weighted random selection (SD/WRS); destination based routing with weighted random selection (D/WRS); and the shortest shortest path first (SSPF) algorithms.
Dong Xuan +2 more
openaire +1 more source
Routing algorithms in honeycomb meshes
International Journal of Parallel, Emergent and Distributed Systems, 2009Honeycomb meshes are a promising class of topological structures for connecting processors within parallel computing. This paper addresses three routing algorithms for these networks. First, a unicast algorithm known as XYZ-ROUTE is presented by employing the classical virtual channel technique.
Weiwen Zhang +3 more
openaire +1 more source
A minimum interference routing algorithm
2004 IEEE International Conference on Communications (IEEE Cat. No.04CH37577), 2004Minimum interference routing is instrumental to MPLS traffic engineering under realistic assumptions of unknown traffic demand. This work presents a new algorithm for minimum interference routing, called light minimum interference routing (LMIR). This algorithm introduces a new approach for critical link identification that reduces the computational ...
Gustavo B. Figueiredo +2 more
openaire +1 more source
A Multicast Routing Algorithm for CSCW
2004The CRMR, which is an algorithm for updating multicast tree dynamically, is presented. It constructs an initial multicast tree using KPP and builds a virtual trunk (VT) simultaneously. The nodes of the VT are relatively stable and nodes changes are based on the VT.
Xiongfei Li +3 more
openaire +1 more source
Schnyder Greedy Routing Algorithm
2010Geometric routing by using virtual locations is an elegant way for solving network routing problem In its simplest form, greedy routing, a message is forwarded to a neighbor that is closer to the destination One major drawback of this approach is that the virtual coordinates requires Ω(nlogn) bits to represent, which makes this scheme infeasible in ...
Xin He 0005, Huaming Zhang
openaire +1 more source
Parallel algorithms for VLSI routing
Integration, 1991Abstract With the increase in the design complexity of VLSI systems, there is an ever increasing need for efficient design automation tools. Parallel processing could open up the way for substantially faster and cost-effective VLSI design tools. In this paper, we review some of the basic parallel algorithms that have been recently developed to handle
openaire +1 more source
Routing algorithms for IBM SP1
1994Scalable multicomputer are based upon interconnection networks that typically provide multiple communication routes between any given pair of processor nodes. Routes must be selected for communication so that the load is distributed evenly among the links and switches to prevent congestion in the network.
Bülent Abali, Cevdet Aykanat
openaire +1 more source