Efficient simulations between concurrent-read concurrent-write pram models

B. S. Chlebus, K. Diks, T. Hagerup, T. Radzik

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

19 Scopus citations


We give several simple and efficient algorithms: for simulations of stronger GROW PRAMs on weaker ones. The models that we consider are the well-known PRIORITY, ARBITRARY and COMMON PRAMs, and COLLISION and COLLISION+, defined by the property that a special collision symbol is stored in each memory cell into which more than one processor attempts to write, or more than one value is attempted to be written, respectively, in a given step. Our results are the following, where n denotes the number of processors of the simulated PRAM: 1) A O(1)-time simulation between any pair of models, provided that the simulating machine has O(n log n) processors; 2) Two n-processor simulations: of PRIORITY on ARBITRARY with O(loglog n) slowdown, and of PRIORITY on COLLISION+ with 2 O((loglog n)2) slowdown.

Original languageEnglish (US)
Title of host publicationMathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium
EditorsMichal P. Chytil, Vaclav Koubek, Ladislav Janiga
PublisherSpringer Verlag
Number of pages9
ISBN (Print)9783540501107
StatePublished - 1988
Externally publishedYes
Event13th Symposium on Mathematical Foundations of Computer Science, MFCS 1988 - Carlsbad, Serbia
Duration: Aug 29 1988Sep 2 1988

Publication series

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


Conference13th Symposium on Mathematical Foundations of Computer Science, MFCS 1988

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)


Dive into the research topics of 'Efficient simulations between concurrent-read concurrent-write pram models'. Together they form a unique fingerprint.

Cite this