Data networks
Operating systems: design and implementation
Operating systems: design and implementation
Computer communications and networks
Computer communications and networks
Object-oriented programming in Microsoft C++
Object-oriented programming in Microsoft C++
Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A Framework for Designing Deadlock-Free Wormhole Routing Algorithms
IEEE Transactions on Parallel and Distributed Systems
A Broadcast Algorithm for All-Port Wormhole-Routed Torus Networks
IEEE Transactions on Parallel and Distributed Systems
PP-MESS-SIM: A Flexible and Extensible Simulator for Evaluating Multicomputer Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
All-to-All Broadcasting in Faulty Hypercubes
IEEE Transactions on Computers
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks
IEEE Transactions on Computers
Communication in Multicomputers with Nonconvex Faults
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Wormhole routing, the latest switching technique to be utilized by massively parallel computers, enjoys the distinct advantage of a low latency when compared to other switching techniques. More simulation tools would prove beneficial to the communication research community to aid in evaluating wormhole routed algorithms. These tools should reveal the optimum use of the network resources, which will allow for new algorithms to be compared against previously proven algorithms. Some of these resources include topology, buffers, virtual channels, and message size. The contribution of this research is a simulator that simulates network activity for three selected wormhole routed algorithms. The simulator provides an optimal network setting for each of the three simulated algorithms. The simulator will allow for settings other than reported in the literature. Thus allowing for new results for each algorithm to be achieved. Experimental results with various settings will be shown, to coincide with previous observations that will substantiate the integrity of the simulator. These results will then be used to deduce an optimal setting for each algorithm. These settings differ from previous reports in the literature for each algorithm.