Deterministic simulation of PRAMs on hypercube networks without look-up tables

A deterministic simulation of an N processor EREW PRAM on an N processor hypercube network is given, where the size of the PRAM's shared memory is significantly larger than N. Although the simulation is asymptotically less efficient and uses smaller shared memory than previous deterministic simulations, it is more practical in that it is based on an available interconnection network, its memory organization scheme (MOS) is easily constructible, and it does not require that large look-up tables encoding the entire MOS be stored in each processor.<
>