Web集群中基于接纳控制的QoS-aware请求调度算法  

Admission control-based QoS-aware request scheduling arithmetic in Web cluster

作　　者：张曦煌[1] 韩仲海[1] 

机构地区：[1]江南大学信息学院,江苏无锡214122

出　　处：《计算机工程与应用》2007年第16期162-164,218,共4页Computer Engineering and Applications

摘　　要：集群系统的设计主要涉及任务调度与资源调度两方面,以往的大部分算法都只是孤立地考虑其中一个方面。针对这种不足提出了一种基于接纳控制的QoS-aware动态请求调度算法。该算法结合网络自相似访问特征,引入接纳概率Pa作为连接任务调度与资源调度的桥梁,将两种调度结合了起来。Pa是一个以任务服务类别与负载为自变量的二元函数,随着负载的增加,Pa非增变化,对于不同QoS需求的队列,Pa的变化速率不同,这样就可以达到在不同负载情况下动态地为各服务类分配带宽的目的。最后通过仿真实验测试了结果。Task scheduling and resource scheduling are two major aspects concerned with cluster system,while most of the arithmetic only consider one of them.To resolve this problem,an admission control-based QoS-aware dynamic request scheduling arithmetic is proposed in this paper.h introduces the probability Pa which combines self-similar network traffic character and acts as a link to connect the task scheduling and resource scheduling.P, is an function with two independent variables which are service class and load.With the increase of load,Pa varies non increasingly.For queens with different requirements,the Pa＇s varying speed is different so as to dynamically arrange bandwidth for every service class in the different load situations.At the end of this paper,the imitate experiment is conducted to testify it＇s rationality.

关 键 词：WEB集群 QOS 调度 接纳控制 WRR 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]