Towards Realistic Implementations of External Memory Algorithms Using a Coarse Grained Paradigm
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.
KeywordsMemory Access Address Space List Ranking Realistic Implementation Memory Access Pattern
Unable to display preview. Download preview PDF.
- 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.Google Scholar
- Thomas H. Cormen and Michael T. Goodrich. A bridging model for parallel computation, communication, and I/O. ACM Computing Surveys, 28A(4), 1996.Google Scholar
- 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.Google Scholar
- Yves Denneulin and Raymond Namyst. PM2: Parallel multithreaded machine, un support d’exécution pour applications irrégulières. In RenPar 7, 1995.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.Google Scholar
- 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.