By Topic

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

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
$33 $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

3 Author(s)
Heywood, T. ; Sch. of Comput. & Inf. Sci., Syracuse Univ., NY, USA ; Ghafoor, A. ; Chan, J.K.

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

Published in:

Parallel and Distributed Processing, 1990. Proceedings of the Second IEEE Symposium on

Date of Conference:

9-13 Dec 1990