多处理器系统动态调度负载均衡节约算法  

Load-balancing thrift algorithm for dynamic scheduling of multiprocessor systems

作　　者：王遵彤[1] 李彩[1] 吴启迪[1] 

机构地区：[1]同济大学电子与信息工程学院,上海201804

出　　处：《控制与决策》2011年第11期1740-1744,共5页Control and Decision

基　　金：国家自然科学基金项目(60674076)

摘　　要：将任务集与处理器处理能力之间的匹配关系作为研究调度算法性能的重要因素,建立了相应的任务-处理器模型,以描述多处理器系统的负载状况.描述了多处理器系统任务可调度的必要条件,设计实现了任务集的生成方法.对节约算法进行改进,提出了负载均衡的节约算法.所提出的算法可在保证调度成功率的前提下,缩短任务的平均响应时间和调度长度,并均衡地提高处理器的利用率.The performance of scheduling algorithm is affected remarkably by the processing capability of processors and the size of tasks.Therefore,a task-processor model is proposed to describe the load status of the multi-processor systems,which reflects whether the tasks to be processed exceed the processing capability of the systems.A prerequisite describing the schedulability of multi-processor systems is presented,and a method is designed to generate the random task set.Based on the thrift algorithm,load-balancing thrift algorithm is proposed,to schedule multi-processor systems,which can simultaneously increase the success rate of scheduling,reduce the average response time of tasks and schedule length,and improve the utility of the processors evenly.

关 键 词：多处理器系统 可调度性 动态调度 负载均衡 调度算法 

分 类 号：TP273[自动化与计算机技术—检测技术与自动化装置]