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.

[1]  Isabelle Guérin Lassous,et al.  PRO: A Model for Parallel Resource-Optimal Computation , 2002, HPCS.

[2]  Edward F. Grove,et al.  External-memory graph algorithms , 1995, SODA '95.

[3]  A. Hadish Gebremedhin,et al.  PRO:a model for parallel resource-optimal computation , 2002, Proceedings 16th Annual International Symposium on High Performance Computing Systems and Applications.

[4]  Jeffrey Scott Vitter,et al.  Algorithms for parallel memory, I: Two-level memories , 2005, Algorithmica.

[5]  Torsten Suel,et al.  BSPlib: The BSP programming library , 1998, Parallel Comput..

[6]  Isabelle Guérin Lassous,et al.  Portable list ranking: an experimental study , 2000, JEAL.

[7]  Michael T. Goodrich,et al.  A bridging model for parallel computation, communication, and I/O , 1996, CSUR.

[8]  Jens Gustedt,et al.  Randomized permutations in a coarse grained parallel environment , 2003, SPAA '03.

[9]  Leslie G. Valiant,et al.  Direct Bulk-Synchronous Parallel Algorithms , 1994, J. Parallel Distributed Comput..

[10]  Olaf Bonorden,et al.  The Paderborn university BSP (PUB) library-design, implementation and performance , 1999, Proceedings 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing. IPPS/SPDP 1999.

[11]  Leslie G. Valiant,et al.  A bridging model for parallel computation , 1990, CACM.

[12]  Andrew Rau-Chaplin,et al.  Scalable parallel computational geometry for coarse grained multicomputers , 1996, Int. J. Comput. Geom. Appl..

[13]  Frank Dehne,et al.  Efficient External Memory Algorithms by Simulating Coarse-Grained Parallel Algorithms , 1997, SPAA '97.

[14]  Leslie G. Valiant,et al.  Direct Bulk-Synchronous Parallel Algorithms , 1992, J. Parallel Distributed Comput..

[15]  Isabelle Guérin Lassous,et al.  SSCRAP: An Environment for Coarse Grained Algorithms , 2002, IASTED PDCS.