Graph Scheduling for Memory-Constrained Accelerators
Repo βA search-based scheduler for DAG computation graphs under limited fast memory. The method explores feasible execution states with tensor retention decisions, tile-level simulation, split-k evaluation, and beam search.