Revisiting dynamic DAG scheduling under memory constraints for shared-memory platforms

摘要

This work focuses on dynamic DAG scheduling under memory constraints. We target a shared-memory platform equipped with p parallel processors. We aim at bounding the maximum amount of memory that may be needed by any schedule using p processors to execute