Issue No. 01 - January (1993 vol. 4)

ISSN: 1045-9219

pp: 111-117

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.205658

ABSTRACT

<p>The authors introduce a multiprocessor interconnection network, known ascube-connected Mobius ladders, which has an inherently deadlock-free routing strategyand hence has none of the buffering and computational overhead required bydeadlock-avoidance message passing algorithms. The basic network has a diameter phi of4n-1 for n2/sup n+2 /nodes and has a fixed node degree of 4. The network can beinterval routed in two stages and can be represented as a Cayley graph. This is the onlypractical fixed degree topology of size O(2/sup phi /) which has an inherentlydeadlock-free routing strategy, making it ideally suited for medium and large sizedtransputer networks.</p>

INDEX TERMS

Index Termsnetwork diameter; interval routing; deadlock-free fixed degree network; multiprocessorinterconnection network; cube-connected Mobius ladders; deadlock-free routingstrategy; fixed node degree; Cayley graph; fixed degree topology of size; transputernetworks; computational complexity; graph theory; multiprocessor interconnectionnetworks; parallel algorithms; topology

CITATION

D.J. Pritchard, D.A. Nicole, "Cube Connected Mobius Ladders: An Inherently Deadlock-Free Fixed Degree Network",

*IEEE Transactions on Parallel & Distributed Systems*, vol. 4, no. , pp. 111-117, January 1993, doi:10.1109/71.205658