EasyGrid Enabling of Iterative Tightly-Coupled Parallel MPI Applications
Authors:
- Alexandre SenaASAlexandre Sena
- Aline NascimentoANAline Nascimento
- Cristina BoeresCBCristina Boeres
- Vinod RebelloVRVinod Rebello
- 1 December 2008
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 199-206
Abstract
This paper addresses the challenge of how to permit tightly coupled parallel applications, optimised for uniform, stable, static environments, execute equally efficiently in environments which exhibit the complete opposite characteristics. Using the N-body problem as a case study, both the traditional and proposed grid enabled MPI implementations of the popular ring algorithm are analysed. Results with respect to performance show the latter approach to be competitive on a cluster and significantly more effective in heterogeneous and dynamic environments.Keywords
This publication has 7 references indexed in Scilit:
- Dynamic Malleability in Iterative MPI Applications2007
- Performance analysis of direct N-body algorithms for astrophysical simulations on distributed systemsParallel Computing, 2007
- Distributed and dynamic self‐scheduling of parallel MPI Grid applicationsConcurrency and Computation: Practice and Experience, 2006
- Task Scheduling for Parallel Systems2006
- Systolic and hyper-systolic algorithms for the gravitational N-body problem, with an application to Brownian motionJournal of Computational Physics, 2003
- An efficient parallel algorithm for O(N2) direct summation method and its variations on distributed-memory parallel machinesNew Astronomy, 2002
- Realistic CPU Workloads through Host Load Trace Playback2000