Using multirail networks in high-performance clusters

• Published in: Concurrency and computation Vol. 15; no. 7-8; pp. 625 - 651
• Main Authors: Coll, Salvador, Frachtenberg, Eitan, Petrini, Fabrizio, Hoisie, Adolfy, Gurvits, Leonid
• Format: Journal Article
• Language: English
• Published: Chichester, UK John Wiley & Sons, Ltd 01-06-2003
• Subjects: communication libraries; communication protocols; high-performance interconnection networks; parallel architectures; performance evaluation; routing
• ISSN: 1532-0626; 1532-0634
• DOI: 10.1002/cpe.725

Using multiple independent networks (also known as rails) is an emerging technique which is being used to overcome bandwidth limitations and enhance fault tolerance of current high‐performance parallel computers. In this paper, we present and analyze various algorithms to allocate multiple communication rails, including static and dynamic allocation schemes. An analytical lower bound on the number of rails required for static rail allocation is shown. We also present an extensive experimental comparison of the behavior of various algorithms in terms of bandwidth and latency. We show that striping messages over multiple rails can substantially reduce network latency, depending on average message size, network load and allocation scheme. The methods compared include a static rail allocation, a basic round‐robin rail allocation, a local‐dynamic allocation based on local knowledge and a dynamic rail allocation that reserves both communication endpoints of a message before sending it. The last method is shown to perform better than the others at higher loads: up to 49% better than local‐knowledge allocation and 37% better than the round‐robin allocation. This allocation scheme also shows lower latency and it saturates at higher loads (for long enough messages). Most importantly, this proposed allocation scheme scales well with the number of rails and message size. In addition we propose a hybrid algorithm that combines the benefits of the local‐dynamic allocation for short messages with those of the dynamic algorithm for large messages. Copyright © 2003 John Wiley & Sons, Ltd.