A flit level simulator for wormhole routing
Pages 109 - 116
Abstract
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.
References
[1]
Berman P., Gravano L., and Pifarre D. Adaptive Deadlock and Livelock Free Routing with All Minimal Paths in Torus Networks in Proceedings of ACM Conference on Parallel Algorithms and Architectures (1992) pp. 3--12.
[2]
Bertsekas D. and Gallager R. Data Networks Prentice Hall pp. 1--14, pp. 363--379, pp. 493--500, 1992.
[3]
Boppana R. V. and Chalasani S., A Framework for Designing Deadlock Free Wormhole Routing Algorithms in IEEE Transactions on Parallel and Distributed Systems (1997) vol.7, no.2.
[4]
Boppana R. V. and Chalasani S., Fault Tolerant Wormhole Routing Algorithms for Mesh Networks in IEEE Transactions on Computers (1995) vol.44, no.7.
[5]
Boppana R. V. and Chalasani S., Communication in Multicomputers with Nonconvex Faults in IEEE Transactions on Computers (1997) vol.46, no.5.
[6]
Dally W. J., Virtual Channel Flow Control in IEEE Transactions on Parallel and Distributed Systems (1992) vol.3, no. 2.
[7]
Duato J., Yalmanchili S., and Ni L. Interconnection Networks, An Engineering Approach IEEE Press pp. 1--65, pp. 401--472, 1997.
[8]
Freer J. Computer Communications and Networks IEEE Press pp. 1--3, pp. 3--16, pp. 73--82, pp. 91--112, pp. 121--150, 1996.
[9]
Lafore R. Object-Oriented Programming in MicroSoft C++ Waite Group Press pp. 7--16, 1992.
[10]
McKinely P. K. and Ni L. A Survey of Wormhole Routing Techniques in Direct Networks in Computer (February 1993) pp. 62--76.
[11]
McKinely P. K. and Robinson D. F. Collective Communication in Wormhole Routed Massively Parallel Computers in Computer (December 1995) pp. 39--50.
[12]
McKinely P. K. and Tsai Y. An Extended Dominating Node Approach to Broadcast and Global Combine in Multiport Wormhole-Routed Mesh Networks in IEEE Transactions on Parallel and Distributed Systems (1997) vol.8, no. 1.
[13]
McKinely P. K. and Tsai Y. A Broadcast Algorithm for All-Port Wormhole Routed Torus Networks in IEEE Transactions on Parallel and Distributed Systems (1997) vol.7, no.8.
[14]
McKinley P. K., et. al. Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers in IEEE Transactions on Parallel and Distributed Systems (1994) vol.5, no.8.
[15]
Park S. and Bose B., All-to-All Broadcasting in Faulty Hypercubes in IEEE Transactions on Computers (1997) vol. 46, no.7.
[16]
Rexford J. et. al. PP-MESS-SIM: A Flexible and Extensible Simulator for Evaluating Multicomputer Networks in IEEE Transactions on Parallel and Distributed Systems (1997) vol.8, no.1.
[17]
Stalling W. Data and Computer Communications MacMillan pp. 436--462, 1994.
[18]
Tanenbaum A. S. Operating Systems, Design and Implementation Prentice Hall pp. 122--127, 1987.
Recommendations
New wormhole routing algorithms for multicomputers
IPPS '93: Proceedings of the 1993 Seventh International Parallel Processing SymposiumDevelopment of wormhole routing techniques so far has been largely independent of the results available for store-and-forward routing in literature. The authors provide a general result which enables them to design deadlock-free wormhole routing ...
A comparison of adaptive wormhole routing algorithms
ISCA '93: Proceedings of the 20th annual international symposium on computer architectureImprovement of message latency and network utilization in torus interconnection networks by increasing adaptivity in wormhole routing algorithms is studied. A recently proposed partially adaptive algorithm and four new fully-adaptive routing algorithms ...
A comparison of adaptive wormhole routing algorithms
Special Issue: Proceedings of the 20th annual international symposium on Computer architecture (ISCA '93)Improvement of message latency and network utilization in torus interconnection networks by increasing adaptivity in wormhole routing algorithms is studied. A recently proposed partially adaptive algorithm and four new fully-adaptive routing algorithms ...
Comments
Information & Contributors
Information
Published In
Copyright © 2000 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 07 April 2000
Check for updates
Qualifiers
- Article
Conference
ACM-SE00
ACM-SE00: ACM-SE '00 - 38th Annual ACM Southeast Regional Conference 2000
April 7 - 8, 2000
South Carolina, Clemson
Acceptance Rates
ACMSE '00 Paper Acceptance Rate 46 of 46 submissions, 100%;
Overall Acceptance Rate 502 of 1,023 submissions, 49%
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 282Total Downloads
- Downloads (Last 12 months)43
- Downloads (Last 6 weeks)14
Reflects downloads up to 12 Nov 2024
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