.png){kind=icon}
返回
.png){kind=icon}
.png){kind=icon}
摘要
En 中文
Static scheduling of a program represented by a directed task graph on a multiprocessor system to minimize the program completion time is a well-known problem in parallel processing. Since finding an optimal schedule is an NP-complete problem in general, researchers have resorted to devising efficient heuristics. A plethora of heuristics have been proposed based on a wide spectrum of techniques, including branch-and-bound, integer-programming, searching, graph-theory, randomization, genetic algorithms, and evolutionary methods. The objective of this survey is to describe various scheduling algorithms and their functionalities in a contrasting fashion as well as examine their relative merits in terms of performance and time-complexity. Since these algorithms are based on diverse assumptions, they differ in their functionalities, and hence are difficult to describe in a unified context. We propose a taxonomy that classifies these algorithms into different categories. We consider 27 scheduling algorithms, with each algorithm explained through an easy-to-understand description followed by an illustrative example to demonstrate its operation. We also outline some of the novel and promising optimization approaches and current research trends in the area. Finally, we give an overview of the software tools that provide scheduling/mapping functionalities.
Keyword:
algorithms
design
performance
theory
automatic parallelization
DAG
multiprocessors
parallel processing
software tools
static scheduling
task graphs
期刊
IF:
28
论文数:
2.4K
被引数:
3.5W
机构
暂无机构信息
引用论文
Modification of cellulose model surfaces by cationic polymer latexes prepared by RAFT-mediated surfactant-free emulsion polymerization.png)
Polym. Chem..png)
OAAI
Polym. Chem.IF0
OAAI.png){kind=icon}
分享.png){kind=icon}
收藏Interplay of topological phases in magnetic adatom-chains on top of a Rashba superconducting surfaceOAAI
OAAI分享收藏分享收藏
查看更多内容