Deterministic PRAM simulation with constant memory blow-up and no time-stamps

Yonatan Aumann, Assaf Schuster

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

5 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationProc 3 Symp Front Massively Parallel Comput Frontiers 90
PublisherPubl by IEEE
Pages22-29
Number of pages8
ISBN (Print)0818620536
StatePublished - 1990
Externally publishedYes
EventProceedings of the 3rd Symposium on the Frontiers of Massively Parallel Computation - Frontiers '90 - College Park, MD, USA
Duration: 8 Oct 199010 Oct 1990

Publication series

NameProc 3 Symp Front Massively Parallel Comput Frontiers 90

Conference

ConferenceProceedings of the 3rd Symposium on the Frontiers of Massively Parallel Computation - Frontiers '90
CityCollege Park, MD, USA
Period8/10/9010/10/90

Fingerprint

Dive into the research topics of 'Deterministic PRAM simulation with constant memory blow-up and no time-stamps'. Together they form a unique fingerprint.

Cite this