NOTE: This item is not available outside the Texas A&M University network. Texas A&M affiliated users who are off campus can access the item through NetID and password authentication or by using TAMU VPN. Non-affiliated individuals should request a copy through their local library's interlibrary loan service.
A static mapping of sparse Cholesky factorization onto distributed memory architectures
| dc.creator | Sustaita, Agapito | |
| dc.date.accessioned | 2012-06-07T22:42:58Z | |
| dc.date.available | 2012-06-07T22:42:58Z | |
| dc.date.created | 1995 | |
| dc.date.issued | 1995 | |
| dc.identifier.uri | https://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-S877 | |
| dc.description | Due to the character of the original source materials and the nature of batch digitization, quality control issues may be present in this document. Please report any quality issues you encounter to digital@library.tamu.edu, referencing the URI of the item. | en |
| dc.description | Includes bibliographical references. | en |
| dc.description | Issued also on microfiche from Lange Micrographics. | en |
| dc.description.abstract | The results of a new static mapping of the sparse Cholesky factorization problem onto two distributed memory architectures are presented within this report. This mapping technique is based on the ideas of both a critical path, and the fact that not all tasks have the same computational workload. The proposed mapping technique makes use of the elimination tree which is derived from the column dependencies in the sparse definite positive input matrix A. The mapping solution presented will be compared with both simple methods which do not rely on the elimination tree, and against other well known mapping techniques. Performance results favor the proposed weighted critical path (WCP) mapping. | en |
| dc.format.medium | electronic | en |
| dc.format.mimetype | application/pdf | |
| dc.language.iso | en_US | |
| dc.publisher | Texas A&M University | |
| dc.rights | This thesis was part of a retrospective digitization project authorized by the Texas A&M University Libraries in 2008. Copyright remains vested with the author(s). It is the user's responsibility to secure permission from the copyright holder(s) for re-use of the work beyond the provision of Fair Use. | en |
| dc.subject | computer science. | en |
| dc.subject | Major computer science. | en |
| dc.title | A static mapping of sparse Cholesky factorization onto distributed memory architectures | en |
| dc.type | Thesis | en |
| thesis.degree.discipline | computer science | en |
| thesis.degree.name | M.S. | en |
| thesis.degree.level | Masters | en |
| dc.type.genre | thesis | en |
| dc.type.material | text | en |
| dc.format.digitalOrigin | reformatted digital | en |
Files in this item
This item appears in the following Collection(s)
-
Digitized Theses and Dissertations (1922–2004)
Texas A&M University Theses and Dissertations (1922–2004)
Request Open Access
This item and its contents are restricted. If this is your thesis or dissertation, you can make it open-access. This will allow all visitors to view the contents of the thesis.