### Abstract

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 language | English (US) |
---|---|

Title of host publication | Fundamentals of Computation Theory - International Conference, FCT 1989, Proceedings |

Editors | Janos Demetrovics, Janos Csirik, Ferenc Gecseg |

Publisher | Springer Verlag |

Pages | 95-104 |

Number of pages | 10 |

ISBN (Print) | 9783540514985 |

DOIs | |

State | Published - Jan 1 1989 |

Externally published | Yes |

Event | 7th International Conference on Fundamentals of Computation Theory, FCT 1989 - Szeged, Hungary Duration: Aug 21 1989 → Aug 25 1989 |

### Publication series

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

Volume | 380 LNCS |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 7th International Conference on Fundamentals of Computation Theory, FCT 1989 |
---|---|

Country | Hungary |

City | Szeged |

Period | 8/21/89 → 8/25/89 |

### Fingerprint

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

### Cite this

*Fundamentals of Computation Theory - International Conference, FCT 1989, Proceedings*(pp. 95-104). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 380 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-51498-8_9

**New simulations between CRCW PRAMs.** / Chlebus, Bogdan S.; Diks, Krzysztof; Hagerup, Torben; Radzik, Tomasz.

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

*Fundamentals of Computation Theory - International Conference, FCT 1989, Proceedings.*Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 380 LNCS, Springer Verlag, pp. 95-104, 7th International Conference on Fundamentals of Computation Theory, FCT 1989, Szeged, Hungary, 8/21/89. https://doi.org/10.1007/3-540-51498-8_9

}

TY - GEN

T1 - New simulations between CRCW PRAMs

AU - Chlebus, Bogdan S.

AU - Diks, Krzysztof

AU - Hagerup, Torben

AU - Radzik, Tomasz

PY - 1989/1/1

Y1 - 1989/1/1

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

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

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

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

U2 - 10.1007/3-540-51498-8_9

DO - 10.1007/3-540-51498-8_9

M3 - Conference contribution

AN - SCOPUS:85027619792

SN - 9783540514985

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

SP - 95

EP - 104

BT - Fundamentals of Computation Theory - International Conference, FCT 1989, Proceedings

A2 - Demetrovics, Janos

A2 - Csirik, Janos

A2 - Gecseg, Ferenc

PB - Springer Verlag

ER -