Techniques for parallel manipulation of sparse matrices
- 20 May 1989
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 64 (2) , 135-157
- https://doi.org/10.1016/0304-3975(89)90058-3
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Contention is no obstacle to shared-memory multiprocessingCommunications of the ACM, 1986
- Parallel Supercomputing Today and the Cedar ApproachScience, 1986
- The power of parallel prefixIEEE Transactions on Computers, 1985
- The NYU Ultracomputer—Designing an MIMD Shared Memory Parallel ComputerIEEE Transactions on Computers, 1983
- A New Implementation of Sparse Gaussian EliminationACM Transactions on Mathematical Software, 1982
- Parallel Prefix ComputationJournal of the ACM, 1980
- Two Fast Algorithms for Sparse Matrices: Multiplication and Permuted TranspositionACM Transactions on Mathematical Software, 1978
- Fast Parallel Matrix Inversion AlgorithmsSIAM Journal on Computing, 1976
- An almost optimal algorithm for unbounded searchingInformation Processing Letters, 1976
- The Elimination form of the Inverse and its Application to Linear ProgrammingManagement Science, 1957