A fully parallel block independent set algorithm for distributed sparse matrices

Author： Shen C.   Zhang J.  

Publisher： Elsevier

ISSN： 0167-8191

Source： Parallel Computing, Vol.29, Iss.11, 2003-11, pp. : 1685-1699

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

Related content

A fully dynamic algorithm for distributed shortest paths

By Cicerone S.   Di Stefano G.   Frigioni D.   Nanni U.  

Theoretical Computer Science, Vol. 297, Iss. 1, 2003-03 ,pp. : 83-102

Elsevier

Access to resources Recommend Favorite

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

Improving Parallel Ordering of Sparse Matrices Using Genetic Algorithms

By Lin Wen-Yang  

Applied Intelligence, Vol. 23, Iss. 3, 2005-12 ,pp. : 257-265

Springer Publishing Company

Access to resources Recommend Favorite

Parallel iterative solvers for irregular sparse matrices in High Performance Fortran

By de Sturler E.   Loher D.  

Future Generation Computer Systems, Vol. 13, Iss. 4, 1998-03 ,pp. : 315-325

Elsevier

Access to resources Recommend Favorite

Sparse Matrix Block-Cyclic Realignment on Distributed Memory Machines

By Hsu Ching-Hsien  

The Journal of Supercomputing, Vol. 33, Iss. 3, 2005-09 ,pp. : 175-196

Springer Publishing Company

Access to resources Recommend Favorite