并行分布计算中的任务调度问题(一)

<正>1引言 任务调度是并行分布计算中最具有挑战性的问题之一,其1般形式和几种受限形式是NP完全问题~[1][2]。要取得多项式时间复杂度的最优调度算法。

Task scheduling is one of the most common and challengable problems in parallel and dis-tributed computing and it has great influence on the performance of parallel programs. This paper, has introduced the basic concept and model of task scheduling in parallel and distributed computing first, then surveyed the optimal and heuristic algorithms in static scheduling.