Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Transputer reference manual
Computer networks
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI
IEEE Transactions on Computers
Communications of the ACM
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
| Hi-index | 0.00 |
This paper provides efficient algorithms to deadlock-free route arbitrary multiprocessor interconnection networks as follows:1. An algorithm is derived for fixed directory routing on an arbitrary network topology such that messages will be routed via one of the shortest routes whilst maintaining an even distribution of traffic over the network (assuming that messages are generated and absorbed in an even manner, or two-phase random routing is used).2. An algorithm is presented which will evenly map virtual links onto the routed network so that it will be deadlock-free using the minimum number of buffer classes per physical link, thus maximising the buffer size per virtual link.