performance evaluation of mesh-connected wormhole-routed networks for interprocessor communication in multicomputers
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.
performance performance evaluation mesh routing network communication switch design communication networks paper experience systems measurement predict effect timing contention scale size observability resource architecture future