Scheduling regular and irregular communication patterns on the CM-5
Open Access
- 2 January 2003
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
Abstract
The authors study the communication characteristics of the CM-5 (Connection Machine 5) and the performance effects of scheduling regular and irregular communication patterns on the CM-5. They consider the scheduling of regular communication patterns such as complete exchange and broadcast. They have implemented four algorithms for complete exchange and studied their performances on a 2-D FFT (fast Fourier transform) algorithm. They 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.<>Keywords
This publication has 5 references indexed in Scilit:
- A runtime data mapping scheme for irregular problemsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Performance effects of irregular communication patterns on massively parallel multiprocessorsJournal of Parallel and Distributed Computing, 1991
- Optimum broadcasting and personalized communication in hypercubesIEEE Transactions on Computers, 1989
- Benchmarking the iPSC/2 hypercube multiprocessorConcurrency: Practice and Experience, 1989
- Algorithms for Matrix Transposition on Boolean N-Cube Configured Ensemble ArchitecturesSIAM Journal on Matrix Analysis and Applications, 1988