原创力文档- 1、本文档共18页，可阅读全部内容。
- 2、原创力文档（book118）网站文档一经付费（服务费），不意味着购买了该文档的版权，仅供个人/单位学习、研究之用，不得用于商业用途，未经授权，严禁复制、发行、汇编、翻译或者网络传播等，侵权必究。
- 3、本站所有内容均由合作方或网友上传，本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺！文档内容仅供研究参考，付费前请自行鉴别。如您付费，意味着您自己接受本站规则且自行承担风险，本站不退款、不进行额外附加服务；查看《如何避免下载的几个坑》。如果您已付费下载过本站文档，您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等，请点击“版权申诉”（推荐），也可以打举报电话：400-050-0827(电话支持时间：9:00-18:30)。
查看更多
A heuristic for scheduling task graphs with communication delays onto multiprocessors
PARALLEL
COMPUTING
Parallel Computing 22(1996) 1197-1214
A heuristic for scheduling task graphs with
communication delays onto multiprocessors
Goran Lj. Djordjevi6 *, Milorad B. To%
Faculty of Electronic Engineering, University of NiZ, Beogradsko 14, P.O. Box 73,18W NC’, Serbia,
Yugoslavia
Received 15 April 1995; revised 25 June 1996
Abstract
The multiprocessor scheduling problem can be stated as finding a schedule for a task graph to
be executed on a multiprocessor architecture so that the execution time can be minimized. Since
this problem is known to be NP-hard, in all but a few very restricted cases, the main research
efforts in this area are focused on heuristic methods for obtaining ,near-optimal solutions in a
reasonable amount of time. A new compile-time single-pass multiprocessor scheduling technique,
called chaining, has been developed and is presented in this paper. Chaining takes into account
the communication overhead and can be applied to scheduling task graphs onto fully-connected
multiprocessor architectures containing an arbitrary (bounded as well as an unbounded) number of
processors. This technique can be viewed as a generalized list scheduling concept, that does not
impose any preconditions about the ordering in which tasks are selected for scheduling as well as
about the position within the current partial schedule where selected task can be placed. Varying
the selection policy, implemented in this technique, we are able to generate a class of scheduling
algorithms. As a representative example of this class we present Task Selection First (TSF)
scheduler. We compare performances of the TSF scheduler with the dynamic level scheduler
proposed by Sih and Lee, the dominant sequence clustering algorithm proposed by Yang and
Gerasoulis, and the DSC/MLS algorithm, a modified version of Sarkar’s two-step scheduling
technique.
Keywords: Multiprocessor scheduling; Task graph; Interprocessor communication; Chaining; List scheduli
文档评论（0）