Active pebbles: a programming model for highly parallel fine-grained data-driven computations

Authors:
Jeremiah James Willcock;Torsten Hoefler;Nicholas Gerard Edmonds;Andrew Lumsdaine
Affiliations:
Indiana University, Bloomington, IN, USA;University of Illinois at Urbana-Champaign, Urbana, IL, USA;Indiana University, Bloomington, IN, USA;Indiana University, Bloomington, IN, USA
Venue:
Proceedings of the 16th ACM symposium on Principles and practice of parallel programming
Year:
2011

Citing 3
Cited 2

Co-array Fortran for parallel programming

ACM SIGPLAN Fortran Forum
Δ-stepping: a parallelizable shortest path algorithm

Journal of Algorithms
X10: an object-oriented approach to non-uniform cluster computing

OOPSLA '05 Proceedings of the 20th annual ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications

Active pebbles: parallel programming for data-driven applications

Proceedings of the international conference on Supercomputing
Simplifying Scalable Graph Processing with a Domain-Specific Language

Proceedings of Annual IEEE/ACM International Symposium on Code Generation and Optimization

Quantified Score

Hi-index	0.00

Visualization

Abstract

A variety of programming models exist to support large-scale, distributed memory, parallel computation. These programming models have historically targeted coarse-grained applications with natural locality such as those found in a variety of scientific simulations of the physical world. Fine-grained, irregular, and unstructured applications such as those found in biology, social network analysis, and graph theory are less well supported. We propose Active Pebbles, a programming model which allows these applications to be expressed naturally; an accompanying execution model ensures performance and scalability.