Collapsing the hierarchy of parallel computational models

DOI10.1142/S0129054110007350MaRDI QIDQ3569286zbMATH OpenFDO

Authors Stefan D. Bruda, Yuanqiao Zhang

Publication date 18 June 2010

Published in International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

parallel computationreal-time computationreconfigurable multiple bus machineparallel random access machinegraph accessibility problemreconfigurable networkbroadcast with selective reductionconcurrent-read concurrent-write conflict resolution rules

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Network design and communication in computer systems (68M10)

Recommendations

• Incomparability in parallel computation
• Relations between Concurrent-Write Models of Parallel Computation
• On the power of concurrent-write PRAMs with read-only memory
• Processor-time tradeoffs in PRAM simulations
• Sorting on PRAMs with reconfigurable buses

Cites work

• scientific article; zbMATH DE number 4068238 (Why is no real title available?)
• scientific article; zbMATH DE number 784042 (Why is no real title available?)
• Optimal BSR solutions to several convex polygon problems
• Parity, circuits, and the polynomial-time hierarchy
• Simulation of Parallel Random Access Machines by Circuits
• The complexity of reconfiguring network models
• Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model

This page was built for publication: Collapsing the hierarchy of parallel computational models

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