Efficient External Memory Algorithms by Simulating Coarse‐Grained Parallel Algorithms

External memory (EM) algorithms are designed for large‐scale computational problems in which the size of the internal memory of the computer is only a small fraction of the problem size. Typical EM algorithms are specially crafted for the EM situation. In the past, several attempts have been made to relate the large body of work on parallel algorithms to EM, but with limited success. The combination of EM computing, on multiple disks, with multiprocessor parallelism has been posted as a challenge by the ACM Working Group on Storage I/ O for Large‐Scale Computing.In this paper we provide a simulation technique which produces efficient parallel EM algorithms from efficient BSP‐like parallel algorithms. The techniques obtained can accommodate one or multiple processors on the EM target machine, each with one or more disks, and they also adapt to the disk blocking factor of the target machine. When applied to existing BSP‐like algorithms, our simulation technique produces improved parallel EM algorithms for a large number of problems.