Approaches Based on Permutations for Partitioning Sparse Matrices on Multiprocessors

ISSN： 0920-8542

Source： The Journal of Supercomputing, Vol.34, Iss.1, 2005-10, pp. : 41-61

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Conjugate Gradient and Lanczos Methods for Sparse Matrices on Distributed Memory Multiprocessors

By Basermann A.

Journal of Parallel and Distributed Computing, Vol. 45, Iss. 1, 1997-08 ,pp. : 46-52

Academic Press

Access to resources Recommend Favorite

Two techniques for improving performance on bus-based multiprocessors

By Anderson C. Baer J.-L.

Future Generation Computer Systems, Vol. 11, Iss. 6, 1995-10 ,pp. : 537-551

Elsevier

Access to resources Recommend Favorite

Cache-Based Synchronization in Shared Memory Multiprocessors

By Ramachandran U. Lee J.

Journal of Parallel and Distributed Computing, Vol. 32, Iss. 1, 1996-01 ,pp. : 11-27

Academic Press

Access to resources Recommend Favorite

Hybrid Sparse Resultant Matrices for Bivariate Polynomials

By D’Andrea C. Emiris I.Z.

Journal of Symbolic Computation, Vol. 33, Iss. 5, 2002-05 ,pp. : 587-608

Academic Press

Access to resources Recommend Favorite

The Consecutive Ones Submatrix Problem for Sparse Matrices

By Tan Jinsong Zhang Louxin

Algorithmica, Vol. 48, Iss. 3, 2007-07 ,pp. : 287-299

Springer Publishing Company

Access to resources Recommend Favorite