Memory-aware tree traversals with pre-assigned tasks
Complexity of scheduling task graphs with two memories. Application to CPU/GPU hybrid programming. Heuristics to design efficient trade-offs between both peak memories. Analysis of post-order traversals and application to multifrontal methods.
memory-aware tree traversal scheduling multifrontal method sparse matrix factorization bi-objective optimization