M. D. Grammatikakis, D. F. Hsu, M. Kraetzl, and J. Sibeyn, "Packet routing in fixed-connection networks: a survey," Journal of Parallel and Distributed Processing, Vol. 54(2), pp. 77-132, 1998.  Home/Search   Document Details and Download   Summary   Related Articles   Check

....The canonical routing problem is that of permutation routing. In this case each processor initially and finally contains one packet. Many different approaches to solve the permutation routing problem have been studied (e.g. adaptive, hot potato, cut through, wormhole, fault tolerant, local, etc. [3]) In [17] the concept of oblivious routing was introduced. In this routing strategy the path of each packet is determined only by its source and destination position. It depends not on other packets. This makes oblivious routing simple and attractive and hence it was considered in several ....

GRAMMATIKAKIS, M. D., HSU, D. F., AND SIBEYN, J. F. Packet routing in fixed-connection networks: A survey. Journal of Parallel and Distributed Computing 54, 2 (1 Nov. 1998), 77--132.

....of the best studied routing problems is the problem where each processor is source and destination of at most k packets, the k k routing problem. Many different approaches to solve this routing problem have been studied, e.g. adaptive, hot potato, cut through, wormhole, fault tolerant, local, etc. [1]. In oblivious routing the path of a packet is independent of the path of other packets. The path is determined only by the source and destination position of the packet. This property of oblivious routing algorithms is interesting, since it allows one to design simple and hence practical ....

M. D. Grammatikakis, D. F. Hsu, and J. F. Sibeyn. Packet routing in fixedconnection networks: A survey. Journal of Parallel and Distributed Computing, 54(2):77--132, November 1998.

....Partially supported by the IST Programme of the EU under contract number IST 1999 14186 (ALCOM FT) Partially supported by Natural Sciences and Engineering Research Council of Canada grant R3050A01. This problem has been studied in many variations and under many different names: h relations [6], file transfer [2] edge coloring [19] and biprocessor task scheduling on dedicated processors [13] Our original motivation was the study of the function MPI Alltoallv in the Message Passing Interface (MPI) 22] and its equivalents in other message passing models for parallel computing. The ....

M. D. Grammatikakis, D. F. Hsu, M. Kraetzl, and J. Sibeyn. Packet routing in fixedconnection networks: A survey. Journal of Parallel and Distributed Processing, 54:77-- 132, 1998.

....one packet. We assume synchronized simplex communication, i.e. a PE can exchange information with only one other PE at any given moment. Moreover, we assume that packets can be further subdivided. This problem has been studied in many variations and under many different names: h relations [5], file transfer [2] edge coloring [17] and biprocessor task scheduling on dedicated processors [11] Our original motivation was the study of the function MPI Alltoallv in the Message Passing Interface (MPI) 18] and its equivalents in other message passing models for parallel computing. The ....

M. D. Grammatikakis, D. F. Hsu, M. Kraetzl, and J. Sibeyn. Packet routing in fixedconnection networks: A survey. Journal of Parallel and Distributed Processing, 54:77-- 132, 1998.

....Our unit of communication time is the time needed to transmit one packet. We assume synchronized half duplex communication, i.e. a PE can only either send or receive one packet at any given moment. This problem has been studied in many variations and under many different names: h relations [6], file transfer [2] edge coloring [19] and biprocessor task scheduling on dedicated processors [13] Our original motivation was the study of the function MPI Alltoallv in the Message Passing Interface (MPI) 22] and its equivalents in other message passing models for parallel computing. The ....

M. D. Grammatikakis, D. F. Hsu, M. Kraetzl, and J. Sibeyn. Packet routing in fixed-connection networks: A survey. Journal of Parallel and Distributed Processing, 54:77--132, 1998.

.... Theta n Theta n mesh can be performed in O(n ) steps with no additional buffer [2] Using Theorem 1 Step 3 can be performed in O(n ) steps with queue size 3. Step 1 and Step 4 are 1 1 routings in the mesh. 1 1 routing on a mesh can be performed in 2n O(1) steps with queue size 2 [1]. 2 Now we consider the case that every PU holds k packets. Theorem 3 If every PU holds k packets then Alg1 can be performed in 4n O(n ) steps for k = 1; 2; 3; 4 with queue size 3; 5; 7; 8, and in 2kn O(kn ) steps for k 4 with queue size k 4 for k 8 and queue size of at most 11 for ....

