COLLAPSING THE HIERARCHY OF PARALLEL COMPUTATIONAL MODELS

DOI10.1142/S0129054110007350zbMath1192.68273MaRDI QIDQ3569286

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

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

Cites Work

• Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model
• The complexity of reconfiguring network models
• Simulation of Parallel Random Access Machines by Circuits
• Parity, circuits, and the polynomial-time hierarchy
• Optimal BSR solutions to several convex polygon problems
• Unnamed Item
• Unnamed Item

This page was built for publication: COLLAPSING THE HIERARCHY OF PARALLEL COMPUTATIONAL MODELS