A Bridging Model for Multi-core Computing

Authors:
Leslie G. Valiant
Affiliations:
School of Engineering and Applied Sciences, Harvard University,
Venue:
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Year:
2008

Citing 25
Cited 15

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
Parallel algorithms for shared-memory machines

Handbook of theoretical computer science (vol. A)
Parallel sorting by regular sampling

Journal of Parallel and Distributed Computing
Deterministic distribution sort in shared and distributed memory multiprocessors

SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Direct bulk-synchronous parallel algorithms

Journal of Parallel and Distributed Computing
Towards efficiency and portability: programming with the BSP model

Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
The bulk-synchronous parallel random access machine

Theoretical Computer Science - Special issue on parallel computing
BOS is boss: a case for bulk-synchronous object systems

Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
External memory algorithms and data structures: dealing with massive data

ACM Computing Surveys (CSUR)
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
The Parallel Hierarchical Memory Model

SWAT '94 Proceedings of the 4th Scandinavian Workshop on Algorithm Theory
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
Extending the Hong-Kung Model to Memory Hierarchies

COCOON '95 Proceedings of the First Annual International Conference on Computing and Combinatorics
Cache-Oblivious Algorithms

FOCS '99 Proceedings of the 40th Annual Symposium on Foundations of Computer Science
I/O complexity: The red-blue pebble game

STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Parallelism in random access machines

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Communication lower bounds for distributed-memory matrix multiplication

Journal of Parallel and Distributed Computing
Heterogeneous Chip Multiprocessors

Computer
Provably good multicore cache performance for divide-and-conquer algorithms

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Fundamental parallel algorithms for private-cache chip multiprocessors

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Cache-efficient dynamic programming algorithms for multicores

Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures
Amdahl's Law in the Multicore Era

Computer

Methodology for Efficient Execution of SPMD Applications on Multicore Environments

CCGRID '10 Proceedings of the 2010 10th IEEE/ACM International Conference on Cluster, Cloud and Grid Computing
Hybrid bulk synchronous parallelism library for clustered smp architectures

Proceedings of the fourth international workshop on High-level parallel programming and applications
Using simple abstraction to reinvent computing for parallelism

Communications of the ACM
Building efficient multi-threaded search nodes

CIKM '10 Proceedings of the 19th ACM international conference on Information and knowledge management
Resource oblivious sorting on multicores

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming
Algorithm engineering: bridging the gap between algorithm theory and practice

Algorithm engineering: bridging the gap between algorithm theory and practice
Scheduling irregular parallel computations on hierarchical caches

Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Balance principles for algorithm-architecture co-design

HotPar'11 Proceedings of the 3rd USENIX conference on Hot topic in parallelism
A multi-core numerical framework for characterizing flow in oil reservoirs

Proceedings of the 19th High Performance Computing Symposia
An object-oriented bulk synchronous parallel library for multicore programming

Concurrency and Computation: Practice & Experience
Brief announcement: efficient cache oblivious algorithms for randomized divide-and-conquer on the multicore model

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
A parallel buffer tree

Proceedings of the twenty-fourth annual ACM symposium on Parallelism in algorithms and architectures
Program-centric cost models for locality

Proceedings of the ACM SIGPLAN Workshop on Memory Systems Performance and Correctness
Model-based cache-aware dispatching of object-oriented software for multicore systems

Journal of Systems and Software
Combined scheduling and mapping for scalable computing with parallel tasks

Scientific Programming - Biological Knowledge Discovery and Data Mining

Quantified Score

Hi-index	0.02

Visualization

Abstract

We propose a bridging model aimed at capturing the most basic resource parameters of multi-core architectures. We suggest that the considerable intellectual effort needed for designing efficient algorithms for such architectures may be most fruitfully pursued as an effort in designing portable algorithms for such a bridging model. Portable algorithms would contain efficient designs for all reasonable ranges of the basic resource parameters and input sizes, and would form the basis for implementation or compilation for particular machines.