Quantifying achievable routing performance in multiprocessor interconnection networks
Abstract
References
Index Terms
- Quantifying achievable routing performance in multiprocessor interconnection networks
Recommendations
Performance Analysis of k-ary n-cube Interconnection Networks
VLSI communication networks are wire-limited, i.e. the cost of a network is not a function of the number of switches required, but rather a function of the wiring density required to construct the network. Communication networks of varying dimensions ...
A Simulation Research on Multiprocessor Interconnection Networks With Wormhole Routing
APDC '97: Proceedings of the 1997 Advances in Parallel and Distributed Computing Conference (APDC '97)To design a parallel computer system, selecting an appropriate network is an important issue. This paper presents the simulation results on the performance of message passing interconnection networks used commonly in multiprocessor systems. Comparisons ...
Comments
Information & Contributors
Information
Published In
- May 1996279 pages
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 176Total Downloads
- Downloads (Last 12 months)16
- Downloads (Last 6 weeks)2
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in