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

  • Chan, Ernie W., 1982-
ORKG logo Add to ORKG
Publication date
November 2010

Abstract

textWe 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.Compu...

Extracted data

Loading...

Related items

Application of dependence analysis and runtime data flow graph scheduling to matrix computations
  • Chan, Ernie W., 1982-
November 2010

textWe present a methodology for exploiting shared-memory parallelism within matrix computations by ...

Graph Transformation and Designing Parallel Sparse Matrix Algorithms beyond Data Dependence Analysis
  • H.X. Lin
January 2004

Algorithms are often parallelized based on data dependence analysis manually or by means of parallel...

Data-Flow Algorithms for Parallel Matrix Computations
  • D. O'Leary
  • G.W. Stewart
January 1985

In this article the authors develop some algorithms and tools for solving matrix problems on paralle...

We use cookies to provide a better user experience.