摘要
简要描述了网络并行计算系统中任务调度问题和经典的多处理机任务调度研究现状,并将两者结合到一起建立网络并行计算系统中的新型调度模型,较详细地论述了多处理机任务的定义,然后还讨论了该模型求解的近似调度策略及其近似优化问题,给出了其特例Pm｜fix｜Cmax问题的最优调度的时间跨度下界。
Network parallel computing system has attracted much attention recently as a new parallel computing model.Because of its heterogeneous,jobs in system may have alternative execution modes and may require parallel execution of multiple resources in the system.This new job execution mode on network parallel computing systems has proposed new challenging research projects for system resource scheduling.Based on our previous theoretical research and new investigation on the parallel job scheduling problem,the current paper is focused on the study of multiprocessor job scheduling model on network parallel computing systems.We first present that the scheduling problems in the network parallel computing system and the researching of the classical multiprocessor -job scheduling model.And then we introduce the multiprocessor-job scheduling to the network parallel computing system,set up the new model of resource scheduling(RSM)in network parallel computing systems.The definiation of multiprocessor-job and the optimal works of resource scheduling are considered detaily by this paper.At the end,the lower bound of the optimal scheduling makespan of P m |fix|C max ,which is the special case of RSM,is proved.
出处
《计算机工程与应用》
CSCD
北大核心
2003年第29期54-58,83,共6页
Computer Engineering and Applications
基金
国家自然科学基金(编号:90104028)
长江学者奖励计划基金资助
关键词
网络并行计算
多处理机任务
资源调度模型
近似算法
Network parallel computing,multiprocessor job,resource scheduling model,approximation algorithm
