Dynamic parallel memories

Uzi Vishkin*, Avi Wigderson

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

8 Scopus citations

Abstract

Say that a parallel algorithm that uses p processors and N (>p) shared memory locations is given. The problem of simulating this algorithm by p processors and only p shared memory locations without increasing the running time by more than a constant factor is considered. A solution for a family of such parallel algorithms is given. The solution utilizes the idea of dynamically changing locations of the addresses of the algorithm throughout the simulation.

Original languageEnglish
Pages (from-to)174-182
Number of pages9
JournalInformation and control
Volume56
Issue number3
DOIs
StatePublished - Mar 1983
Externally publishedYes

Fingerprint

Dive into the research topics of 'Dynamic parallel memories'. Together they form a unique fingerprint.

Cite this