{"id":{"repo_id":"vt","oai_identifier":"oai:vtechworks.lib.vt.edu:10919/44007"},"canonical_url":"https://search.ndltd.org/etd/vt/oai:vtechworks.lib.vt.edu:10919/44007","repository":{"repo_id":"vt","name":"Virginia Tech","base_url":"https://vtechworks.lib.vt.edu/oai/request"},"display":{"title":"Preconditioned iterative methods on virtual shared memory machines","abstract":"The Kendall Square Research Machine 1 (KSR1) is a virtual shared memory (VSM) machine. Memory on the KSR1 consists primarily of shared, physically distributed caches. Effective memory utilization of the KSR1 is studied within this thesis. Special emphasis is laid upon how best to optimize iterative Krylov subspace methods using domain decomposition preconditioning. The domain decomposition preconditioner used was developed by J. H. Bramble, J. E. Pasciak, and A. H. Schatz. The Krylov subspace method used was the conjugate gradient algorithm. The linear systems being solved are derived from finite difference discretization of elliptic boundary value problems. Most of the focus of this thesis is upon how data structures affect performance of the algorithm on the KSR1. Implications for other iterative methods and preconditioners are also drawn.","abstract_html":"The Kendall Square Research Machine 1 (KSR1) is a virtual shared memory (VSM) machine. Memory on the KSR1 consists primarily of shared, physically distributed caches. Effective memory utilization of the KSR1 is studied within this thesis. Special emphasis is laid upon how best to optimize iterative Krylov subspace methods using domain decomposition preconditioning. The domain decomposition preconditioner used was developed by J. H. Bramble, J. E. Pasciak, and A. H. Schatz. The Krylov subspace method used was the conjugate gradient algorithm. The linear systems being solved are derived from finite difference discretization of elliptic boundary value problems. Most of the focus of this thesis is upon how data structures affect performance of the algorithm on the KSR1. Implications for other iterative methods and preconditioners are also drawn.","abstract_has_math":false,"creators":["Roberts, Harriet"],"institution":"Virginia Tech","degree_name":"Master of Science","degree_level":"masters","degree_discipline":"Computer Science","degree_department":"Computer Science","school":null,"contributors":[],"advisors":[],"committee_chairs":[],"committee_members":[],"year":1994,"date_issued":"1994","date_published":"1994","updated_at":"2026-11-18T20:05:25Z","subjects":["Iterative methods (Mathematics)","Virtual storage (Computer science)"],"languages":["en"],"rights":["In Copyright"],"rights_urls":["http://rightsstatements.org/vocab/InC/1.0/"],"identifier_entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-07292009-090522"],"render_values":[{"text":"etd-07292009-090522","href":null,"code":true}]},{"key":"dc:identifier.sourceurl","label":"Source URL","values":["http://scholar.lib.vt.edu/theses/available/etd-07292009-090522/"],"render_values":[{"text":"http://scholar.lib.vt.edu/theses/available/etd-07292009-090522/","href":"http://scholar.lib.vt.edu/theses/available/etd-07292009-090522/","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/10919/44007","outbound_label":"Handle","outbound_source":"dc:identifier.uri","record_url":"http://hdl.handle.net/10919/44007","record_label":"Repository record","record_kind":"handle","record_source":"dc:identifier.uri","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://vtechworks.lib.vt.edu/oai/request?verb=GetRecord&metadataPrefix=dim&identifier=oai%3Avtechworks.lib.vt.edu%3A10919%2F44007","prefix":"dim"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.department","label":"Department","values":["Computer Science"]},{"key":"dc:creator","label":"Author","values":["Roberts, Harriet"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.accepted","label":"Dc Date Accepted","values":["2009-07-29"]},{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2014-03-14T21:41:38Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2014-03-14T21:41:38Z","2009-07-29"]},{"key":"dc:date.issued","label":"Date","values":["1994"]},{"key":"dc:date.submitted","label":"Dc Date Submitted","values":["2009-07-29"]},{"key":"dc:publisher","label":"Institution","values":["Virginia Tech"]},{"key":"dc:relation.haspart","label":"Dc Relation Haspart","values":["LD5655.V855_1994.R6339.pdf"]},{"key":"dc:relation.isformatof","label":"Dc Relation Isformatof","values":["OCLC# 32290539"]},{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"dc:type.dcmitype","label":"Dc Type Dcmitype","values":["Text"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["masters"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science"]},{"key":"thesis:institution_name","label":"Thesis Institution Name","values":["Virginia Polytechnic Institute and State University"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject.lcc","label":"Dc Subject Lcc","values":["LD5655.V855 1994.R6339"]},{"key":"dc:subject.lcsh","label":"Dc Subject Lcsh","values":["Iterative methods (Mathematics)","Virtual storage (Computer science)"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["en"]},{"key":"dc:rights","label":"Dc Rights","values":["In Copyright"]},{"key":"dc:rights.uri","label":"Rights URI","values":["http://rightsstatements.org/vocab/InC/1.0/"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.other","label":"Dc Identifier Other","values":["etd-07292009-090522"]},{"key":"dc:identifier.sourceurl","label":"Source URL","values":["http://scholar.lib.vt.edu/theses/available/etd-07292009-090522/"]},{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/10919/44007"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["The Kendall Square Research Machine 1 (KSR1) is a virtual shared memory (VSM) machine. Memory on the KSR1 consists primarily of shared, physically distributed caches. Effective memory utilization of the KSR1 is studied within this thesis. Special emphasis is laid upon how best to optimize iterative Krylov subspace methods using domain decomposition preconditioning. The domain decomposition preconditioner used was developed by J. H. Bramble, J. E. Pasciak, and A. H. Schatz. The Krylov subspace method used was the conjugate gradient algorithm. The linear systems being solved are derived from finite difference discretization of elliptic boundary value problems. Most of the focus of this thesis is upon how data structures affect performance of the algorithm on the KSR1. Implications for other iterative methods and preconditioners are also drawn."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["Master of Science"]},{"key":"dc:format.extent","label":"Dc Format Extent","values":["viii, 86 leaves"]},{"key":"dc:format.medium","label":"Dc Format Medium","values":["BTD"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Preconditioned iterative methods on virtual shared memory machines"]}]}],"canonical_facts":{"dc:contributor.department":["Computer Science"],"dc:creator":["Roberts, Harriet"],"dc:date.accepted":["2009-07-29"],"dc:date.accessioned":["2014-03-14T21:41:38Z"],"dc:date.available":["2014-03-14T21:41:38Z","2009-07-29"],"dc:date.issued":["1994"],"dc:date.submitted":["2009-07-29"],"dc:description.abstract":["The Kendall Square Research Machine 1 (KSR1) is a virtual shared memory (VSM) machine. Memory on the KSR1 consists primarily of shared, physically distributed caches. Effective memory utilization of the KSR1 is studied within this thesis. Special emphasis is laid upon how best to optimize iterative Krylov subspace methods using domain decomposition preconditioning. The domain decomposition preconditioner used was developed by J. H. Bramble, J. E. Pasciak, and A. H. Schatz. The Krylov subspace method used was the conjugate gradient algorithm. The linear systems being solved are derived from finite difference discretization of elliptic boundary value problems. Most of the focus of this thesis is upon how data structures affect performance of the algorithm on the KSR1. Implications for other iterative methods and preconditioners are also drawn."],"dc:description.degree":["Master of Science"],"dc:format.extent":["viii, 86 leaves"],"dc:format.medium":["BTD"],"dc:format.mimetype":["application/pdf"],"dc:identifier.other":["etd-07292009-090522"],"dc:identifier.sourceurl":["http://scholar.lib.vt.edu/theses/available/etd-07292009-090522/"],"dc:identifier.uri":["http://hdl.handle.net/10919/44007"],"dc:language.iso":["en"],"dc:publisher":["Virginia Tech"],"dc:relation.haspart":["LD5655.V855_1994.R6339.pdf"],"dc:relation.isformatof":["OCLC# 32290539"],"dc:rights":["In Copyright"],"dc:rights.uri":["http://rightsstatements.org/vocab/InC/1.0/"],"dc:subject.lcc":["LD5655.V855 1994.R6339"],"dc:subject.lcsh":["Iterative methods (Mathematics)","Virtual storage (Computer science)"],"dc:title":["Preconditioned iterative methods on virtual shared memory machines"],"dc:type":["Thesis"],"dc:type.dcmitype":["Text"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["masters"],"thesis:degree_name":["Master of Science"],"thesis:institution_name":["Virginia Polytechnic Institute and State University"]},"updated_at":"2026-11-18T20:05:25Z"}