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

Abstract

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
Pages231-239
Number of pages9
ISBN (Print)9783540501107
DOIs
StatePublished - Jan 1 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

Conference

Conference13th Symposium on Mathematical Foundations of Computer Science, MFCS 1988
CountrySerbia
CityCarlsbad
Period8/29/889/2/88

Fingerprint

Concurrent
Simulation
Data storage equipment
Efficient Algorithms
Collision
Model
Denote
Cell

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Chlebus, B. S., Diks, K., Hagerup, T., & Radzik, T. (1988). Efficient simulations between concurrent-read concurrent-write pram models. In M. P. Chytil, V. Koubek, & L. Janiga (Eds.), Mathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium (pp. 231-239). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 324 LNCS). Springer Verlag. https://doi.org/10.1007/BFb0017146

Efficient simulations between concurrent-read concurrent-write pram models. / Chlebus, B. S.; Diks, K.; Hagerup, T.; Radzik, T.

Mathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium. ed. / Michal P. Chytil; Vaclav Koubek; Ladislav Janiga. Springer Verlag, 1988. p. 231-239 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 324 LNCS).

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

Chlebus, BS, Diks, K, Hagerup, T & Radzik, T 1988, Efficient simulations between concurrent-read concurrent-write pram models. in MP Chytil, V Koubek & L Janiga (eds), Mathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 324 LNCS, Springer Verlag, pp. 231-239, 13th Symposium on Mathematical Foundations of Computer Science, MFCS 1988, Carlsbad, Serbia, 8/29/88. https://doi.org/10.1007/BFb0017146
Chlebus BS, Diks K, Hagerup T, Radzik T. Efficient simulations between concurrent-read concurrent-write pram models. In Chytil MP, Koubek V, Janiga L, editors, Mathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium. Springer Verlag. 1988. p. 231-239. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). https://doi.org/10.1007/BFb0017146
Chlebus, B. S. ; Diks, K. ; Hagerup, T. ; Radzik, T. / Efficient simulations between concurrent-read concurrent-write pram models. Mathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium. editor / Michal P. Chytil ; Vaclav Koubek ; Ladislav Janiga. Springer Verlag, 1988. pp. 231-239 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{aec5c9bae395438082c258effcb2ddaf,
title = "Efficient simulations between concurrent-read concurrent-write pram models",
abstract = "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.",
author = "Chlebus, {B. S.} and K. Diks and T. Hagerup and T. Radzik",
year = "1988",
month = "1",
day = "1",
doi = "10.1007/BFb0017146",
language = "English (US)",
isbn = "9783540501107",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "231--239",
editor = "Chytil, {Michal P.} and Vaclav Koubek and Ladislav Janiga",
booktitle = "Mathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium",

}

TY - GEN

T1 - Efficient simulations between concurrent-read concurrent-write pram models

AU - Chlebus, B. S.

AU - Diks, K.

AU - Hagerup, T.

AU - Radzik, T.

PY - 1988/1/1

Y1 - 1988/1/1

N2 - 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.

AB - 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.

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

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

U2 - 10.1007/BFb0017146

DO - 10.1007/BFb0017146

M3 - Conference contribution

AN - SCOPUS:84990689653

SN - 9783540501107

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 231

EP - 239

BT - Mathematical Foundations of Computer Science 1988 - Proceedings of the 13th Symposium

A2 - Chytil, Michal P.

A2 - Koubek, Vaclav

A2 - Janiga, Ladislav

PB - Springer Verlag

ER -