News & Events

  • Andrew Lumsdaine, Nick Edmonds, and Jeremiah Willcock had a paper accepted to ICS 2013

    Date: 03/28/2013

    ICS is the premier international forum for the presentation of research results in high-performance computing systems. ICS 2013 will be held at the University of Oregon, Eugene, Oregon, in the heart of the Willamette Valley.

    "Recently, graph computation has emerged as an important class of high-performance computing application whose characteristics differ markedly from those of traditional, compute-bound kernels. Libraries such as BLAS, LAPACK, and others have been successful in codifying best practices in numerical computing. The data-driven nature of graph applications necessitates a more complex application stack incorporating runtime optimization. In this paper, we present a method of phrasing graph algorithms as collections of asynchronous, concurrently execut- ing, concise code fragments which may be invoked both locally and in remote address spaces. A runtime layer performs a number of dynamic optimizations, including message coalescing, message combining, and software routing. We identify a number of common patterns in these algorithms, and explore how this programming model can express those patterns. Algorithmic transformations are discussed which expose asynchrony that can be leveraged by the runtime to improve performance and reduce resource utilization. Practical implementations and performance results are provided for a number of representative algorithms."