分布存储系统上一种新的并行调度算法  

A NEW PARALLEL SCHEDULING ALGORITHM ON DISTRIBUTED MEMORY SYSTEMS

作　　者：卢光辉[1] 孙世新[1] 

机构地区：[1]电子科技大学计算机科学与工程系,成都610054

出　　处：《计算机研究与发展》2001年第2期223-227,共5页Journal of Computer Research and Development

基　　金："九五"国防科技预研项目基金资助! (16 .1.4.1)

摘　　要：在一般的分布存储系统上各个处理器可能不同且资源共享 ,导致了并行任务在各个处理器上的执行时间具有很大的随机性 ,主要根据系统及并行任务特性等引进特征参数 ,采用计算与通信重叠等方法设计出了一种新的并行调度算法 ,即使在多用户环境下应用此算法不仅能达到极高的负载平衡 ,充分利用系统资源而且能有效地提高并行效率及加速比 .实验结果表明 。Since every processor may be different and sources are shared in distributed memory systems, the time cost of a task on a processor is stochastic. In this paper a new parallel scheduling algorithm on distributed memory systems is brought forward, which mainly introduces a character parameter according to characters of systems and tasks, and adopts the overlapping technology of communication and computing. It not only gets load balanced very well and utilizes sources sufficiently, but also effectively improves the speedup ratio even if in the multi user conditions. Experiments show that the scheduling algorithm put forward in this paper is much more effective to utilize systems sources and raises higher speedup ratio than other similar algorithms.

关 键 词：负载平衡 加速比 并行调度算法 分布存储系统 

分 类 号：TP301.6[自动化与计算机技术—计算机系统结构]