Key points are not available for this paper at this time.
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.
Building similarity graph...
Analyzing shared references across papers
Loading...
Min‐You Wu
Harbin University of Science and Technology
Wei Shu
Nanjing University
Jun Gu
Southern University of Science and Technology
University at Buffalo, State University of New York
Building similarity graph...
Analyzing shared references across papers
Loading...
Wu et al. (Fri,) studied this question.
synapsesocial.com/papers/6a1553e979ff98d0de4e7421 — DOI: https://doi.org/10.1109/icpp.1997.622584
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: