Can I read Expressing Graph Algorithms Using Generalized Active Messages on EtoBox?

Expressing Graph Algorithms Using Generalized Active Messages by Nick Edmonds; Jeremiah Willcock; Andrew Lumsdaine is a Computer Science article available to read on EtoBox.

What is Expressing Graph Algorithms Using Generalized Active Messages about?

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 executing, 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. Practical implementations and performance results are provided for a number of representative algorithms.

Who reads Expressing Graph Algorithms Using Generalized Active Messages?

Author

Nick Edmonds; Jeremiah Willcock; Andrew Lumsdaine

Publisher

ACM

Published

2013

Language

EN

Field

Computer Science (Physical Sciences)