Research of Task Scheduling in NetworkParallel Computing Environment
-
摘要: 利用网上空闲处理机组成机群并行计算环境是快速增长的研究领域,任务调度是其中最关键性的问题之一.在基于消息传递机制的网络并行计算环境下,针对一类大粒度计算任务并行时协同同步工作问题,发展了一种新的静态调度模型,提出了调度算法,它映射一类特殊的并行程序任务到由网络上若干空闲处理机组成的机群中.研究表明该算法能减少此类并行程序的完成时间.Abstract: Clusters of workstations on common network are much increasing being used as cost-effective parallel computing platforms. Task scheduling is one of the crucial problems in cluster computing. A new scheduling graph model is developed to present a kind of special parallel program, which solves synchronous working problem among coarse-grained tasks in message passing system. A scheduling algorithm that maps this kind of program onto a cluster is provided, which consists of some idle workstations in a LAN for parallel computing. It is demonstrated that algorithm can reduce the completion time of the parallel program.
-
Key words:
- parallel processing /
- distribution computers /
- scheduler /
- task scheduling /
- cluster computing /
- task graph /
- synchronous task
-
[1] Hesham El-Rewini,Lewis T G, Hesham H A. Task scheduling in parallel and distributed system[M]． USA:PH Press,1994. [2] 傅 强.异构机群系统负载平衡问题研究 ．北京:清华大学计算机系.1998. [3] Hesham El-Rewini, Lewis T G. Scheduling parallel program tasks onto arbitrary target machines[J].Journal of Parallel and Distributed Computing,1990,9:138~153. [4] Mcgregor D,Riehl M. Autornatic determination of grain size for efficient parallel processing[J]. Communication of ACM,1989,32(9):1073~1078. [5] Zhou H B. Scheduling DAGs on a bounded number of processor . http://www.epm.ornl.gov/~zhou,2000. -
点击查看大图
计量
- 文章访问数: 2143
- HTML全文浏览量: 31
- PDF下载量: 1338
- 被引次数: 0
下载:
