Towards understanding exclusive read

Faith E. Fich; Avi Wigderson

doi:10.1145/72935.72944

Towards understanding exclusive read

Faith E. Fich
, Avi Wigderson

The Rachel and Selim Benin School of Engineering and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

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, we describe a natural Boolean function of n variables and show that the expected running time of any probabilistic EROW PRAM computing this function is in ω(√ log n) although it can be computed by a CROW PRAM in O(loglogn) steps.

Original language	English
Title of host publication	Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989
Editors	F.T. Leighton
Publisher	Association for Computing Machinery, Inc
Pages	76-82
Number of pages	7
ISBN (Electronic)	089791323X, 9780897913232
DOIs	https://doi.org/10.1145/72935.72944
State	Published - 1 Mar 1989
Event	1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989 - Santa Fe, United States Duration: 18 Jun 1989 → 21 Jun 1989

Publication series

Name	Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989

Conference

Conference	1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989
Country/Territory	United States
City	Santa Fe
Period	18/06/89 → 21/06/89

Bibliographical note

Publisher Copyright:
© 1989 ACM.

Access to Document

10.1145/72935.72944

Cite this

Fich, F. E., & Wigderson, A. (1989). Towards understanding exclusive read. In F. T. Leighton (Ed.), Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989 (pp. 76-82). (Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989). Association for Computing Machinery, Inc. https://doi.org/10.1145/72935.72944

@inproceedings{c2d5ef05459f4aa89f6052e62c9f1b2b,

title = "Towards 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, we describe a natural Boolean function of n variables and show that the expected running time of any probabilistic EROW PRAM computing this function is in ω(√ log n) although it can be computed by a CROW PRAM in O(loglogn) steps.",

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

note = "Publisher Copyright: {\textcopyright} 1989 ACM.; 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989 ; Conference date: 18-06-1989 Through 21-06-1989",

year = "1989",

month = mar,

day = "1",

doi = "10.1145/72935.72944",

language = "אנגלית",

series = "Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989",

publisher = "Association for Computing Machinery, Inc",

pages = "76--82",

editor = "F.T. Leighton",

booktitle = "Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989",

}

Fich, FE & Wigderson, A 1989, Towards understanding exclusive read. in FT Leighton (ed.), Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989. Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989, Association for Computing Machinery, Inc, pp. 76-82, 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989, Santa Fe, United States, 18/06/89. https://doi.org/10.1145/72935.72944

Towards understanding exclusive read. / Fich, Faith E.; Wigderson, Avi.
Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989. ed. / F.T. Leighton. Association for Computing Machinery, Inc, 1989. p. 76-82 (Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Towards understanding exclusive read

AU - Fich, Faith E.

AU - Wigderson, Avi

PY - 1989/3/1

Y1 - 1989/3/1

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, we describe a natural Boolean function of n variables and show that the expected running time of any probabilistic EROW PRAM computing this function is in ω(√ log n) although it can be computed by a CROW PRAM in O(loglogn) 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, we describe a natural Boolean function of n variables and show that the expected running time of any probabilistic EROW PRAM computing this function is in ω(√ log n) although it can be computed by a CROW PRAM in O(loglogn) steps.

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

U2 - 10.1145/72935.72944

DO - 10.1145/72935.72944

M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???

AN - SCOPUS:85034100102

T3 - Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989

SP - 76

EP - 82

BT - Proceedings of the 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989

A2 - Leighton, F.T.

PB - Association for Computing Machinery, Inc

T2 - 1st Annual ACM Symposium on Parallel Algorithms and Architectures, SPAA 1989

Y2 - 18 June 1989 through 21 June 1989

ER -

Towards understanding exclusive read

Abstract

Publication series

Conference

Bibliographical note

Access to Document

Other files and links

Fingerprint

Cite this