Abstract
We present an extension to SSCRAP, our C++ environment for the development of coarse grained algorithms, that allows for easy execution of programs in an external memory setting. Our environment is well suited for regular as well as irregular problems and scales from low end PCs to high end clusters and mainframe technology. It allows running algorithms designed on a high level of abstraction in one of the known coarse grained parallel models without modification in an external memory setting. The first tests presented here in this paper show a very efficient behavior in the context of out-of-core computation (mapping memory to disk files), and even some (marginal) speed up when used to reduced cache misses for in-core computation.
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
Olaf Bonorden et al. The Paderborn University BSP (PUB) Library—Design, Implementation and Performance. In 13th International Parallel Processing Symposium & 10th Symposium on Parallel and Distributed Processing, 1999.
Thomas H. Cormen and Michael T. Goodrich. A bridging model for parallel computation, communication, and I/O. ACM Computing Surveys, 28A(4), 1996.
F. Dehne, W. Dittrich, and D. Hutchinson. Efficient external memory algorithms by simulating coarsegrained parallel algorithms. In ACM Symposium on Parallel Algorithms and Architectures, pages 106–115, 1997.
F. Dehne, A. Fabri, and A. Rau-Chaplin. Scalable parallel computational geometry for coarse grained multicomputers. International Journal on Computational Geometry, 6(3):379–400, 1996.
Yves Denneulin and Raymond Namyst. PM2: Parallel multithreaded machine, un support d’exécution pour applications irrégulières. In RenPar 7, 1995.
Mohamed Essaïdi, Isabelle Guérin Lassous, and Jens Gustedt. SSCRAP: An environment for coarse grained algorithms. In Fourteenth IASTED International Conference on Parallel and Distributed Computing and Systems (PDCS 2002), 2002.
Assefaw Hadish Gebremedhin, Isabelle Guérin Lassous, Jens Gustedt, and Jan Arne Telle. PRO: a model for parallel resource-optimal computation. In 16th Annual International Symposium on High Performance Computing Systems and Applications, pages 106–113. IEEE, The Institute of Electrical and Electronics Engineers, 2002.
Alexandros V. Gerbessiotis and Leslie G. Valiant. Direct bulk-synchronous parallel algorithms. Journal of Parallel and Distributed Computing, 22(2):251–267, 1994.
M.W. Goudrau, K. Lang, S. B. Rao, and T. Tsantilas. The green BSP library. Technical Report TR-95-11, University of Central Florida, Orlando, 1995.
Isabelle Guérin Lassous and Jens Gustedt. Portable list ranking: an experimental study. ACM Journal of Experimental Algorithmics, 7(7), 2002. http://www.jea.acm.org/2002/GuerinRanking/.
Jens Gustedt. Randomized permutations in a coarse grained parallel environment. Technical Report RR-4639, INRIA, November 2002.
Jonathan M. D. Hill et al. BSPlib: The BSP programming library. Technical report, Oxford University Computing Laboratory, 1997. URL http://www.bsp-worldwide.org/standard/bsplib_C_examples.ps.Z.
Richard Miller. A library for bulk-synchronous parallel programming. In British Computer Society Parallel Processing Specialist Group workshop on General Purpose Parallel Computing, 1993. URL http://www.comlab.ox.ac.uk/oucl/oxpara/ppsg.ps.gz.
Leslie G. Valiant. A bridging model for parallel computation. Communications of the ACM, 33(8): 103–111, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Gustedt, J. (2003). Towards Realistic Implementations of External Memory Algorithms Using a Coarse Grained Paradigm. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds) Computational Science and Its Applications — ICCSA 2003. ICCSA 2003. Lecture Notes in Computer Science, vol 2668. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44843-8_29
Download citation
DOI: https://doi.org/10.1007/3-540-44843-8_29
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40161-2
Online ISBN: 978-3-540-44843-3
eBook Packages: Springer Book Archive