Architectural mechanisms to support sparse vector processing

Authors:
R. N. Ibbett;T. M. Hopkins;K. I. M. McKinnon
Affiliations:
Departments of Computer Science and Mathematics, University of Edinburgh, James Clerk Maxwell Building, King's Buildings, Mayfield Road, Edinburgh;Departments of Computer Science and Mathematics, University of Edinburgh, James Clerk Maxwell Building, King's Buildings, Mayfield Road, Edinburgh;Departments of Computer Science and Mathematics, University of Edinburgh, James Clerk Maxwell Building, King's Buildings, Mayfield Road, Edinburgh
Venue:
ISCA '89 Proceedings of the 16th annual international symposium on Computer architecture
Year:
1989

Citing 5
Cited 1

Large sparse numerical optimization

Large sparse numerical optimization
Architecture of high performance computers: vol. 1

Architecture of high performance computers: vol. 1
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms

The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
(SM)2-II: a new version of the sparse matrix solving machine

ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
(SM)2-Sparse Matrix Solving Machine

ISCA '83 Proceedings of the 10th annual international symposium on Computer architecture

Characterizing the behavior of sparse algorithms on caches

Proceedings of the 1992 ACM/IEEE conference on Supercomputing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We discuss the algorithmic steps involved in common sparse matrix problems, with particular emphasis on linear programming by the revised simplex method. We then propose new architectural mechanisms which are being built into an experimental machine, the Edinburgh Sparse Processor, and which enable vector instructions to operate efficiently on sparse vectors stored in compressed form. Finally, we review the use of these new mechanisms on the linear programming problem.