See this document in CiteSeerX!

A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks (1995)  (Make Corrections)  (76 citations)
José Duato
IEEE Transactions on Parallel and Distributed Systems



  Home/Search   Context   Related

 
View or download:
gap.upv.es/pub/papers/TPDS96.ps.gz
gap.upv.es/papers/TPDS96.ps.gz
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  ncsu.edu/eos/users/e/e...expanded (more)
From:  ncsu.edu/eos/users/e/e...expanded
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: This paper develops the theoretical background for the design of deadlockfree adaptive routing algorithms for virtual cut-through and store-and-forward switching. This theory is valid for networks using either central buffers or edge buffers. Some basic definitions and three theorems are proposed, developing conditions to verify that an adaptive algorithm is deadlock-free, even when there are cyclic dependencies between routing resources. Moreover, we propose a necessary and sufficient... (Update)

Cited by:   More
Efficient Agent-based Multicast on Wormhole Switch-based.. - Yi-Fang Lin Jan-Jan (2003)   (Correct)
A Simple Incremental Network Topology for Wormhole.. - Pangfeng Liu Jan-Jan (2001)   (Correct)
Adaptive Fault-Tolerant Wormhole Routing in 2D Meshes - Jipeng Zhou And   (Correct)

Active bibliography (related documents):   More   All
1.4:   A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks - Duato (1993)   (Correct)
0.6:   Minimal, Deadlock-Free Routing in Hypercubic and Arbitrary Networks - Cypher (1995)   (Correct)
0.6:   The Case for Chaotic Adaptive Routing - Bolding, Fulgham, Snyder (1994)   (Correct)

Similar documents based on text:   More   All
0.8:   Performance Analysis of Wormhole Switching - With Adaptive Routing   (Correct)
0.3:   Requirements for Deadlock-Free, Adaptive Packet Routing - Robert Cypher Ibm (1992)   (Correct)
0.2:   Adaptive Wormhole Routing in Hypercube Multicomputers - Lin, Esfahanian, McKinley.. (1993)   (Correct)

Related documents from co-citation:   More   All
63:   Deadlock-Free Message Routing in Multiprocessor Interconnection Networks (context) - Dally, Seitz - 1987
45:   The Turn Model for Adaptive Routing - Glass, Ni - 1992
36:   A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks - Duato - 1993

BibTeX entry:   (Update)

Duato J. : `A Necessary and Sufficient Condition for Deadlock Free Adaptive Routing in Wormhole Networks'. IEEE Trans. On Parallel and Distributed Systems, vol. 6, n. 10, Oct. 1995. http://citeseer.ist.psu.edu/duato95necessary.html   More

@article{ duato96necessary,
    author = "Jose Duato",
    title = "A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks:",
    journal = "IEEE Transactions on Parallel and Distributed Systems",
    volume = "7",
    number = "8",
    pages = "841--854",
    year = "1996",
    url = "citeseer.ist.psu.edu/duato95necessary.html" }
Citations (may not include all citations):
624   Computer networks (context) - Tanenbaum - 1988
462   Deadlock-free message routing in multiprocessor interconnect.. (context) - Dally, Seitz - 1987
351   A survey of wormhole routing techniques in direct networks (context) - Ni, McKinley - 1993
223   Virtual cut-through: a new computer communication switching .. (context) - Kermani, Kleinrock - 1979
193   The torus routing chip (context) - Dally, Seitz - 1986
149   Multicomputers: message-passing concurrent computers (context) - Athas, Seitz - 1988
138   The turn model for adaptive routing - Glass, Ni - 1992
112   A new theory of deadlock-free adaptive routing in wormhole n.. - Duato - 1993
76   A necessary and sufficient condition for deadlock-free adapt.. - Duato - 1994
76   A necessary and sufficient condition for deadlock-free adapt.. - Duato
73   A framework for adaptive routing in multicomputer networks (context) - Ngai, Seitz - 1989
71   Limits on interconnection network performance - Agarwal - 1991
64   the design of deadlock-free adaptive routing algorithms for .. (context) - Duato - 1991
48   Adaptive routing protocols for hypercube interconnection net.. (context) - Gaughan, Yalamanchili - 1993
42   Chaos router: architecture and performance (context) - Konstantinidou, Snyder - 1991
35   Prevention of deadlocks in packet-switched data transport sy.. (context) - Gunther - 1981
33   Performance evaluation of adaptive routing algorithms for k-.. (context) - Duato, L'opez - 1994
32   Fully adaptive minimal deadlock-free packet routing in hyper.. (context) - Pifarr'e, Gravano et al. - 1994
32   Fully-adaptive minimal deadlock-free packet routing in hyper.. (context) - Pifarr'e, Gravano et al. - 1991
28   Deadlock avoidance in store-and-forward networks -- I: Store.. (context) - Merlin, Schweitzer - 1980
24   Deflection routing in hypercube networks (context) - Greenberg, Hajek - 1992
19   Mesh and torus chaotic routing - Bolding, Snyder - 1992
19   Prevention of store-and-forward deadlock in computer network.. (context) - Gopal - 1985
17   Support for multiple classes of traffic in multicomputer rou.. - Rexford, Shin - 1994
16   The Chaos router: A practical application of randomization i.. (context) - Konstantinidou, Snyder - 1990
12   The Chaos router (context) - Konstantinidou, Snyder - 1994
10   S-Connect: From networks of workstations to supercomputer pe.. (context) - Nowatzyk, Browne et al. - 1995
9   The need for adaptive routing in the chaotic and unbalanced .. (context) - Chou, Bragg et al. - 1981
8   A DAG-based algorithm for prevention of store-and-forward de.. (context) - Gelernter - 1981
7   Routing messages through networks: an exercise in deadlock a.. (context) - Roscoe - 1987
5   Deadlock-free message routing in multicomputer networks (context) - Hilbers, Lukkien - 1989
4   A performance evaluation of adaptive routing in bidimensiona.. (context) - Arruabarrena, Beivide et al. - 1993
4   Performance of minimal adaptive routers (context) - Nguyen, Snyder - 1994
4   Adaptive packet routing in a hypercube (context) - Kim, Reed - 1988
4   Requirements for deadlock-free, adaptive packet routing - Cypher, Gravano - 1992
3   Adaptive, deadlock-free packet routing in torus networks wit.. (context) - Cypher, Gravano - 1992
3   Message routing schemes in a hypercube machine (context) - Ragupathy, Leutze et al. - 1988
2   Etude des m'ecanismes de communication pour une machine mass.. (context) - Germain-Renaud - 1989



The graph only includes citing articles where the year of publication is known.


Documents on the same site (http://www4.ncsu.edu/eos/users/e/efg/501/f97/course_locker/www/expanded.html):   More
A New Theory of Deadlock-Free Adaptive Multicast Routing in.. - Duato   (Correct)
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks - Duato (1993)   (Correct)
Lock Based Self-Stabilizing Distributed Mutual Exclusion.. - Masaaki Mizuno (1996)   (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