Martin Tompa  Home/Search
Context Related
| washington.edu/tr/...CSE940605.PS.Z Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: mat.uc.pt/~rps/papers/routing (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: Contents Preface 1 1 Overview of Routing in Parallel Machines 2 1.1 Responsibilities : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 1.2 Prerequisites : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 1.3 Review of Order Notation : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 2 1.4 Routing Context : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 3 1.5 Greedy Algorithms on the Mesh : :... (Update)
Context of citations to this paper: More
...in Section 4, 1 There is nothing new about this worst case routing pattern (it can be considered to be an answer to Exercise 7. 4 in [8]) However, it demonstrates the basic idea used in the construction presented in Section 4. we present routing patterns which causes the...
...each processor has 1 There is nothing new about this worst case routing pattern (it can be considered to be an answer to Exercise 7. 4 in [8]) However, it demonstrates the basic idea used in the construction presented in Section 4. initially at most as many packets as the...
Cited by: More
New Bounds for Oblivious Mesh Routing - Iwama, Kambayashi, Miyano (2001) (Correct)
Routing and Sorting on Fixed Topologies - Suel (1994) (Correct)
On the Hot-Potato Permutation Routing Algorithm of Borodin.. - Richard Thomas (Correct)
Active bibliography (related documents): More All
0.5: Packet Routing in Multiprocessor Networks - Chinn (1995) (Correct)
0.5: Packet Routing in Fixed-Connection Networks: A Survey - Grammatikakis, Hsu.. (1998) (Correct)
0.5: Minimal Adaptive Routing on the Mesh with Bounded Queue Size - Chinn, Leighton, Tompa (1994) (Correct)
Similar documents based on text: More All
0.2: Oblivious Routing on d-dimensional Meshes - Osterloh (2001) (Correct)
0.1: Lower Bounds on Universal Traversal Sequences Based on Chains of.. - Buss (1995) (Correct)
0.1: Communication-Space Tradeoffs For Unrestricted Protocols - Beame, Tompa, Yan (1994) (Correct)
Related documents from co-citation: More All
3: Fast deflection routing for packets and worms (context) - Bar-Noy, Raghavan et al. - 1993
2: Exact analysis of hot-potato routing (context) - Feige, Raghavan - 1992
2: Greedy hot-potato routing on the two-dimensional mesh (context) - Ben-Aroya, Eilam et al. - 1995
BibTeX entry: (Update)
M. Tompa. Lecture notes on message routing in parallel machines. Technical Report 9406 -05, Department of Computer Science and Engineering, University of Washington, June 1994. http://citeseer.ist.psu.edu/tompa94lecture.html More
@techreport{ tompa94lecture,
author = "M. Tompa",
title = "Lecture Notes on Message Routing in Parallel Machines",
number = "TR-94-06-05",
year = "1994",
url = "citeseer.ist.psu.edu/tompa94lecture.html" }
Citations (may not include all citations):981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1992
837 Cambridge University Press (context) - Motwani, Raghavan - 1994
234 General purpose parallel architectures (context) - Valiant - 1990 ACM DBLP
163 Efficient dispersal of information for security (context) - Rabin - 1989
145 Universal schemes for parallel communication (context) - Valiant, Brebner - 1981 ACM DBLP
69 Average case analysis of greedy routing algorithms on arrays (context) - Leighton - 1990 ACM DBLP
63 Deterministic sorting in nearly logarithmic time on the hype.. - Cypher, Plaxton - 1990 ACM DBLP
56 Methods for message routing in parallel machines (context) - Leighton - 1992 ACM DBLP
49 in and J. E. Hopcroft. Routing, merging, and sorting on para.. (context) - Borod - 1985
43 Tight bounds for oblivious routing in the hypercube (context) - Kaklamanis, Krizanc et al. - 1990 ACM DBLP
36 Hot-potato algorithms for permutation routing (context) - Newman, Schuster - 1992 ACM DBLP
35 Constant queue routing on a mesh (context) - Rajasekaran, Overholt - 1992 ACM DBLP
30 Fast deflection routing for packets and worms (context) - Bar-Noy, Raghavan et al. - 1993
30 Bounds for evacuation time for deflection routing (context) - Hajek - 1991
27 Routing and sorting on mesh-connected arrays (context) - Kunde - 1988 ACM DBLP
26 Deterministic many-to-many hot potato routing - Borodin, Rabani et al. - 1994
24 Elements of Algebra and Algebraic Computing (context) - Lipson - 1981
8 Minimal adaptive routing on the mesh with bounded queue size - Chinn, Leighton et al. - 1994 ACM DBLP
4 Towards a better understanding of pure packet routing (context) - Borodin - 1993
4 Technical Report PCL Report (context) - Ben-Dor, Halevi et al. - 1993
3 step algorithm for routing in an n 2 n array with constant s.. (context) - Leighton, Makedon et al. - 1989
Documents on the same site (http://www.mat.uc.pt/~rps/papers/routing.html): More
SHADE: Technology for Knowledge-Based Collaborative Engineering - McGuire, Kuokka, al. (1993) (Correct)
On the pathwise optimal Bernoulli routing policy for homogeneous.. - Koole (1994) (Correct)
Deadlock Free Routing on a Ring: A Performance Evaluation - Liu, Mussi (1994) (Correct)
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