Cube connected Mobius ladders: an inherently deadlock-free fixed degree network
David J. Pritchard, Denis A. Nicole · IEEE Transactions on Parallel and Distributed Systems · 1993
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 phi of 4n-1 for n2/sup n+2 /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/sup phi /) which has an inherently deadlock-free routing strategy, making it ideally suited for medium and large sized transputer networks.>