Abstract
The asynchronous iteration model, called AIAC, has been proven to be an efficient solution for heterogeneous and distributed architectures. An efficient mapping of application tasks is essential to reduce their execution time. In this paper we present a new mapping algorithm, called MAHEVE (Mapping Algorithm for HEterogeneous and Volatile Environments) which is efficient on such architectures and integrates a fault tolerance mechanism to resist computing node failures. Our experiments show gains on a typical AIAC application execution time up to 65%, executed on distributed clusters architectures containing more than 400 computing cores with the JaceP2P-V2 environment.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Grid 5000, http://www.grid5000.fr
Bahi, J., Contassot-Vivier, S., Couturier, R.: Performance comparison of parallel programming environments for implementing AIAC algorithms. Journal of Supercomputing 35(3), 227–244 (2006)
Bahi, J., Contassot-Vivier, S., Couturier, R.: Asynchronous Iterations. In: Parallel Iterative Algorithms: from Sequential to Grid Computing. Numerical Analysis & Scientific Computating, vol. 1. Chapman & Hall/CRC, Boca Raton (2007)
Bailey, D., et al.: The NAS Parallel Benchmarks. Tech. Rep. RNR-94-007, NASA Advanced Supercomputing (NAS) Division (March 1994)
Charr, J.C., Couturier, R., Laiymani, D.: JACEP2P-V2: A fully decentralized and fault tolerant environment for executing parallel iterative asynchronous applications on volatile distributed architectures. In: Abdennadher, N., Petcu, D. (eds.) GPC 2009. LNCS, vol. 5529, pp. 446–458. Springer, Heidelberg (2009)
Couturier, R., Laiymani, D., Miquée, S.: Mapping asynchronous iterative applications on heterogeneous distributed architectures. In: PDSEC 2010 (2010)
Elnozahy, E.N., Alvisi, L., Wang, Y., Johnson, D.: A survey of rollback-recovery protocols in message-passing systems. ACM Comput. Surv. 34(3), 375–408 (2002)
Hendrickson, B., Leland, R.W.: The Chaco User’s Guide (1995)
Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partioning irregular graphs. SIAM Journal on Scientific Computing 20(1), 359–392 (1998)
Kumar, S., Das, S.K., Biswas, R.: Graph partitioning for parallel applications in heterogeneous grid environments. In: IPDPS (2002)
Long, D.L., Clarke, L.A.: Task interaction graphs for concurrency analysis. In: ICSE, pp. 44–52 (1989)
Phinjaroenphan, P.: An Efficient, Pratical, Portable Mapping Technique on Computational Grids. Ph.D. thesis, RMIT University (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2011 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Couturier, R., Laiymani, D., Miquée, S. (2011). MAHEVE: An Efficient Reliable Mapping of Asynchronous Iterative Applications on Volatile and Heterogeneous Environments. In: Guarracino, M.R., et al. Euro-Par 2010 Parallel Processing Workshops. Euro-Par 2010. Lecture Notes in Computer Science, vol 6586. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-21878-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-642-21878-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-21877-4
Online ISBN: 978-3-642-21878-1
eBook Packages: Computer ScienceComputer Science (R0)