Proceedings ArticleDOI
Low depth cache-oblivious algorithms
Guy E. Blelloch,Phillip B. Gibbons,Harsha Vardhan Simhadri +2 more
- pp 189-199
TLDR
This paper describes several cache-oblivious algorithms with optimal work, polylogarithmic depth, and sequential cache complexities that match the best sequential algorithms, including the first such algorithms for sorting and for sparse-matrix vector multiply on matrices with good vertex separators.Abstract:
In this paper we explore a simple and general approach for developing parallel algorithms that lead to good cache complexity on parallel machines with private or shared caches. The approach is to design nested-parallel algorithms that have low depth (span, critical path length) and for which the natural sequential evaluation order has low cache complexity in the cache-oblivious model. We describe several cache-oblivious algorithms with optimal work, polylogarithmic depth, and sequential cache complexities that match the best sequential algorithms, including the first such algorithms for sorting and for sparse-matrix vector multiply on matrices with good vertex separators.Using known mappings, our results lead to low cache complexities on shared-memory multiprocessors with a single level of private caches or a single shared cache. We generalize these mappings to multi-level cache hierarchies of private or shared caches, implying that our algorithms also have low cache complexities on such hierarchies. The key factor in obtaining these low parallel cache complexities is the low depth of the algorithms we propose.read more
Citations
More filters
Dissertation
Automated Runtime Analysis and Adaptation for Scalable Heterogeneous Computing
TL;DR: High-level analytical models are generated which combine the abstract hardware model, application characteristics, and architectural specifications to predict the potential parallel performance on different types of hardware devices, thereby driving a workload distribution scheme which enables end users to efficiently exploit the available heterogeneous devices in an HPC system.
Proceedings ArticleDOI
Data Oblivious Algorithms for Multicores
Vijaya Ramachandran,Elaine Shi +1 more
TL;DR: A data-oblivious algorithm is an algorithm whose memory access pattern is independent of the input values as discussed by the authors, which is a generalization of the data oblivious algorithm for the binary fork-join model of computation.
Posted Content
Parallel Approximation Algorithms for Facility-Location Problems
TL;DR: This paper presents the design and analysis of parallel approximation algorithms for facility-location problems, including NC and RNC algorithms for (metric) facility location, k-center, k -median, and k-means, and focuses on giving algorithms with low depth, near work efficiency, and low cache complexity.
Book ChapterDOI
Toward a Theory of Algorithm-Architecture Co-design
Richard Vuduc,Kenneth Czechowski +1 more
TL;DR: The approach shall outline marries abstract algorithmic complexity analysis with caps on power and die area, which are arguably the central first-order constraints on the extremescale systems of 2018 and beyond.
Dissertation
Models for Parallel Computation in Multi-Core, Heterogeneous, and Ultra Wide-Word Architectures
TL;DR: Low-degree-parallelism in computation is explored, providing evidence of fundamental differences in practice and theory between systems with a sublinear and linear number of processors, and suggesting a sharp theoretical gap between the classes of problems that are efficiently parallelizable in each case.
References
More filters
Journal ArticleDOI
A bridging model for parallel computation
TL;DR: The bulk-synchronous parallel (BSP) model is introduced as a candidate for this role, and results quantifying its efficiency both in implementing high-level language features and algorithms, as well as in being implemented in hardware.
Journal ArticleDOI
Amortized efficiency of list update and paging rules
TL;DR: This article shows that move-to-front is within a constant factor of optimum among a wide class of list maintenance rules, and analyzes the amortized complexity of LRU, showing that its efficiency differs from that of the off-line paging rule by a factor that depends on the size of fast memory.
Journal ArticleDOI
Cilk: An Efficient Multithreaded Runtime System
Robert D. Blumofe,Christopher F. Joerg,Bradley C. Kuszmaul,Charles E. Leiserson,Keith H. Randall,Yuli Zhou +5 more
TL;DR: It is shown that on real and synthetic applications, the “work” and “critical-path length” of a Cilk computation can be used to model performance accurately, and it is proved that for the class of “fully strict” (well-structured) programs, the Cilk scheduler achieves space, time, and communication bounds all within a constant factor of optimal.
Book
An introduction to parallel algorithms
TL;DR: This book provides an introduction to the design and analysis of parallel algorithms, with the emphasis on the application of the PRAM model of parallel computation, with all its variants, to algorithm analysis.
Proceedings ArticleDOI
LogP: towards a realistic model of parallel computation
David E. Culler,Richard M. Karp,David A. Patterson,Abhijit Sahay,Klaus Erik Schauser,Eunice E. Santos,Ramesh Subramonian,Thorsten von Eicken +7 more
TL;DR: A new parallel machine model, called LogP, is offered that reflects the critical technology trends underlying parallel computers and is intended to serve as a basis for developing fast, portable parallel algorithms and to offer guidelines to machine designers.