Toward understanding exclusive read

Faith E. Fich; Avi Wigderson

doi:10.1137/0219050

Toward understanding exclusive read

Faith E. Fich^*, Avi Wigderson

^*Corresponding author for this work

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

7 Scopus citations

Abstract

The ability of many processors to simultaneously read from the same cell of shared memory can give additional power to a parallel random access machine. In this paper, a natural Boolean function of n variables is described, and it is shown that the expected running time of any probabilitic EROW PRAM computing this function is in Ω(√log n), although it can be computed by a CROW PRAM in O(log log n) steps.

Original language	English
Pages (from-to)	718-727
Number of pages	10
Journal	SIAM Journal on Computing
Volume	19
Issue number	4
DOIs	https://doi.org/10.1137/0219050
State	Published - 1990
Externally published	Yes

Access to Document

10.1137/0219050

Cite this

@article{90fc7c2eee584c108eb327479a5b3706,

title = "Toward understanding exclusive read",

abstract = "The ability of many processors to simultaneously read from the same cell of shared memory can give additional power to a parallel random access machine. In this paper, a natural Boolean function of n variables is described, and it is shown that the expected running time of any probabilitic EROW PRAM computing this function is in Ω(√log n), although it can be computed by a CROW PRAM in O(log log n) steps.",

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

year = "1990",

doi = "10.1137/0219050",

language = "אנגלית",

volume = "19",

pages = "718--727",

journal = "SIAM Journal on Computing",

issn = "0097-5397",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "4",

}

TY - JOUR

T1 - Toward understanding exclusive read

AU - Fich, Faith E.

AU - Wigderson, Avi

PY - 1990

Y1 - 1990

N2 - The ability of many processors to simultaneously read from the same cell of shared memory can give additional power to a parallel random access machine. In this paper, a natural Boolean function of n variables is described, and it is shown that the expected running time of any probabilitic EROW PRAM computing this function is in Ω(√log n), although it can be computed by a CROW PRAM in O(log log n) steps.

AB - The ability of many processors to simultaneously read from the same cell of shared memory can give additional power to a parallel random access machine. In this paper, a natural Boolean function of n variables is described, and it is shown that the expected running time of any probabilitic EROW PRAM computing this function is in Ω(√log n), although it can be computed by a CROW PRAM in O(log log n) steps.

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

U2 - 10.1137/0219050

DO - 10.1137/0219050

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

AN - SCOPUS:0025476280

SN - 0097-5397

VL - 19

SP - 718

EP - 727

JO - SIAM Journal on Computing

JF - SIAM Journal on Computing

IS - 4

ER -

Toward understanding exclusive read

Abstract

Access to Document

Other files and links

Fingerprint

Cite this