总线互连机群系统上的静态任务调度  

STATIC TASK SCHEDULING FOR CLUSTERS INTERCONNECTED BY BUS

作　　者：章军[1] 冯秀山[1] 韩冀中[1] 韩承德[1] 

机构地区：[1]中国科学院计算技术研究所

出　　处：《计算机研究与发展》1999年第7期805-812,共8页Journal of Computer Research and Development

基　　金：国家自然科学资金;"九五"中国科学院基础性研究重大项目

摘　　要：与大规模并行处理（ＭＰＰ）系统相比，基于总线互连的机群（ｃｌｕｓｔｅｒ）系统是一种较为廉价的并行计算环境．文中提出了一个基于总线互连机群系统上的静态任务调度算法．该算法具有３个主要特点：（１）由于不同处理机之间的通信都必须通过共享总线，故在调度时将总线与处理机一样看成是资源加以分配；（２）针对总线适合于广播的特点，在调度中考虑了广播，对于某些应用而言可以大大减少通信次数；（３）在确定任务在某个处理机上的开始执行时间以及消息占用总线的开始时间时，选用了最早空闲时间空隙．最后，分别给出了Ｇａｕｓ－Ｊｏｒｄａｎ消去法与ＬＵ分解的任务图及其调度结果．Compared with massively parallel processing(MPP) systems, a cluster, which consists of several computers interconnected by a bus, is a very cheap parallel computing environment. This paper proposes a novel scheduling algorithm for clusters interconnected by bus. In general, the algorithm has three main features: (1) Shared bus is treated as a resource being allocated to messages just like processors to tasks; (2) Broadcast is considered which can decrease communication times greatly in some cases, and (3) The earliest idle time slot is exploited when determining the start time of a task on a processor and that of a message on the bus. Finally, the schedule results of the Gauss Jordan elimination method and LU decomposition are given and analyzed.

关 键 词：并行计算 算法 机群系统 总线互连 静态任务调度 

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