Sciweavers

2239 search results - page 2 / 448
» Computing with abstract matrix structures
Sort
View
EUROPAR
1998
Springer
13 years 9 months ago
Parallel Sparse Matrix Computations Using the PINEAPL Library: A Performance Study
Abstract. The Numerical Algorithms Group Ltd is currently participating in the European HPCN Fourth Framework project on Parallel Industrial NumErical Applications and Portable Lib...
Arnold R. Krommer
FCCM
1997
IEEE
199views VLSI» more  FCCM 1997»
13 years 9 months ago
The RAW benchmark suite: computation structures for general purpose computing
The RAW benchmark suite consists of twelve programs designed to facilitate comparing, validating, and improving reconfigurable computing systems. These benchmarks run the gamut o...
Jonathan Babb, Matthew Frank, Victor Lee, Elliot W...
ECOOPW
1998
Springer
13 years 9 months ago
The Matrix Template Library: A Unifying Framework for Numerical Linear Algebra
Abstract. We present a uni ed approach for expressing high performance numerical linear algebra routines for a class of dense and sparse matrix formats and shapes. As with the Stan...
Jeremy G. Siek, Andrew Lumsdaine
EUROPAR
2000
Springer
13 years 8 months ago
Ahnentafel Indexing into Morton-Ordered Arrays, or Matrix Locality for Free
Abstract. Definitions for the uniform representation of d-dimensional matrices serially in Morton-order (or Z-order) support both their use with cartesian indices, and their divide...
David S. Wise
IWPC
1999
IEEE
13 years 9 months ago
The SPARAMAT Approach to Automatic Comprehension of Sparse Matrix Computations
Automatic program comprehension is particularly useful when applied to sparse matrix codes, since it allows to abstract e.g. from specific sparse matrix storage formats used in th...
Christoph W. Keßler, Craig Smith