Application of dependence analysis and runtime data flow graph scheduling to matrix computations

dc.contributor.advisorVan de Geijn, Robert A.en
dc.contributor.committeeMemberBrowne, James C.en
dc.contributor.committeeMemberLin, Calvinen
dc.contributor.committeeMemberPingali, Keshaven
dc.contributor.committeeMemberPlaxton, Charles G.en
dc.contributor.committeeMemberQuintana-Orti, Enrique S.en
dc.creatorChan, Ernie W., 1982-en
dc.date.accessioned2010-11-23T21:39:30Zen
dc.date.accessioned2010-11-23T21:39:36Zen
dc.date.accessioned2017-05-11T22:20:44Z
dc.date.available2010-11-23T21:39:30Zen
dc.date.available2010-11-23T21:39:36Zen
dc.date.available2017-05-11T22:20:44Z
dc.date.issued2010-08en
dc.date.submittedAugust 2010en
dc.date.updated2010-11-23T21:39:36Zen
dc.descriptiontexten
dc.description.abstractWe present a methodology for exploiting shared-memory parallelism within matrix computations by expressing linear algebra algorithms as directed acyclic graphs. Our solution involves a separation of concerns that completely hides the exploitation of parallelism from the code that implements the linear algebra algorithms. This approach to the problem is fundamentally different since we also address the issue of programmability instead of strictly focusing on parallelization. Using the separation of concerns, we present a framework for analyzing and developing scheduling algorithms and heuristics for this problem domain. As such, we develop a theory and practice of scheduling concepts for matrix computations in this dissertation.en
dc.description.departmentComputer Sciencesen
dc.format.mimetypeapplication/pdfen
dc.identifier.urihttp://hdl.handle.net/2152/ETD-UT-2010-08-1563en
dc.language.isoengen
dc.subjectMatrix computationen
dc.subjectDirected acyclic graphen
dc.subjectAlgorithm-by-blocksen
dc.titleApplication of dependence analysis and runtime data flow graph scheduling to matrix computationsen
dc.type.genrethesisen

Files