High Performance Computing 1
DAG Scheduling
•Two application domains where DAGs are known
–Digital Signal Processing computations
–Sparse direct solvers (mainly Cholesky, since it doesn’t require pivoting).
–Basic strategy: partition DAG to minimize communication and keep all processors busy
–NP complete, so need approximations
–Different than graph partitioning, which was for tasks with communication but no dependencies