Abstract
Wormhole routing is becoming a popular switching technique in the design of interprocessor communication networks. In this paper, we describe a set of experiments conducted on wormhole-routed Symult 2010 systems to measure the performance of their interprocessor communication networks. We then analyze the results to predict the performance of similar systems. We first show that long path lengths in this mesh have a negligible effect on communication time. Next, we show that the contention for network channels can scale up with the system size, and that the effect is observable in current machines. We also show that resources within a node itself can become a bottleneck. Given current architectural trends, we conclude that contention for network resources, and not path length, will become the primary concern in ensuring fast communication in future multicomputers.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.