A static mapping of sparse Cholesky factorization onto distributed memory architectures /

against other well known mapping techniques. Performance

Bibliographic Details
Main Author: Sustaita, Agapito
Format: Thesis eBook
Language:English
Published: [Place of publication not identified] : [publisher not identified] ; 1995.
Subjects:
Online Access:Link to OAKTrust copy

MARC

Tag First Indicator Second Indicator Subfields
LEADER 00000ctm a22000005a 4500
001 in00001307521
005 20220103134229.0
007 cr unu a
008 960726s1995 xx a b 000 0 eng d
035 |9 AHB5739AM 
035 |a (OCoLC)35146610 
040 |a TXA  |c TXA  |d UtOrBLW 
049 |a TXAM  |a TXAR 
099 |a 1995  |a Thesis  |a S877 
100 1 |a Sustaita, Agapito. 
245 1 2 |a A static mapping of sparse Cholesky factorization onto distributed memory architectures /  |c by Agapito Sustaita. 
264 1 |a [Place of publication not identified] :  |b [publisher not identified] ;  |c 1995. 
300 |a viii, 55 leaves :  |b illustrations ;  |c 28 cm. 
336 |a text  |b txt  |2 rdacontent 
337 |a computer  |b c  |2 rdamedia 
338 |a online resource  |b cr  |2 rdacarrier 
500 |a "Major subject: Computer Science". 
500 |a Vita. 
502 |b M.S.  |c Texas A&M University  |d 1995. 
504 |a Includes bibliographical references. 
520 |a against other well known mapping techniques. Performance  
520 |a architectures are presented within this report. This mapping  
520 |a dependencies in the sparse definite positive input matrix A.  
520 |a elimination tree which is derived from the column  
520 |a factorization problem onto two distributed memory  
520 |a mapping. 
520 |a results favor the proposed weighted critical path (WCP)  
520 |a simple methods which do not rely on the elimination tree, and  
520 |a technique is based on the ideas of both a critical path, and  
520 |a the fact that not all tasks have the same computational  
520 |a The mapping solution presented will be compared with both  
520 |a The results of a new static mapping of the sparse Cholesky  
520 |a workload. The proposed mapping technique makes use of the  
530 |a Also available online. 
530 |a Issued also on microfiche from Lange Micrographics. 
650 4 |a Major computer science. 
856 4 1 |u https://hdl.handle.net/1969.1/ETD-TAMU-1995-THESIS-S877  |z Link to OAKTrust copy  |t 0 
999 |a MARS 
999 f f |s 5193ba37-8e8a-3f01-bd40-6a2a2040febc  |i cf2cc660-8b9a-35be-996c-0e334308fb77  |t 0 
952 f f |p noncirc  |a Texas A&M University  |b College Station  |c Cushing Memorial Library & Archives  |s cush tdrm  |d Cushing: Theses & Dissertations Microforms (Does not check out)  |t 0  |e 1995 Thesis S877  |h Other scheme  |i computer -- online resource 
952 f f |a Texas A&M University  |b College Station  |c Electronic Resources  |s www_evans  |d Available Online  |t 0  |e 1995 Thesis S877  |h Other scheme 
998 f f |a 1995 Thesis S877  |t 0  |l Available Online 
998 f f |a 1995 Thesis S877  |t 0  |l Cushing: Theses & Dissertations Microforms (Does not check out)