A. G. Ranade. Equivalence of Message Scheduling Algorithms for Parallel Communication. Tech. Report YALEU/DCS/TR-512, Dept. Comp. Sci., Yale University, New Haven, CT, 1987. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Almost Optimal Permutation Routing on Hypercubes - Vöcking (Correct)
....several small changes in the de nition of the scheduling protocol, e.g. packets on the rst part of their routing paths need not to be preferred against packets on the second part, the analysis breaks down if the priority ranks are not increased during the routing. On the other hand, Ranade [16] (see also [9] showed that many scheduling policies have exactly identical probabilistic behavior on random routing problems in which either the sources or the destinations of the packets are chosen independently and uniformly at random. In particular, Ranade studies nonpredictive protocols, ....
A. G. Ranade. Equivalence of Message Scheduling Algorithms for Parallel Communication. Tech. Report YALEU/DCS/TR-512, Dept. Comp. Sci., Yale University, New Haven, CT, 1987.
Packet Routing in Multiprocessor Networks - Chinn (1995) (Correct)
....of its node, and its own source address and profitable outlinks. Let us call an algorithm that obeys this last restriction a destinationexchangeable routing algorithm. Note that the restriction to profitable outlinks is similar to the definition of a nonpredictive algorithm, given by Ranade [Ran87] Leighton [Lei92, page 556] and Maggs and Sitaraman [MS92] One example of a destination exchangeable algorithm is the dimension order algorithm with FIFO queues and round robin inqueue policy. An adaptive example might be similar, except that each packet moves in one profitable direction until ....
A. Ranade. Equivalence of message scheduling algorithms for parallel communication. Technical Report YALEU/DCS/TR-511, Department of Computer Science, Yale University, New Haven, CT, 1987.
Minimal Adaptive Routing on the Mesh with Bounded Queue Size - Chinn, Leighton, Tompa (1994) (4 citations) (Correct)
....initial state of its node, and its own source address and profitable outlinks. Call an algorithm that fits this description a destination exchangeable routing algorithm. Note that the restriction to profitable outlinks is similar to the definition of a nonpredictive algorithm, given by Ranade [25], Leighton [16, page 556] and Maggs and Sitaraman [20] One example of a destination exchangeable algorithm is the dimension order algorithm with FIFO queues and round robin inqueue policy. An adaptive example might be 5 cn cn cn 6 cn cn 1 i 6 cn 1 i 6 N i column E i row = ....
A. Ranade. Equivalence of message scheduling algorithms for parallel communication. Technical Report YALEU/DCS/TR-511, Department of Computer Science, Yale University, New Haven, CT, 1987.
Simple Algorithms for Routing on Butterfly Networks with.. - Maggs, Sitaraman (1992) (6 citations) (Correct)
....between processors. Several proposed designs for the switching fabric of scalable high speed ATM networks use butterfly and other closely related multistage interconnection networks [26] Although many routing algorithms with provably good performance have been devised for butterfly networks [2, 15, 20, 23, 24, 31, 32, 33, 34], simpler algorithms are often used in practice. Typically, packets are sent along shortest paths through the network, and simple queuing protocols such as first in first out (FIFO) are used to determine which packets to transmit at each step. In addition, the queues at the switches can usually ....
....unless the queue that the packet wishes to enter is already full. A switch is not prohibited from sending more than one packet at each step, provided that they use different edges. Non predictive protocols are a subclass of greedy protocols. In a non predictive queuing protocol [13, Section 3.4. 4][23], at each step, each switch selects one packet from its queue without examining the destinations of any of the packets in its queue, and sends the packet to the next level, unless the queue that it wishes to enter is full. If the queue is full, then the switch must select the same packet at the ....
[Article contains additional citation context not shown here]
A. G. Ranade. Equivalence of message scheduling algorithms for parallel communication. Technical Report YALE/DCS/TR-512, Department of Computer Science, Yale University, New Haven, CT, 1987.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC