A scheme for deterministic simulation of a parallel random-access machine (PRAM) on a module parallel computer or on bounded-degree networks is described. The scheme requires only a constant memory blowup, thus achieving better memory utilization than previously known approaches. The method does not need time stamps, which were a basic element of all previous schemes. The improvements are achieved by adopting error-correcting-code techniques. Several coding methods are considered, and tradeoffs between memory utilization, run time, and the size of the PRAM shared memory are derived.
|Published - 1 Dec 1990