....1; 2; 3; 4 with queue size 3; 5; 7; 8, and in 2kn O(kn ) steps for k 4 with queue size k 4 for k 8 and queue size of at most 11 for k = 5; 6; 7. Proof. First we consider the case k 8. Step 1 and Step 4 are k k routings and can be performed in kn 2 O(kn ) steps with queue size k[1]. Step 2 needs k steps. Using the result of Theorem 1 Step 3 can be performed in O(kn ) steps with queue size k 4. Now we consider the case k 8: A closer look at Step 1 and Step 4 shows that the blockplanes are just shifted by h positions with respect to a row major indexing of the ....

M. D. Grammatikakis, D. F. Hsu, and J. F. Sibeyn. Packet routing in fixed-connection networks: A survey. Journal of Parallel and Distributed Computing, 54(2):77--132, 1 Nov. 1998.

....common permutations, as well as dynamic routing. For static patterns, we will focus on the time delay to realize k k routing, random permutation, common permutation and computing functions [5, 10] Frequently used permutations belong to the BPC, omega, inverse omega, and ascend descend classes [9, 14, 16, 22, 23]. For dynamic patterns, we will focus our experiments on evaluating the network sustained bandwidth rate and average packet latency for random communication patterns with without spatial locality. A comparison with existing theoretical dynamic routing models of 3D tori interconnection networks ....

Grammatikakis, M. D., Hsu, D. F, Kraetzl, M. and Sibeyn, J. Packet routing in fixedconnection networks: a survey J. Parallel Distrib. Proc. Academic Press, 1997, to appear.

No context found.

M.D. Grammatikakis, D.F. Hsu, M. Kraetzl, and J. Sibeyn. Packet routing in fixedconnection networks: a survey. J. Parallel Distrib. Comput. Academic Press, 77--132, 1998.

....received from any communication link. Lemma 1 Under any routing algorithm, dynamic routing on a vertex symmetric graph with N nodes, degree d, and average distance D a is stable only 3 if m g d (N Gamma 1) D a N = m 0 PROOF. The argument is based on a network connection availability bound [9]. The average number of packets generated in the network per time unit is N m g . Under any routing scheme on a buffered graph, a generated packet must cover a distance of at least D a N= N Gamma 1) steps. Notice that N= N Gamma 1) is a corrective factor to the average distance since we do not ....

M.D. Grammatikakis, D.F. Hsu, M. Kraetzl, and J. Sibeyn. Packet routing in fixed-connection networks: a survey, J. Parallel Distrib. Proc, Academic Press, (1998) to appear. 15

No context found.

Grammatikakis, M. D., Hsu, D. F, Kraetzl, M. and Sibeyn, J. Packet routing in fixed-connection networks: a survey. J. Parallel Distrib. Comput. Academic Press, 1998, to appear.

No context found.

M. D. Grammatikakis, D. F. Hsu, M. Kraetzl, and J. Sibeyn, "Packet routing in fixed-connection networks: a survey," Journal of Parallel and Distributed Processing, Vol. 54(2), pp. 77-132, 1998.

No context found.

M.D. Grammatikakis, D.F. Hsu, , M. Kraetzel, and J.F. Sibeyn. Packet routing in fixed-connection networks: A survey. Journal of Parallel and Distributed Computing, 54(2):77--132, November 1998.

No context found.

M.D. Grammatikakis, D.F. Hsu, , M. Kraetzel, and J.F. Sibeyn. Packet routing in fixed-connection networks: A survey. Journal of Parallel and Distributed Computing, 54(2):77--132, November 1998.

No context found.

Grammatikakis, M.D., Hsu, D.F.; Kraetzl, M. and Sibeyn, J.F. Packet routing in fixed-connection networks: a survey. Journal of Parallel and Distributed Computing, 54(2), 77-132, 1998.

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