Sciweavers

ISCOPE
1999
Springer

Generic Graph Algorithms for Sparse Matrix Ordering

13 years 8 months ago
Generic Graph Algorithms for Sparse Matrix Ordering
Fill-reducing sparse matrix orderings have been a topic of active research for many years. Although most such algorithms are developed and analyzed within a graph-theoretical framework, for reasons of performance the corresponding implementations are typically realized with programming languages devoid of language features necessary to ly represent graph abstractions. Recently, generic programming has emerged as a programming paradigm capable of providing high leverformance in the presence of programming abstractions. In this paper we present an implementation of the Minimum Degree ordering algorithm using the newly-developed Generic Graph Component Library. Experimental comparisons show that, despite our heavy use of abstractions, our implementation has performance indistinguishable from that of a widely used Fortran implementation.
Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
Added 04 Aug 2010
Updated 04 Aug 2010
Type Conference
Year 1999
Where ISCOPE
Authors Lie-Quan Lee, Jeremy G. Siek, Andrew Lumsdaine
Comments (0)