A static mapping of sparse Cholesky factorization onto distributed memory architectures /
against other well known mapping techniques. Performance
| Main Author: | |
|---|---|
| Format: | Thesis eBook |
| Language: | English |
| Published: |
[Place of publication not identified] :
[publisher not identified] ;
1995.
|
| Subjects: | |
| Online Access: | Link to OAKTrust copy |
| Summary: | against other well known mapping techniques. Performance architectures are presented within this report. This mapping dependencies in the sparse definite positive input matrix A. elimination tree which is derived from the column factorization problem onto two distributed memory mapping. results favor the proposed weighted critical path (WCP) simple methods which do not rely on the elimination tree, and technique is based on the ideas of both a critical path, and the fact that not all tasks have the same computational The mapping solution presented will be compared with both The results of a new static mapping of the sparse Cholesky workload. The proposed mapping technique makes use of the |
|---|---|
| Item Description: | "Major subject: Computer Science". Vita. |
| Physical Description: | viii, 55 leaves : illustrations ; 28 cm. Also available online. Issued also on microfiche from Lange Micrographics. |
| Bibliography: | Includes bibliographical references. |