C. Ashcraft, S. C. Eisenstat, J. W. H. Liu, B. W. Peyton, and A. H. Sherman, A compute-ahead fan-in scheme for parallel sparse matrix factorization, in Fourth Canadian Supercomputing Symposium (1990), D. Pelletier, ed., June, 1990, pp. 351--361. Home/Search Document Not in Database Summary Related Articles |
This paper is cited in the following contexts:
SPOOLES: An Object-Oriented Sparse Matrix Library - Ashcraft, Grimes (1999) (29 citations) Self-citation (Ashcraft) (Correct)
....Each thread or processor maintains a queue of fronts that are ready to have action taken on them. A front is removed from the queue when all work for it on that thread or processor is complete, and a front is added to the queue when all work on its children is complete. A lookahead parameter [4] allows a thread or processor to look further up the tree in order to reduce the idle time. 4.2 Pivoting for stability To ensure stability of the factorization, we bound the magnitudes of entries in both L and U by a user supplied tolerance. For the symmetric case, the algorithm is described and ....
C. Ashcraft, S. C. Eisenstat, J. W. H. Liu, B. W. Peyton, and A. H. Sherman, A compute-ahead fan-in scheme for parallel sparse matrix factorization, in Fourth Canadian Supercomputing Symposium (1990), D. Pelletier, ed., June, 1990, pp. 351--361.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC