基于平均等待时间约束的松弛预留机制  

Relaxed Reservation Mechanism Based on Mean Waiting Time Constraint

作　　者：胡志刚[1,2] 阎朝坤[1] 刘长庚[2] 

机构地区：[1]中南大学信息科学与工程学院,长沙410083 [2]中南大学软件学院,长沙410083

出　　处：《计算机工程》2012年第10期244-246,共3页Computer Engineering

基　　金：国家自然科学基金资助项目(60970038)

摘　　要：传统预留机制存在预留请求拒绝率高、可能会延迟本地作业执行的缺陷。为此,提出一种基于平均等待时间(MWT)约束的松弛预留机制,并给出相应的预留接纳算法。采用松弛预留策略,在每个资源上设置任务等待时间阈值,若调度队列中排队任务的MWT超过该阈值,调度系统将使部分排队任务尽快获得空闲资源,从而减少MWT。实验结果表明,该预留机制能有效保障排队任务的MWT、提高资源利用率、降低预留请求拒绝率。Aiming at high Rejection Ratio（RR） of traditional reservation mechanism and negative impact on local tasks,a relaxed reservation mechanism based on Mean Waiting Time（MWT） constraint is proposed in the paper.A MWT threshold is set for each grid resource to ensure the WMT of queuing tasks in scheduling queue can be kept in a reasonable duration.Specifically,a resource reservation admission algorithm is proposed.Experimental results show that the proposed reservation algorithm outperforms traditional reservation strategy in terms of resource utilization rate,average waiting time of local tasks and RR of reservation requests.

关 键 词：网格 资源预留 拒绝率 排队任务 平均等待时间 资源利用率 

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