Multipath E-Cube Algorithms (MECA) for Adaptive Wormhole Routing and Broadcasting in itk-ary itn-Cubes
نویسندگان
چکیده
This paper introduces and evaluates the Multipath E-Cube Algorithm (MECA) for adaptive and fault-tolerant wormhole routing in k-ary n-cubes. This algorithm provides multiple shortest paths between any source and destination node of a multicomputer using only a constant number of virtual channels for every physical channel, and with little added overhead at the router. Consequently, it is able to improve network throughput and reduce latency while maintaining the deadlock-free property that is critical for circuit-switched routing mechanisms. MECA also allows multiple broadcast trees to be used concurrently without incurring deadlock. Simulation results highlight the advantages of MECA over other circuit-switched routing techniques.
منابع مشابه
Multipath E-cube Algorithms (meca) for Adaptive Wormhole Routing and Broadcasting in K-ary N-cubes
This paper introduces and evaluates the Multipath E-Cube Algorithm (MECA) for adaptive and fault-tolerant wormhole routing in k-ary n-cubes. This algorithm provides multiple shortest paths between any source and destination node of a multicomputer using only a constant number of virtual channels for every physical channel, and with little added overhead at the router. Consequently, it is able t...
متن کاملTotal-Exchange on Wormhole k-ary n-cubes with Adaptive Routing
The total-exchange is one of the most dense communication patterns and is at the heart of numerous applications and programming models in parallel computing. In this paper we present a simple randomized algorithm to efficiently schedule the total-exchange on the family of k-ary n-cubes with adaptive routing and wormhole switching. This algorithm is based on an important property of the wormhole...
متن کاملFast Barrier Synchronization in Wormhole k-ary n-cube Networks with Multidestination Worms1
This paper presents a new approach to implement fast barrier synchronization in wormhole k-ary n-cubes. The novelty lies in using multidestination messages instead of the traditional single destination messages. Two diierent multidestination worm types, gather and broadcasting, are introduced to implement the report and wake-up phases of barrier synchronization , respectively. Algorithms for co...
متن کاملA Comparison of Adaptive Wormhole Routing
Improvement of message latency and network utilization in torus interconnection networks by increasing adaptivity in wormhole routing algorithms is studied. A recently proposed partially adaptive algorithm and four new fully-adaptive routing algorithms are compared with the well-known e-cube algorithm for uniform, hotspot, and local traac patterns. Our simulations indicate that the partially ad...
متن کاملMultidestination Message Passing in Wormhole K-ary N-cube Networks with Base Routing Conformed Paths 1
This paper proposes a novel concept of multidestination message passing mechanism for wormhole k-ary n-cube networks. Similar to the familiar car-pool concept, this mechanism allows data to be delivered to or picked-up from multiple nodes with a single message-passing step. Such messages can propagate along any valid path in a wormhole network conforming to the underlying base routing scheme (d...
متن کامل