Effecting Parallel Graph Eigensolvers Through Library Composition
| Title | Effecting Parallel Graph Eigensolvers Through Library Composition |
| Publication Type | Conference Paper |
| Year of Publication | 2006 |
| Refereed Designation | Unknown |
| Refereed Designation | Unknown |
| Authors | Breuer, A., P. Gottschling, D. Gregor, and A. Lumsdaine |
| Refereed Designation | Unknown |
| Refereed Designation | Unknown |
| Conference Name | Performance Optimization for High-Level Languages and Libraries (POHLL) |
| Date Published | 04/2006 |
| Publication Language | eng |
| Keywords | OSL |
| Abstract | Many interesting problems in graph theory can be reduced to solving an eigenproblem of the adjacency matrix or Laplacian of a graph. Given the availability of high-quality linear algebra and graph libraries, one might expect that one could merely use a graph data structure within a eigensolver. However, conventional libraries are rigidly constructed, requiring conversion to library-specific data structures or using heavyweight abstraction methods that prevent efficient composition. The Generic Programming methodology addresses the problems of reusability and composability by careful factorization of a domain into efficient library abstractions. We describe the composition process that makes the data structures from a library supporting one domain usable with the algorithms of another library for a disjoint domain without conversion or heavyweight abstractions. To illustrate the process, we compose two separately-developed libraries, one for solving eigenproblems sequentially and the other for solving graph problems in parallel, effecting an efficient, scalable parallel graph eigensolver. |
| URL | http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=1639723 |
|
Copyright © 2012 The Trustees of Indiana University | Copyright Complaints