Sciweavers

Share
IPPS
2006
IEEE

Cache-oblivious simulation of parallel programs

12 years 7 months ago
Cache-oblivious simulation of parallel programs
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.
Andrea Pietracaprina, Geppino Pucci, Francesco Sil
Added 12 Jun 2010
Updated 12 Jun 2010
Type Conference
Year 2006
Where IPPS
Authors Andrea Pietracaprina, Geppino Pucci, Francesco Silvestri
Comments (0)
books