Show simple item record

dc.creatorChan, Ernie W., 1982-
dc.date.accessioned2010-11-23T21:39:30Z
dc.date.accessioned2010-11-23T21:39:36Z
dc.date.available2010-11-23T21:39:30Z
dc.date.available2010-11-23T21:39:36Z
dc.date.created2010-08
dc.date.issued2010-11-23
dc.date.submittedAugust 2010
dc.identifier.urihttp://hdl.handle.net/2152/ETD-UT-2010-08-1563
dc.descriptiontext
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.
dc.format.mimetypeapplication/pdf
dc.language.isoeng
dc.subjectMatrix computation
dc.subjectDirected acyclic graph
dc.subjectAlgorithm-by-blocks
dc.titleApplication of dependence analysis and runtime data flow graph scheduling to matrix computations
dc.date.updated2010-11-23T21:39:36Z
dc.description.departmentComputer Sciences
dc.type.genrethesis*
thesis.degree.departmentComputer Sciences
thesis.degree.disciplineComputer Sciences
thesis.degree.grantorUniversity of Texas at Austin
thesis.degree.levelDoctoral
thesis.degree.nameDoctor of Philosophy


Files in this item

Icon

This item appears in the following Collection(s)

Show simple item record