New simulations between CRCW PRAMs

Bogdan S. Chlebus, Krzysztof Diks, Torben Hagerup, Tomasz Radzik

Research output: Chapter in Book/Report/Conference proceedingConference contribution

22 Scopus citations


This paper is part of a continued investigation of the relative power of different variants of the CRCW PRAM with infinite global memory. The models that we consider are the standard Priority and Common PRAMs, together with the less well-known Collision+ and Tolerant PRAMs. We describe several new results for the simulation of an n-processor Priority PRAM on weaker machines:(1)on an n-processor Tolerant PRAM: Slowdown O(√logn) (2) on an n-processor Collision+ PRAM: Slowdown O(log log n log(3)n);(3)on a Common PRAM with kn processors (k≤log n/2): Slowdown O(log n/(k log(log n/k)));(4)on a Tolerant PRAM with kn processors (2≤k≤log n): Slowdown O(log n/log k);(5)on a randomized n-processor Collision+ PRAM: Expected slowdown O(log log n).

Original languageEnglish (US)
Title of host publicationFundamentals of Computation Theory - International Conference, FCT 1989, Proceedings
EditorsJanos Demetrovics, Janos Csirik, Ferenc Gecseg
PublisherSpringer Verlag
Number of pages10
ISBN (Print)9783540514985
StatePublished - 1989
Externally publishedYes
Event7th International Conference on Fundamentals of Computation Theory, FCT 1989 - Szeged, Hungary
Duration: Aug 21 1989Aug 25 1989

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume380 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference7th International Conference on Fundamentals of Computation Theory, FCT 1989

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science


Dive into the research topics of 'New simulations between CRCW PRAMs'. Together they form a unique fingerprint.

Cite this