Limitations of the QRQW and EREW PRAM models

DOI10.1007/3-540-62034-6_59MaRDI QIDQ6567781zbMATH OpenFDO

Authors Mirosław Kutyłowski, Krzysztof Loryś

Publication date 5 July 2024

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Recommendations

• scientific article; zbMATH DE number 1003297
• The Queue-Read Queue-Write PRAM Model: Accounting for Contention in Parallel Algorithms
• Lower bounds for randomized exclusive write PRAMs
• Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
• Limits on the power of parallel random access machines with weak forms of write conflict resolution

Cites work

• scientific article; zbMATH DE number 1003297 (Why is no real title available?)
• scientific article; zbMATH DE number 3485819 (Why is no real title available?)
• scientific article; zbMATH DE number 819814 (Why is no real title available?)
• A Remark on Stirling's Formula
• Exact lower time bounds for computing Boolean functions on CREW PRAMs
• Fast probabilistic algorithms for Hamiltonian circuits and matchings
• Optimal bounds for decision problems on the CRCW PRAM
• Retrieval of scattered information by EREW, CREW, and CRCW PRAMs
• Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes

This page was built for publication: Limitations of the QRQW and EREW PRAM models

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6567781)