Adaptive Performance Modeling on Hierarchical Grid Computing Environments

In the past, efficient parallel algorithms have always been developed specifically for the successive generations of parallel systems (vector machines, shared-memory machines, distributed-memory machines, etc.). Today, due to many reasons, such as the inherent heterogeneity, the diversity, and the continuous evolution of the existing parallel execution supports, it is very hard to solve efficiently a target problem by using a single algorithm or to write portable programs that perform well on any computational supports. Toward this goal, we propose a generic framework based on communication models and adaptive approaches in order to adaptively model performances on grid computing environments. We apply this methodology on collective communication operations and show, by achieving experiments on a real platform, that the framework provides significant performances while determining the best combination model- algorithm depending on the problem and architecture parameters.

[1]  Yuefan Deng,et al.  New trends in high performance computing , 2001, Parallel Computing.

[2]  Mark J. Clement,et al.  Network Performance Modeling for PVM Clusters , 1996, Proceedings of the 1996 ACM/IEEE Conference on Supercomputing.

[3]  Thomas Rauber,et al.  Adaptive Selection of Communication Methods to Optimize Collective MPI Operations , 2005, PARCO.

[4]  Bruce Lowekamp,et al.  ECO: Efficient Collective Operations for communication on heterogeneous networks , 1996, Proceedings of International Conference on Parallel Processing.

[5]  Luiz Angelo Steffenel,et al.  Identifying Logical Homogeneous Clusters for Efficient Wide-Area Communications , 2004, PVM/MPI.

[6]  Seventh IEEE International Symposium on Cluster Computing and the Grid (CCGrid 2007), 14-17 May 2007, Rio de Janeiro, Brazil , 2007, CCGRID.

[7]  Luiz Angelo Barchet-Estefanel LaPIe : Communications Collectives adaptées aux Grilles de Calcul , 2005 .

[8]  Jack J. Dongarra,et al.  Automated empirical optimizations of software and the ATLAS project , 2001, Parallel Comput..

[9]  Ramesh Subramonian,et al.  LogP: a practical model of parallel computation , 1996, CACM.

[10]  Roger W. Hockney,et al.  The Communication Challenge for MPP: Intel Paragon and Meiko CS-2 , 1994, Parallel Computing.

[11]  Jack J. Dongarra,et al.  Performance analysis of MPI collective operations , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[12]  Csaba Andras Moritz,et al.  LoGPC: Modeling Network Contention in Message-Passing Programs , 2001, IEEE Trans. Parallel Distributed Syst..

[13]  Csaba Andras Moritz,et al.  LoGPC: modeling network contention in message-passing programs , 1998, SIGMETRICS '98/PERFORMANCE '98.

[14]  Viktor K. Prasanna,et al.  Adaptive communication algorithms for distributed heterogeneous systems , 1998, Proceedings. The Seventh International Symposium on High Performance Distributed Computing (Cat. No.98TB100244).

[15]  Chris Peterson,et al.  Implementing a Performance Forecasting System for Metacomputing The Network Weather Service , 1997, ACM/IEEE SC 1997 Conference (SC'97).

[16]  Joseph E. Flaherty,et al.  Resource-aware scientific computation on a heterogeneous cluster , 2005, Computing in Science & Engineering.

[17]  Grégory Mounié,et al.  Scheduling heuristics for efficient broadcast operations on grid environments , 2006, Proceedings 20th IEEE International Parallel & Distributed Processing Symposium.

[18]  Mary K. Vernon,et al.  LoPC: modeling contention in parallel algorithms , 1997, PPOPP '97.

[19]  Kees Verstoep,et al.  Network performance-aware collective communication for clustered wide-area systems , 2001, Parallel Comput..

[20]  Chris J. Scheiman,et al.  LogGP: incorporating long messages into the LogP model—one step closer towards a realistic model for parallel computation , 1995, SPAA '95.

[21]  Franck Cappello,et al.  An algorithmic model for heterogeneous hyper-clusters: rationale and experience , 2005, Int. J. Found. Comput. Sci..