Abstract
The portability of parallel programs has involved lot of effort during the last decade. PVM and MPI have greatly contributed to solve this drawback and nowadays most parallel programs are portable. However, the portability of the efficiency suffers, in many cases, from inherent effects of the target architectures. The optimal mapping of a parallel program is strongly dependent on the granularity and network architecture. We broach the problem of finding the optimal mapping of pipeline MPI programs. We propose an analytical model that allows an easy estimation of the parameters needed to obtain the mapping. The model is capable to be introduced into tools to produce this mapping automatically. Both the accuracy of the model and the optimal efficiency of the algorithm found are contrasted on a pipeline algorithm for the Path Planning Problem.
The work described in this paper has been partially supported by the Canary Government Research Project PI1999/122.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Andonov R., Rajopadhye S., Yanev N.. Optimal Orthogonal Tiling Euro-Par’98 Parallel Processing Lecture Notes in Computer Science, Vol. 1740. Springer-Verlag, (1998) 480–490.
Andonov R., Rajopadhye S.. Optimal Orthogonal Tiling of 2D Iterations. Journal of Parallel and Distributed computing, 45(2), (1997) 159–165.
Brandes T.. Exploiting Advanced Task Parallelism in High Performance Fortran via a Task Library. Euro-Par’99 Parallel Processing Lecture Notes in Computer Science, Vol. 1685. Springer-Verlag, (1999) 833–844.
Danelutto M., Pasqualetti F., Pelagati S.. Skeletons for data parallelism in p3l. Europar’97. Lecture Notes in Computer Science, Vol. 1470. Springer-Verlag, (1997) 619–628.
High Performance Fortran Language Specification Version 2.0 http://www.ntua.gr/parallel/standards/hpf/
Li G., Wah B.. Parallel Processing of Serial Dynamic Programming Problems. IEEE. 1985.
Miguet S., Robert Y.. Path Planning on a ring of Processors. International Journal Computer Math. Vol. 32Gordon and Breach Science Publishers. (1990) 61–74.
Morales D., Almeida F., Garcia F., Gonzalez J., Roda J., Rodriguez C. A Skeleton for Parallel Dynamic Programming. Euro-Par’99 Parallel Processing Lecture Notes in Computer Science, Vol. 1685. Springer-Verlag, (1999) 877–887.
Ramanujam J., Sadayappan.. Tiling Multidimensional Iterations Spaces for Non Shared-Memory Machines. Supercomputing’91. (1991) 111–120.
Rodriguez C, Roda J., Garcia F., Almeida F., Gonzalez D.. Paradigms for Parallel Dynamic Programming. Proceedings of the 22nd Euromicro Conference. Beyond 2000: Hardware and Software Strategies. IEEE. (1996) 553–563.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
González, D., Almeida, F., Moreno, L.M., Rodríguez, C. (2000). Pipeline Algorithms on MPI: Optimal Mapping of the Path Planing Problem. In: Dongarra, J., Kacsuk, P., Podhorszki, N. (eds) Recent Advances in Parallel Virtual Machine and Message Passing Interface. EuroPVM/MPI 2000. Lecture Notes in Computer Science, vol 1908. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45255-9_17
Download citation
DOI: https://doi.org/10.1007/3-540-45255-9_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41010-2
Online ISBN: 978-3-540-45255-3
eBook Packages: Springer Book Archive