Answers are grounded in this paper and cite their sources.
Scheduling DAGs to multiprocessors is one of the key issues in high-performance computing. Local search can be used to effectively improve the quality of a scheduling algorithm. In this paper, based on topological ordering, we present a fast local search algorithm which can improve the quality of DAG scheduling algorithms. This low complexity algorithm can effectively reduce the length of a given schedule.
No takes yet. Share an insight, caveat, or question.
Wu et al. (2002) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: