A bridging model for parallel computation
Communications of the ACM
Parallel sorting by regular sampling
Journal of Parallel and Distributed Computing
Practical parallel algorithms for personalized communication and integer sorting
Journal of Experimental Algorithmics (JEA)
Parallel algorithms in external memory
Parallel algorithms in external memory
Towards realistic implementations of external memory algorithms using a coarse grained paradigm
ICCSA'03 Proceedings of the 2003 international conference on Computational science and its applications: PartII
STXXL: standard template library for XXL data sets
ESA'05 Proceedings of the 13th annual European conference on Algorithms
| Hi-index | 0.00 |
The theory of bulk-synchronous parallel computing has produced a large number of attractive algorithms, which are provably optimal in some sense, but typically require that the aggregate random access memory (RAM) of the processors be sufficient to hold the entire data set of the parallel problem instance. In this work we investigate the performance of parallel algorithms for extremely large problem instances relative to the available RAM. We describe a system, Parallel External Memory System (PEMS), which allows existing parallel programs designed for a large number of processors without disks to be adapted easily to smaller, realistic numbers of processors, each with its own disk system. Our experiments with PEMS show that this approach is practical and promising and the run times scale predictable with the number of processors and with the problem size.