Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
The Computer Journal
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Message passing in a transputer system
Microprocessors & Microsystems
Transputers and routers: components for concurrent machines
OUG-13 Proceedings of the 13th Occam user group technical meeting on Real-time systems with transputers
Proceedings of the world transputer user group (WOTUG) conference on Transputing '91
The routing problem in transputer-based parallel systems
Microprocessors & Microsystems
Tiny: an efficient routing harness for the Inmos transputer
Concurrency: Practice and Experience
Communications of the ACM
Design, implementation and evaluation of a deadlock-free routing algorithm for concurrent computers
Concurrency: Practice and Experience
Computer Networks
Adaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes
IEEE Transactions on Computers
ACM Transactions on Modeling and Computer Simulation (TOMACS) - Special issue on Web-based modeling and simulation
Adaptive Routing for Dynamic Applications in Massively Parallel Architectures
IEEE Parallel & Distributed Technology: Systems & Technology
Multiphase Complete Exchange on Paragon, SP2, and CS-2
IEEE Parallel & Distributed Technology: Systems & Technology
Hi-index | 0.00 |
The Tiny, CSN, Multiple Rings, and Ordered Dimensions, and interval labeling routing systems for transputer networks are reviewed. The systems are compared with respect to several criteria, such as adaptivity, deadlock freedom, generality, livelock freedom, and network latency.