Donald D. Chinn, Tom Leighton, Martin Tompa  Home/Search
Context Related
| washington.edu/tr/...CSE940703.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: washington.edu (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: An adaptive routing algorithm is one in which the path a packet takes from its source to its destination may depend on other packets it encounters. Such algorithms potentially avoid network bottlenecks by routing packets around "hot spots." Minimal adaptive routing algorithms have the additional advantage that the path each packet takes is a shortest one. For a large class of minimal adaptive routing algorithms, we present an \Omega# n 2 =k 2 ) bound on the worst case time to route a... (Update)
Context of citations to this paper: More
...adaptive routing algorithms have the additional advantage that the path each packet takes is a shortest one. Chinn, Leighton, and Tompa [6] provide a lower bound for permutation routing problems on the n Theta n mesh for a large class of deterministic minimal adaptive...
...discussed can route arbitrary permutations in O(n) time. A preliminary version of portions of Chapters 2 and 3 has appeared previously [CLT94] A preliminary version of portions of Chapter 4 has also appeared previously [Chi] This chapter concludes by surveying some of the...
Cited by: More
The Performance of Adaptive Routers on Worst Case Permutations - Chinn (1994) (Correct)
New Bounds for Oblivious Mesh Routing - Iwama, Kambayashi, Miyano (2001) (Correct)
Overview of Mesh Results - Sibeyn (1995) (Correct)
Similar documents (at the sentence level):
42.7%: Packet Routing in Multiprocessor Networks - Chinn (1995) (Correct)
Active bibliography (related documents): More All
0.5: Packet Routing in Fixed-Connection Networks: A Survey - Grammatikakis, Hsu.. (1998) (Correct)
0.5: Lecture Notes on Message Routing in Parallel Machines - Martin Tompa (1994) (Correct)
0.3: Routing with Locality on Meshes with Buses - Cheung, Lau (1996) (Correct)
Similar documents based on text: More All
0.2: A Lower Bound for Nearly Minimal Adaptive and Hot Potato.. - Ben-Aroya, Chinn.. (Correct)
0.2: Lower Bounds on Universal Traversal Sequences Based on Chains of.. - Buss (1995) (Correct)
0.2: A Guide to Literature on Chaotic Routing - Chaotic Routing Project (Correct)
Related documents from co-citation: More All
9: A Framework for Adaptive Routing in Multicomputer Networks (context) - Ngai, Seitz - 1989
6: Fast deflection routing for packets and worms (context) - Bar-Noy, Raghavan et al. - 1993
5: Exact analysis of hot-potato routing (context) - Feige, Raghavan - 1992
BibTeX entry: (Update)
D. D. Chinn, T. Leighton, and M. Tompa. Minimal adaptive routing on the mesh with bounded queue size. In Proceedings of the 1994 ACM Symposium on Parallel Algorithms and Architectures, Cape May, NJ, June 1994. http://citeseer.ist.psu.edu/chinn94minimal.html More
@article{ chinn96minimal,
author = "Donald D. Chinn and Tom Leighton and Martin Tompa",
title = "Minimal Adaptive Routing on the Mesh with Bounded Queue Size",
journal = "Journal of Parallel and Distributed Computing",
volume = "34",
number = "2",
pages = "154--170",
year = "1996",
url = "citeseer.ist.psu.edu/chinn94minimal.html" }
Citations (may not include all citations):981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1992
154 Planar-adaptive routing: Low-cost adaptive networks for mult.. - Chien, Kim - 1992
107 The DASH prototype: Implementation and performance (context) - Lenoski, Laudon et al. - 1992
74 Design of a massively parallel processor (context) - Batcher - 1980
69 Average case analysis of greedy routing algorithms on arrays (context) - Leighton - 1990
65 Exact analysis of hot-potato routing (context) - Feige, Raghavan - 1992
49 in and J. E. Hopcroft. Routing, merging, and sorting on para.. (context) - Borod - 1985
46 Hot-potato routing on processor arrays (context) - Kaklamanis, Krizanc et al. - 1993
43 Tight bounds for oblivious routing in the hypercube (context) - Kaklamanis, Krizanc et al. - 1990
36 Hot-potato algorithms for permutation routing (context) - Newman, Schuster - 1992
35 Constant queue routing on a mesh (context) - Rajasekaran, Overholt - 1992
30 Bounds for evacuation time for deflection routing (context) - Hajek - 1991
30 Fast deflection routing for packets and worms (context) - Bar-Noy, Raghavan et al. - 1993
27 Routing and sorting on mesh-connected arrays (context) - Kunde - 1988
26 Bounds on maximum delay in networks with deflection routing (context) - Brassil, Cruz - 1991
20 How much can hardware help routing (context) - Borodin, Raghavan et al. - 1993
18 System design of the J-Machine (context) - Noakes, Dally - 1990
17 deadlock-free packet routing in torus networks with minimal .. (context) - Cypher, Gravano - 1992
16 Simple algorithms for routing on butterfly networks with bou.. - Maggs, Sitaraman - 1992
6 Move and smooth (context) - Han, Stanat - 1990
6 Oblivious routing with limited buffer capacity (context) - Krizanc - 1991
5 MasPar Computer Corporation (context) - family, Technical - 1987
4 Equivalence of message scheduling algorithms for parallel co.. (context) - Ranade - 1987
4 The design of the Caltech Mosaic C multicomputer (context) - Sietz, Boden et al. - 1993
3 step algorithm for routing in an n 2 n array with constant s.. (context) - Leighton, Makedon et al. - 1989
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.cs.washington.edu.html): More
Mobisaic - Voelker, Bershad (1995) (Correct)
Time-Space Tradeoffs for Undirected Graph Traversal - Beame, Borodin, Raghavan.. (1993) (Correct)
Automatic SAT-Compilation of Planning Problems - Ernst, Millstein, Weld (1997) (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