Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
The Computer Journal
Transputer reference manual
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
High performance communications in processor networks
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Deadlock-free packet switching networks
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A large scale, homogeneous, fully distributed parallel machine, I
ISCA '77 Proceedings of the 4th annual symposium on Computer architecture
The extension of object-oriented languages to a homogeneous, concurrent architecture
The extension of object-oriented languages to a homogeneous, concurrent architecture
The cube-connected-cycles: A versatile network for parallel computation
SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
A method of trading diameter for reduced degree to construct low cost interconnection networks
Proceedings of the 1999 ACM symposium on Applied computing
| Hi-index | 0.01 |
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.