Scheduling Regular and Irregular Communication Patterns on the CM-5

In this paper, we study the communication characteristics of the CM-5 and the performance e ects of scheduling regular and irregular communication patterns on the CM-5. We consider the scheduling of regular communication patterns such as complete exchange and broadcast. We have implemented four algorithms for complete exchange and studied their performances on a 2D FFT algorithm. We have also implemented four algorithms for scheduling irregular communication patterns and studied their performance on the communication patterns of several synthetic as well as real problems such as the conjugate gradient solver and the Euler solver.

• Type: Conference
• Year: 1992
• Where: SC
• Authors: Ravi Ponnusamy, Rajeev Thakur, Alok N. Choudhary, Geoffrey Fox
• Keywords: Applied Computing, Communication Patterns, Complete Exchange, Irregular Communication Patterns, SC 1992