A GENERAL PRAM SIMULATION SCHEME FOR CLUSTERED MACHINES

CARLO FANTOZZI, ANDREA PIETRACAPRINA, GEPPINO PUCCI
2003 International Journal of Foundations of Computer Science  
We present a general deterministic scheme to implement a shared memory abstraction on any distributed-memory machine which exhibits a clustered structure. More specifically, we develop a memory distribution strategy and an access protocol for the Decomposable BSP (D-BSP), a generic machine model whose bandwidth/latency parameters can be instantiated to closely reflect the characteristics of machines that admit a hierarchical decomposition into independent clusters. Our scheme achieves provably
more » ... achieves provably optimal slowdown for those machines where delays due to latency dominate over those due to bandwidth limitations. For machines where this is not the case, the slowdown is a mere logarithmic factor away from the natural bandwidth-based lower bound.
doi:10.1142/s0129054103002230 fatcat:2wfun3mwqnfuhlkftnrnx4clau