Cache-oblivious simulation of parallel programs

Authors:
Andrea Pietracaprina;Geppino Pucci;Francesco Silvestri
Affiliations:
Department of Information Engineering, University of Padova, Italy;Department of Information Engineering, University of Padova, Italy;Department of Information Engineering, University of Padova, Italy
Venue:
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Year:
2006

Citing 14
Cited 0

A model for hierarchical memory

STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
The input/output complexity of sorting and related problems

Communications of the ACM
A bridging model for parallel computation

Communications of the ACM
Efficient external memory algorithms by simulating coarse-grained parallel algorithms

Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Towards a theory of cache-efficient algorithms

Journal of the ACM (JACM)
On the Effectiveness of D-BSP as a Bridging Model of Parallel Computation

ICCS '01 Proceedings of the International Conference on Computational Science-Part II
Reducing I/O Complexity by Simulating Coarse Grained Parallel Algorithms

IPPS '99/SPDP '99 Proceedings of the 13th International Symposium on Parallel Processing and the 10th Symposium on Parallel and Distributed Processing
Submachine Locality in the Bulk Synchronous Setting (Extended Abstract)

Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing-Volume II
BSP-Like External-Memory Computation

CIAC '97 Proceedings of the Third Italian Conference on Algorithms and Complexity
A Quantitative Measure of Portability with Application to Bandwidth-Latency Models for Parallel Computing

Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
Cache-Oblivious Algorithms

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
A structural theory of recursively decomposable parallel processor-networks

SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Translating submachine locality into locality of reference

Journal of Parallel and Distributed Computing - Special issue: 18th International parallel and distributed processing symposium
Hierarchical memory with block transfer

SFCS '87 Proceedings of the 28th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.01

Visualization

Abstract

This paper explores the relation between the structured parallelism exposed by the Decomposable BSP (DBSP) model through submachine locality and locality of reference in multi-level cache hierarchies. Specifically, an efficient cache-oblivious algorithm is developed to simulate D-BSP programs on the Ideal Cache Model (ICM). The effectiveness of the simulation is proved by showing that optimal cache-oblivious algorithms for prominent problems can be obtained from D-BSP algorithms. Finally, a tight relation between optimality in the D-BSP and ICM models is established.