Robert Cypher  Home/Search
Context
Related
| jhu.edu/~cypher/pubs/db.ps 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: jhu.edu/~cypher/pubs/pubs (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In this paper we consider the problem of creating minimal, deadlock-free routing algorithms, where a routing algorithm is said to be minimal if it uses only shortest paths. In particular, we examine the possibility of creating scalable algorithms that use only a constant number of buffers per node. Minimal, scalable, deadlock-free routing algorithms are known for many important networks including meshes, tori, trees and hypercubes. In addition, it is known that a scalable, deadlock-free routing ... (Update)
Active bibliography (related documents): More All
1.5: Requirements for Deadlock-Free, Adaptive Packet Routing - Cypher, Gravano (1992) (Correct)
1.2: Storage-Efficient, Deadlock-Free Packet Routing Algorithms.. - Cypher, Gravano (1994) (Correct)
0.6: A Necessary and Sufficient Condition for Deadlock-Free Routing in.. - Duato (1995) (Correct)
Similar documents based on text: More All
0.2: Adaptive Wormhole Routing in Hypercube Multicomputers - Lin, Esfahanian, McKinley.. (1993) (Correct)
0.2: Constraint Logic Programming Applied to Model Checking - Fribourg (1999) (Correct)
0.2: Tree-Based Multicast in Wormhole-Routed Torus Networks - Honge Wang And (1998) (Correct)
BibTeX entry: (Update)
@inproceedings{ cypher95minimal,
author = "Cypher",
title = "Minimal, Deadlock-Free Routing in Hypercubic and Arbitrary Networks",
booktitle = "{SPDP}: 7th {IEEE} Symposium on Parallel and Distributed Processing",
publisher = "ACM Special Interest Group on Computer Architecture (SIGARCH), and IEEE Computer Society",
year = "1995",
url = "citeseer.ist.psu.edu/cypher95minimal.html" }
Citations (may not include all citations):981 Introduction to Parallel Algorithms and Architectures: Array.. (context) - Leighton - 1992
462 Deadlock-Free Message Routing in Multiprocessor Interconnect.. (context) - Dally, Seitz - 1987
223 Virtual Cut-Through: A New Computer Communication Switching .. (context) - Kermani, Kleinrock - 1979
154 Planar-Adaptive Routing: Low-Cost Adaptive Networks for Mult.. - Chien, Kim - 1992
138 The Turn Model for Adaptive Routing - Glass, Ni - 1992
93 Parallel Processing with the Perfect Shuffle (context) - Stone - 1971
58 Adaptive Deadlock- and Livelock-Free Routing with All Minima.. - Berman, Gravano et al. - 1992
35 Prevention of Deadlocks in Packet-Switched Data Transport Sy.. (context) - Gunther - 1981
34 Theoretical Aspects of VLSI Pin Limitations (context) - Cypher - 1993
32 Fully-Adaptive Minimal Deadlock-Free Packet Routing in Hyper.. (context) - Pifarr'e, Gravano et al. - 1991
30 High Performance Communications (context) - Jesshope, Miller et al. - 1989
29 Greedy Packet Scheduling on Shortest Paths - Mansour, Patt-Shamir - 1991
29 de Bruijn and Kautz Networks: A Competitor for the Hypercube (context) - Bermond, Peyrat - 1989
26 Deadlock-Free Adaptive Routing Algorithms for Multicomputers.. (context) - Duato - 1991
19 Prevention of Store-and-Forward Deadlock in Computer Network.. (context) - Gopal - 1985
12 The Chaos Router (context) - Konstantinidou, Snyder - 1994
9 Efficient Deadlock-Free Routing (context) - Awerbuch, Kutten et al. - 1991
8 Deadlock-Free Packet Switching Networks (context) - Toueg, Ullman - 1981
6 Adaptive, Minimal Routing in Hypercubes (context) - Konstantinidou - 1990
5 Deadlock-Free Message Routing in Multicomputer Networks (context) - Hilbers, Lukkien - 1989
5 Adaptive, Low Latency, Deadlock-Free Packet Routing for Netw.. (context) - Yantchev, Jesshope - 1989
5 Principles for High Speed Network Control: Loss-Less and Dea.. (context) - Ofek, Yung - 1990
5 Some Complexity Results in the Design of Deadlock-Free Packe.. (context) - Toueg, Steiglitz - 1981
5 Minimal Buffer Requirements for Avoiding Store-and-Forward D.. (context) - Gavish, Merlin et al. - 1977
4 Embedding de Bruijn and Shuffle-Exchange Graphs in Five Page.. (context) - Obreni'c - 1991
4 Deadlock-Free Minimal Packet Routing in the Torus Network (context) - Felperin, Laffitte et al. - 1991
4 Requirements for Deadlock-Free, Adaptive Packet Routing - Cypher, Gravano - 1994
2 Storage-Efficient, Deadlock-Free Packet Routing Algorithms f.. - Cypher, Gravano - 1994
1 Complexity Issues ini VLSI: Optimal Layouts for the Shuffle-.. (context) - Leighton - 1983
1 Deadlock Avoidance in Store-and-Forward Networks. 1: Store-a.. (context) - Merlin, Schweitzer - 1980
Documents on the same site (http://www.cs.jhu.edu/~cypher/pubs/pubs.html): More
The Semantics of Blocking and Nonblocking Send and Receive.. - Cypher, Leu (1994) (Correct)
CCL: A Portable and Tunable Collective.. - Bala, Bruck.. (1995) (Correct)
Efficient Race Detection for Message-Passing Programs with.. - Cypher, Leu (1995) (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