@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 = jan,

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",

note = "13th Symposium on Mathematical Foundations of Computer Science, MFCS 1988 ; Conference date: 29-08-1988 Through 02-09-1988",

}