A survey of routing techniques in store-and-forward and wormhole interconnects.

Holman, David Michael; Lee, David S

doi:10.2172/946588

Title: A survey of routing techniques in store-and-forward and wormhole interconnects.

Full Record
Other Related Research

Abstract

This paper presents an overview of algorithms for directing messages through networks of varying topology. These are commonly referred to as routing algorithms in the literature that is presented. In addition to providing background on networking terminology and router basics, the paper explains the issues of deadlock and livelock as they apply to routing. After this, there is a discussion of routing algorithms for both store-and-forward and wormhole-switched networks. The paper covers both algorithms that do and do not adapt to conditions in the network. Techniques targeting structured as well as irregular topologies are discussed. Following this, strategies for routing in the presence of faulty nodes and links in the network are described.

Authors:: Holman, David Michael; Lee, David S

Publication Date:: Tue Jan 01 00:00:00 EST 2008

Research Org.:: Sandia National Laboratories (SNL), Albuquerque, NM, and Livermore, CA (United States)

Sponsoring Org.:: USDOE

OSTI Identifier:: 946588

Report Number(s):: SAND2008-0068
TRN: US200903%%918

DOE Contract Number:: AC04-94AL85000

Resource Type:: Technical Report

Country of Publication:: United States

Language:: English

Subject:: 97 MATHEMATICS AND COMPUTING; 99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE; ALGORITHMS; COMPUTER NETWORKS; DATA TRANSMISSION; ROUTING; TOPOLOGY; Computer Communication Networks; Information networks.; Topology.; Computer networks-Research.

Citation Formats


                    Holman, David Michael, and Lee, David S. A survey of routing techniques in store-and-forward and wormhole interconnects..  United States: N. p., 2008. 
        Web.  doi:10.2172/946588.

Copy to clipboard


                    Holman, David Michael, & Lee, David S. A survey of routing techniques in store-and-forward and wormhole interconnects..  United States.  https://doi.org/10.2172/946588

Copy to clipboard


                    Holman, David Michael, and Lee, David S. 2008.  
        "A survey of routing techniques in store-and-forward and wormhole interconnects.".  United States.  https://doi.org/10.2172/946588.  https://www.osti.gov/servlets/purl/946588.

Copy to clipboard


                    
@article{osti_946588,

  title        = {A survey of routing techniques in store-and-forward and wormhole interconnects.},

  author       = {Holman, David Michael and Lee, David S},

  abstractNote = {This paper presents an overview of algorithms for directing messages through networks of varying topology. These are commonly referred to as routing algorithms in the literature that is presented. In addition to providing background on networking terminology and router basics, the paper explains the issues of deadlock and livelock as they apply to routing. After this, there is a discussion of routing algorithms for both store-and-forward and wormhole-switched networks. The paper covers both algorithms that do and do not adapt to conditions in the network. Techniques targeting structured as well as irregular topologies are discussed. Following this, strategies for routing in the presence of faulty nodes and links in the network are described.},

  doi          = {10.2172/946588},

  url          = {https://www.osti.gov/biblio/946588},
  journal      = {},
number       = ,

  volume       = ,

  place        = {United States},

  year         = {Tue Jan 01 00:00:00 EST 2008},

  month        = {Tue Jan 01 00:00:00 EST 2008}

}

Copy to clipboard

Technical Report:

View Technical Report (0.25 MB)

https://doi.org/10.2172/946588

Save / Share:

Export Metadata

Save to My Library

Similar records in OSTI.GOV collections:

Fault-tolerant routing with non-adaptive wormhole algorithms in mesh networks

Conference Boppana, R; Chalasani, S

The authors present simple techniques to enhance the e-cube algorithm for fault-tolerant routing in mesh networks. These techniques are based on the concept of fault rings, which are formed using fault-free nodes and links around each fault region. They use fault rings to enhance the e-cube to route messages in the presence of rectangular block faults. They show that if fault rings do not overlap with one another--the sets of links in fault rings are pairwise disjoint, then two virtual channels per physical channel are sufficient to make the e-cube tolerant to any number of faulty blocks. For more complexmore »« less
Optimal software multicast in wormhole-routed multistage networks

Book Xu, H; Gui, Y; Ni, L

Multistage interconnection networks are a popular class of interconnection architecture for constructing scalable parallel computers (SPCs). The focus of this paper is on wormhole routed multistage networks supporting turnaround routing. Existing machines characterized by such a system model include the IBM SP-1, TMC CM-5, and Meiko CS-2. Efficient collective communication among processor nodes is critical to the performance of SPCS. A system-level multicast service, in which the same message is delivered from a source node to an arbitrary number of destination nodes, is fundamental in supporting collective communication primitives including the application-level broadcast, reduction, and barrier synchronization. This paper addressesmore »« less
A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks

Conference Duato, J

Deadlock avoidance is a key issue in wormhole networks. A first approach consists of removing the cyclic dependencies between channels. Although this is a necessary and sufficient condition for deadlock-free deterministic routing, it is only a sufficient condition for deadlock-free adaptive routing. A more powerful approach only requires the absence of cyclic dependencies on a connected channel subset. The remaining channels can be used in almost any way. In this paper, we propose a necessary and sufficient condition for deadlock-free adaptive routing. This condition is the key for the design of maximally adaptive routing algorithms with minimum restrictions. Some examplesmore »« less
Efficient routing and broadcasting in recursive interconnection networks

Conference Fernandes, R; Friesen, D; Kanevsky, A

The WK-Recursive Network (WKRN) is a hierarchical interconnection network that is recursively defined and has excellent properties for scalable message-passing multicomputer systems. In this paper, we present efficient routing and broadcasting schemes in a WKRN. For efficient routing, we define the MP-graph between the source and destination nodes of the message. For efficient broadcasting, we define the EDHP-graph and the NDST-graph. The MP-graph can also be used for message routing in the presence of faulty nodes. Similarly, the EDHP-graph (the NDST-graph) can be used for message broadcast in the presence of faulty links (nodes). Fault-tolerance communication schemes using these graphsmore »« less
A framework for adaptive routing in multicomputer networks

Miscellaneous Ngai, J

Message-passing concurrent computers, also known as multicomputers, such as the Caltech Cosmic Cube and its commercial descendants, consist of many computing nodes that interact with each other by sending and receiving messages over communication channels between the nodes. The communication networks of the second-generation machines, such as the Symult Series 2010 and the Intel iPSC2, employ an oblivious wormhole-routing technique that guarantees deadlock freedom. The network performance of this highly evolved oblivious technique has reached a limit of being capable of delivering, under random traffic, a stable maximum sustained throughput of {approx}45 to 50% of the limit set by themore »« less

Similar Records