On separating the EREW and CREW PRAM models

DOI10.1016/0304-3975(89)90169-2zbMath0678.68049OpenAlexW2080765497MaRDI QIDQ1124343

Prabhakar Ragde, Eli Gafni, Joseph (Seffi) Naor

Publication date: 1989

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(89)90169-2

zbMATH Keywords

CREW PRAMEREW PRAMSelection Problem

Mathematics Subject Classification ID

Related Items (4)

Separating the power of EREW and CREW PRAMs with small communication width ⋮ Programmable and parallel water computing ⋮ Specifying reversibility with \(\mathrm{TLA}^+\) ⋮ Separating the power of EREW and CREW PRAMs with small communication width

Cites Work

• A tight ω(loglog n)-bound on the time for parallel RAM's to compute nondegenerated boolean functions
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes
• On Parallel Searching
• Relations between Concurrent-Write Models of Parallel Computation

This page was built for publication: On separating the EREW and CREW PRAM models