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

Repository

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

Show full record

Title: Application of dependence analysis and runtime data flow graph scheduling to matrix computations
Author: Chan, Ernie W., 1982-
Abstract: We 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.
Department: Computer Sciences
Subject: Matrix computation Directed acyclic graph Algorithm-by-blocks
URI: http://hdl.handle.net/2152/ETD-UT-2010-08-1563
Date: 2010-08

Files in this work

Download File: CHAN-DISSERTATION.pdf
Size: 833.4Kb
Format: application/pdf

This work appears in the following Collection(s)

Show full record


Advanced Search

Browse

My Account

Statistics

Information