Online mapping of MPI-2 dynamic tasks to processes and threads
by Joao V.F. Lima, Nicolas Maillard
International Journal of High Performance Systems Architecture (IJHPSA), Vol. 2, No. 2, 2009

Abstract: In recent years, distributed platforms became largely used on HPC, and most of these architectures have different levels of parallelism. Hence, one of the key design stages in parallel programming is task mapping which attempts to maximise processor utilisation and minimise communication cost. However, this depends on a programming environment with efficient mapping scheme. This paper presents a library to MPI-2 (libSpawn) that implements a scheme to map tasks between processes and threads in order to minimise communications and task creation costs. We evaluated the libSpawn with two dynamic MPI programs: Fibonacci and Mergesort. Our experiments demonstrate that the mapping scheme offers significant performance improvements.

Online publication date: Thu, 04-Mar-2010

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of High Performance Systems Architecture (IJHPSA):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com