Efficient routing and broadcasting in recursive interconnection networks
- Texas A&M Univ., College Station, TX (United States)
- Univ. of Southern Mississippi, Bedford, MI (United States)
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 graphs have the advantage that no information about the presence or location of faulty components is required. Moreover, the MP-graph and the NDST-graph can be used under different fault models. We analyze the communication delays for message routing (broadcast) along MP-graphs (EDHP-graphs and NDST-graphs) under fault-free and faulty conditions.
- OSTI ID:
- 98879
- Report Number(s):
- CONF-940856-; TRN: 94:008346-0011
- Resource Relation:
- Conference: 1994 international conference on parallel processing, St. Charles, IL (United States), 15-19 Aug 1994; Other Information: PBD: 1994; Related Information: Is Part Of Proceedings of the 1994 international conference on parallel processing. Volume 1: Architecture; Agrawal, D.P. [ed.]; PB: 330 p.
- Country of Publication:
- United States
- Language:
- English
Similar Records
Addressing, routing, and broadcasting in hexagonal mesh multiprocessors
A framework for adaptive routing in multicomputer networks