Abstract
This is an initial case on exploring the application of algorithmic skeletons to abstract low-level interprocess communication in MPI. The main purpose is intended to illustrate the competitive performance demonstrated by the skeletal approach when compared to utilization of the pure MPI, whilst providing an abstraction with reusability advantages. This initial work involves the implementation of the Wagar’s hyperquicksort algorithm in conjunction with the MPI-based eSkel skeleton library. The reported results compare three MPI-based implementations of hyperquicksort. Firstly a canonic MPI one; secondly, two implementations using the MPI-based skeletal library eSkel. Lastly, the S3L_sort routine, part of its optimized numerical libraries from Sun, is employed as baseline. This overall comparison demonstrates that the use of algorithmic skeletons caused a slight performance degradation, while providing some promising guidance on the use of abstraction for low-level communication operations using the eSkel model.
This work has been partly supported by the EC-funded project HPC-Europa, contract number 506079. The author would like to thank Murray Cole for useful discussions and advice.
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
Message Passing Interface Forum: MPI standard and documentation (2003), www.mpi-forum.org/docs/docs.html
Cole, M.: Algorithmic Skeletons: Structured management of parallel computation. MIT Press, Cambridge (1989)
Cole, M.: Algorithmic skeletons. In: Hammond, K., Michaelson, G. (eds.) Research Directions in Parallel Functional Programming, pp. 289–304. Springer, London (1999)
Rabhi, F.A., Gorlatch, S. (eds.): Patterns and skeletons for parallel and distributed computing. Springer, London (2003)
González-Vélez, H., de Luca, A., González-Vélez, V.: A comparative study of intrinsic parallel programming methodologies. In: Int. Conf. on Electrical and Electronics Engineering, IEEE CS, Los Alamitos (2004)
Structured Parallelism Group, University of Edinburgh: eSkel (2003), homepages.inf.ed.ac.uk/mic/eSkel/
Cole, M.: Bringing skeletons out of the closet: a pragmatic manifesto for skeletal parallel programming. Parallel Computing 30, 389–406 (2004)
Gorlatch, S.: Message passing without send-receive. Future Generation Computer Systems 18, 797–805 (2002)
Wagar, B.: Hyperquicksort: A fast sorting algorithm for hypercubes. In: Heath, M. (ed.) Hypercube Multiprocessors, pp. 292–299. SIAM, Philadelphia (1987)
Blelloch, G.E., Leiserson, C.E., Maggs, B.M., Plaxton, C.G., Smith, S.J., Zagha, M.: An experimental analysis of parallel sorting algorithms. Theoretical Computer Science 31, 135–167 (1998)
Rochester Institute of Technology: MPI implementation of hyperquicksort (2003), httpwww.cs.rit.edu/usr/local/pub/ncs/parallel/mpi/hqs.c
Sun Microsystems: Sun HPC ClusterTools 5 software user’s guide (2003), docs.sun.com/source/817-0084-10
Bader, D.A., Moret, B.M.E., Sanders, P.: Algorithm engineering for parallel computation. In: Fleischer, R., Moret, B.M.E., Schmidt, E.M. (eds.) Experimental Algorithmics. LNCS, vol. 2547, pp. 1–23. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
González-Vélez, H. (2005). On the Abstraction of Message-Passing Communications Using Algorithmic Skeletons. In: Ramos, F.F., Larios Rosillo, V., Unger, H. (eds) Advanced Distributed Systems. ISSADS 2005. Lecture Notes in Computer Science, vol 3563. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11533962_5
Download citation
DOI: https://doi.org/10.1007/11533962_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28063-7
Online ISBN: 978-3-540-31674-9
eBook Packages: Computer ScienceComputer Science (R0)