Barrier Synchronization on Wormhole-Routed Networks
IEEE Transactions on Parallel and Distributed Systems
An Application-Driven Study of Multicast Communication for Write Invalidation
The Journal of Supercomputing
Edinet: An Execution Driven Interconnection Network Simulator for DSM Systems
TOOLS '98 Proceedings of the 10th International Conference on Computer Performance Evaluation: Modelling Techniques and Tools
Performance prediction of wormhole switching in hypercubes with bursty traffic pattern
Proceedings of the 2003 ACM symposium on Applied computing
Performance Evaluation - Special issue: Distributed systems performance
A Family of Mechanisms for Congestion Control in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Analytical modelling of networks in multicomputer systems under bursty and batch arrival traffic
The Journal of Supercomputing
Performance analysis of interconnection networks under bursty and batch arrival traffic
ICA3PP'07 Proceedings of the 7th international conference on Algorithms and architectures for parallel processing
Journal of Systems and Software
| Hi-index | 0.00 |
Networks of workstations (NOWs) are becoming increasingly popular as an alternative to parallel computers. Typically, these networks present irregular topologies, providing the wiring flexibility, scalability, and incremental expansion capability required in this environment. Similar to the evolution of parallel computers, NOWs are also evolving from distributed memory to shared memory. However, distances between processors are longer in NOWs, leading to higher message latency and lower network bandwidth. Therefore, we can expect the network to be a bottleneck when executing some parallel applications on a NOW supporting a shared-memory programming paradigm.In this paper we analyze whether the interconnection network in a NOW is able to efficiently handle the traffic generated in a DSM with the same number of processors. We evaluate the behavior of a NOW using application traces captured during the execution of several SPLASH2 applications on a DSM simulator. We show through simulation that the adaptive routing algorithm previously proposed by us almost eliminates network saturation due to its ability to support a higher sustained throughput. Therefore, adaptive routing becomes a key design issue to achieve similar performance in NOWs and tightly-coupled DSMs.