Task Graph Performance Bounds Through Comparison Methods
When a parallel computation is represented in a formalism that imposes series-parallel structure on its task graph, it becomes amenable to automated analysis and scheduling. Unfortunately, its execution time will usually also increase as precedence constraints are added to ensure series-parallel str...
| Main Author: | |
|---|---|
| Format: | Thesis |
| Published: |
2001
|