From AAPC Algorithms to High Performance Permutation Routing and Sorting

Several recent papers have proposed or analyzed optimal algorithms to route all-to-all personalizedcommunication (AAPC) over communication networks such as meshes, hypercubes and omega switches. However, the constant factors of these algorithms are often an obscure function of system parameters such as link speed, processor clock rate, and memory access time. In this paper we investigate these architectural factors, showing the impact of the communication style, the network routing table, and most importantly, the local memory system, on AAPC performance and permutation routing on the Cray T3D. The fast hardware barriers on the T3D permit a straightforward AAPC implementation using routing phases separated by barriers, which improve performance by controlling congestion. However, we found that a practical implementation was difficult, and the resulting AAPC performance wasless than expected. After detailed analysis, several corrections were made to the AAPC algorithm and to the machin...

• Type: Conference
• Year: 1996
• Where: SPAA
• Authors: Thomas Stricker, Jonathan C. Hardwick
• Keywords: AAPC Implementation, AAPC Performance, Distributed And Parallel Computing, SPAA 1996, Straightforward Aapc Implementation