Abstract.
We introduce a formalism which allows to treat computer architecture as a formal optimization problem. We apply this to the design of shared memory parallel machines. While present parallel computers of this type only support the programming model of a shared memory but often process simultaneous access by several processors to the shared memory sequentially, theoretical computer science offers solutions for this problem that are provably fast and asymptotically optimal. But the constants in these constructions seemed to be too large to let them be competitive. We modify these constructions under engineering aspects and improve the price/performance ratio by roughly a factor of 6. The resulting machine has surprisingly good price/performance ratio even if compared with distributed memory machines. For almost all access patterns of all processors into the shared memory, access is as fast as the access of only a single processor.
Similar content being viewed by others
Author information
Authors and Affiliations
Additional information
Received: 29 June 1993 / 22 June 1999
Rights and permissions
About this article
Cite this article
Abolhassan, F., Keller, J. & Paul, W. On the cost–effectiveness of PRAMs. Acta Informatica 36, 463–487 (1999). https://doi.org/10.1007/s002360050181
Issue Date:
DOI: https://doi.org/10.1007/s002360050181