Application of dependence analysis and runtime data flow graph scheduling to matrix computations
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 lin...
| Main Author: | |
|---|---|
| Format: | Others |
| Language: | English |
| Published: |
2010
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/2152/ETD-UT-2010-08-1563 |