Simulations among concurrent-write PRAMs

Faith E. Fich; Prabhakar Ragde; Avi Wigderson

doi:10.1007/BF01762109

Simulations among concurrent-write PRAMs

Faith E. Fich^*, Prabhakar Ragde, Avi Wigderson

^*Corresponding author for this work

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Contribution to journal › Article › peer-review

31 Scopus citations

Abstract

This paper is concerned with the relative power of the two most popular concurrent-write models of parallel computation, the PRIORITY PRAM [G], and the COMMON PRAM [K]. Improving the trivial and seemingly optimal O(log n) simulation, we show that one step of a PRIORITY machine can be simulated by O(log n/(log log n)) steps of a COMMON machine with the same number of processors (and more memory). We further prove that this is optimal, if processor communication is restricted in a natural way.

Original language	English
Pages (from-to)	43-51
Number of pages	9
Journal	Algorithmica
Volume	3
Issue number	1-4
DOIs	https://doi.org/10.1007/BF01762109
State	Published - Nov 1988

Keywords

Lower bounds
Parallel random access machines
Write-conflict resolution

Access to Document

10.1007/BF01762109

Cite this

@article{1f6cb77e32e945728a2587179c9a53df,

title = "Simulations among concurrent-write PRAMs",

abstract = "This paper is concerned with the relative power of the two most popular concurrent-write models of parallel computation, the PRIORITY PRAM [G], and the COMMON PRAM [K]. Improving the trivial and seemingly optimal O(log n) simulation, we show that one step of a PRIORITY machine can be simulated by O(log n/(log log n)) steps of a COMMON machine with the same number of processors (and more memory). We further prove that this is optimal, if processor communication is restricted in a natural way.",

keywords = "Lower bounds, Parallel random access machines, Write-conflict resolution",

author = "Fich, {Faith E.} and Prabhakar Ragde and Avi Wigderson",

year = "1988",

month = nov,

doi = "10.1007/BF01762109",

language = "אנגלית",

volume = "3",

pages = "43--51",

journal = "Algorithmica",

issn = "0178-4617",

publisher = "Springer New York",

number = "1-4",

}

TY - JOUR

T1 - Simulations among concurrent-write PRAMs

AU - Fich, Faith E.

AU - Ragde, Prabhakar

AU - Wigderson, Avi

PY - 1988/11

Y1 - 1988/11

N2 - This paper is concerned with the relative power of the two most popular concurrent-write models of parallel computation, the PRIORITY PRAM [G], and the COMMON PRAM [K]. Improving the trivial and seemingly optimal O(log n) simulation, we show that one step of a PRIORITY machine can be simulated by O(log n/(log log n)) steps of a COMMON machine with the same number of processors (and more memory). We further prove that this is optimal, if processor communication is restricted in a natural way.

AB - This paper is concerned with the relative power of the two most popular concurrent-write models of parallel computation, the PRIORITY PRAM [G], and the COMMON PRAM [K]. Improving the trivial and seemingly optimal O(log n) simulation, we show that one step of a PRIORITY machine can be simulated by O(log n/(log log n)) steps of a COMMON machine with the same number of processors (and more memory). We further prove that this is optimal, if processor communication is restricted in a natural way.

KW - Lower bounds

KW - Parallel random access machines

KW - Write-conflict resolution

UR - http://www.scopus.com/inward/record.url?scp=52449144858&partnerID=8YFLogxK

U2 - 10.1007/BF01762109

DO - 10.1007/BF01762109

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

AN - SCOPUS:52449144858

SN - 0178-4617

VL - 3

SP - 43

EP - 51

JO - Algorithmica

JF - Algorithmica

IS - 1-4

ER -

Simulations among concurrent-write PRAMs

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this