Life would be so much easier if only we had the source code...
Home -> Publications
Home
  Publications
    
all years
    2017
    2016
    2015
    2014
    2013
    2012
    2011
    2010
    2009
    2008
    2007
    2006
    2005
    2004
    theses
    techreports
    presentations
    edited volumes
    conferences
  Awards
  Research
  Teaching
  BLOG
  Miscellaneous
  Full CV [pdf]






  Events








  Past Events





Publications of Torsten Hoefler
Copyright Notice:

The documents distributed by this server have been provided by the contributing authors as a means to ensure timely dissemination of scholarly and technical work on a noncommercial basis. Copyright and all rights therein are maintained by the authors or by other copyright holders, notwithstanding that they have offered their works here electronically. It is understood that all persons copying this information will adhere to the terms and constraints invoked by each author's copyright. These works may not be reposted without the explicit permission of the copyright holder.

J. Willcock, T. Hoefler, N. Edmonds and A. Lumsdaine:

 Active Pebbles: Parallel Programming for Data-Driven Applications

(In Proceedings of the 2011 ACM International Conference on Supercomputing (ICS'11), presented in Tucson, AZ, pages 235--245, ACM, ISBN: 978-1-4503-0102-2, Jun. 2011)

Abstract

The scope of scientific computing continues to grow and now includes diverse application areas such as network analysis, combinatorial computing, and knowledge discovery, to name just a few. Large problems in these application areas require HPC resources, but they exhibit computation and communication patterns that are irregular, fine-grained, and non-local, making it difficult to apply traditional HPC approaches to achieve scalable solutions. In this paper we present Active Pebbles, a programming and execution model developed explicitly to enable the development of scalable software for these emerging application areas. Our approach relies on five main techniques—scalable addressing, active routing, message coalescing, message reduction, and termination detection—to separate algorithm expression from communication optimization. Using this approach, algorithms can be expressed in their natural forms, with their natural levels of granularity, while optimizations necessary for scalability can be applied automatically to match the characteristics of particular machines. We implement several example kernels using both Active Pebbles and existing programming models, evaluating both programmability and performance. Our experimental results demonstrate that the Active Pebbles model can succinctly and directly express irregular application kernels, while still achieving performance comparable to MPI-based implementations that are significantly more complex.

ACM Stats



Documents

download article:
 

BibTeX

@inproceedings{active-pebbles,
  author={J. Willcock and T. Hoefler and N. Edmonds and A. Lumsdaine},
  title={{Active Pebbles: Parallel Programming for Data-Driven Applications}},
  year={2011},
  month={Jun.},
  pages={235--245},
  booktitle={Proceedings of the 2011 ACM International Conference on Supercomputing (ICS'11)},
  location={Tucson, AZ},
  publisher={ACM},
  isbn={978-1-4503-0102-2},
  source={http://www.unixer.de/~htor/publications/},
}

serving: 54.197.74.137:35210© Torsten Hoefler