By Topic

A note on reducing parallel model simulations to integer sorting

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Matias, Y. ; AT&T Bell Labs., Murray Hill, NJ, USA ; Vishkin, U.

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 CROW machine. Previous simulations were using Θ(n lg n) operations. Some of the more interesting simulation results are obtained by using a bootstrapping technique with a CRCW PRAM algorithm for hashing

Published in:

Parallel Processing Symposium, 1995. Proceedings., 9th International

Date of Conference:

25-28 Apr 1995