We show that simulating a step of a FETCH&ADD PRAM model on an EREW PRAM model can be made as efficient as integer sorting. In particular, we present several efficient reductions of the simulation problem to various integer sorting problems. By using some recent algorithms for integer sorting, we get simulation algorithms on CREW and EREW that take o(n lg n) operations where n is the number of processors in the simulated CRCW machine. Previous simulations were using Θ(n lg n) operations. Some of the more interesting simulation results are obtained by using a boot-strapping technique with a CRCW PRAM algorithm for hashing.
|Number of pages||5|
|Journal||IEEE Symposium on Parallel and Distributed Processing - Proceedings|
|State||Published - 1995|
|Event||Proceedings of the IEEE 9th International Parallel Processing Symposium - Santa Barbara, CA, USA|
Duration: 25 Apr 1995 → 28 Apr 1995