AbstractWe propose a new storage scheme (word packing) for matrices with elements in Z2 that enables improved performance. This scheme is based on utilizing the full register length of modern microprocessors to perform multiple Z2 operations in parallel. We analyze several operations over word packed matrices and compare them with their conventional equivalents
During the last half-decade, a number of research efforts have centered around developing software f...
International audienceThis paper is aimed at designing efficient parallel matrix-product algorithms ...
Sparse storage formats describe a way how sparse matrices are stored in a computer memory. Extensive...
AbstractWe propose a new storage scheme (word packing) for matrices with elements in Z2 that enables...
The authors describe a new extension to ScaLAPACK for computing with symmetric (Hermitian) matrices ...
We describe a new extension to ScaLAPACK [2] for computing with symmetric (Hermitian) matrices store...
This thesis describes novel techniques and test implementations for optimizing numerically intensive...
The irregular nature of sparse matrix-vector multiplication, Ax = y, has led to the development of a...
The irregular nature of sparse matrix-vector multiplication, Ax = y, has led to the development of a...
In this letter, a functional Z2-FET DRAM memory matrix is experimentally demonstrated for the first ...
This report has been developed over the work done in the deliverable [Nava94] There it was shown tha...
Abstract: Suppose the bits of a computer word are partitioned into d disjoint sets, each of which is...
We develop a prototype library for in-place (dense) matrix storage for-mat conversion between the ca...
Sparse storage formats describe a way how sparse matrices are stored in a computer memory. Extensive...
International audienceIn this letter, a functional Z 2 -FET DRAM memory matrix is experimentally dem...
During the last half-decade, a number of research efforts have centered around developing software f...
International audienceThis paper is aimed at designing efficient parallel matrix-product algorithms ...
Sparse storage formats describe a way how sparse matrices are stored in a computer memory. Extensive...
AbstractWe propose a new storage scheme (word packing) for matrices with elements in Z2 that enables...
The authors describe a new extension to ScaLAPACK for computing with symmetric (Hermitian) matrices ...
We describe a new extension to ScaLAPACK [2] for computing with symmetric (Hermitian) matrices store...
This thesis describes novel techniques and test implementations for optimizing numerically intensive...
The irregular nature of sparse matrix-vector multiplication, Ax = y, has led to the development of a...
The irregular nature of sparse matrix-vector multiplication, Ax = y, has led to the development of a...
In this letter, a functional Z2-FET DRAM memory matrix is experimentally demonstrated for the first ...
This report has been developed over the work done in the deliverable [Nava94] There it was shown tha...
Abstract: Suppose the bits of a computer word are partitioned into d disjoint sets, each of which is...
We develop a prototype library for in-place (dense) matrix storage for-mat conversion between the ca...
Sparse storage formats describe a way how sparse matrices are stored in a computer memory. Extensive...
International audienceIn this letter, a functional Z 2 -FET DRAM memory matrix is experimentally dem...
During the last half-decade, a number of research efforts have centered around developing software f...
International audienceThis paper is aimed at designing efficient parallel matrix-product algorithms ...
Sparse storage formats describe a way how sparse matrices are stored in a computer memory. Extensive...
DOI
Add to ORKG