Dynamic parallel memories

Uzi Vishkin; Avi Wigderson

doi:10.1016/S0019-9958(83)80003-5

Dynamic parallel memories

Uzi Vishkin^*
, Avi Wigderson

^*Corresponding author for this work

Research output: Contribution to journal › Article › peer-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 language	English
Pages (from-to)	174-182
Number of pages	9
Journal	Information and control
Volume	56
Issue number	3
DOIs	https://doi.org/10.1016/S0019-9958(83)80003-5
State	Published - Mar 1983
Externally published	Yes

Access to Document

10.1016/S0019-9958(83)80003-5

Cite this

@article{eb91baac6209416fb1313245d7431049,

title = "Dynamic parallel memories",

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.",

author = "Uzi Vishkin and Avi Wigderson",

year = "1983",

month = mar,

doi = "10.1016/S0019-9958(83)80003-5",

language = "אנגלית",

volume = "56",

pages = "174--182",

journal = "Information and control",

issn = "0019-9958",

publisher = "Elsevier Inc.",

number = "3",

}

TY - JOUR

T1 - Dynamic parallel memories

AU - Vishkin, Uzi

AU - Wigderson, Avi

PY - 1983/3

Y1 - 1983/3

N2 - 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.

AB - 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.

UR - https://www.scopus.com/pages/publications/0020716107

U2 - 10.1016/S0019-9958(83)80003-5

DO - 10.1016/S0019-9958(83)80003-5

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:0020716107

SN - 0019-9958

VL - 56

SP - 174

EP - 182

JO - Information and control

JF - Information and control

IS - 3

ER -

Dynamic parallel memories

Abstract

Access to Document

Other files and links

Fingerprint

Cite this