Cube connected Mobius ladders: an inherently deadlock-free fixed degree network

Pritchard, D J and Nicole, D A (1993) Cube connected Mobius ladders: an inherently deadlock-free fixed degree network. IEEE Transactions on Parallel and Distributed Systems, 4 (1), 111-117. (doi:10.1109/71.205658).

Abstract

The authors introduce a multiprocessor interconnection network, known as cube-connected Mobius ladders, which has an inherently deadlock-free routing strategy and hence has none of the buffering and computational overhead required by deadlock-avoidance message passing algorithms. The basic network has a diameter φ of 4n-1 for n2ⁿ⁺² nodes and has a fixed node degree of 4. The network can be interval routed in two stages and can be represented as a Cayley graph. This is the only practical fixed degree topology of size O(2^φ) which has an inherently deadlock-free routing strategy, making it ideally suited for medium and large sized transputer networks.

This record has no associated files available for download.

Contributors

Download statistics