On the power of concurrent-write PRAMs with read-only memory

DOI10.1016/0890-5401(89)90059-XMaRDI QIDQ582089zbMATH OpenFDO

Authors Faith E. Fich, Ming Li, Prabhakar Ragde, Yaacov Yesha

Publication date 1989

Published in Information and Computation (Search for Journal in Brave)

zbMATH Keywords

complexityshared memoryArbitrary modelCommon modelsCRCW PRAMPriority model

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Theory of operating systems (68N25)

Recommendations

• Relations between Concurrent-Write Models of Parallel Computation
• Incomparability in parallel computation
• Processor-time tradeoffs in PRAM simulations
• scientific article; zbMATH DE number 512845
• Simulations among concurrent-write PRAMs

Cites work

• scientific article; zbMATH DE number 3758364 (Why is no real title available?)
• Relations between Concurrent-Write Models of Parallel Computation
• Simulations among concurrent-write PRAMs
• The Parallel Complexity of Element Distinctness is $\Omega ( \sqrt{\log n} )$
• Trade-Offs between Depth and Width in Parallel Computation

Cited in

(9)

• scientific article; zbMATH DE number 512845 (Why is no real title available?)
• scientific article; zbMATH DE number 176775 (Why is no real title available?)
• Collapsing the hierarchy of parallel computational models
• Compression using efficient multicasting
• Simulations among concurrent-write PRAMs
• Separation and lower bounds for ROM and nondeterministic models of parallel computation
• Parallel Time $O(\log n)$ Acceptance of Deterministic CFL<scp>s</scp> on an Exclusive-Write P-RAM
• Limits on the power of parallel random access machines with weak forms of write conflict resolution
• Incomparability in parallel computation

This page was built for publication: On the power of concurrent-write PRAMs with read-only memory

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