节点文献
集群Web服务器的预测最小连接请求调度算法设计
Design of Forecasting Least Connections First Scheduling Algorithm in Clustered Web Servers
【摘要】 讨论了集群Web服务器的几种请求调度策略 ,针对现有的请求调度策略都是基于队列当前状态的调度 ,提出“预测最小连接优先”请求调度策略 .通过请求速率、服务器负载及队列的历史信息来预测未来队列的状态 ,然后根据预测队列的状态分配请求连接 ,从而有效地解决服务器间的负载不平衡
【Abstract】 A few request dispatching algorithms are discussed. To the problem of that these request dispatching algorithms are based on current status of queue, a new scheduling algorithm is proposed which is called forecasting least connections first scheduling algorithm. It forecasts the future status of queue by velocity of request,load of servers and historical information of queue, then dispatch request according to the future status of queue. It can effectively solve the load imbalance problem among the servers.
【关键词】 集群Web服务器;
负载平衡;
请求调度;
预测;
【Key words】 server cluster; load balancing; scheduling algorithm; forecast;
【Key words】 server cluster; load balancing; scheduling algorithm; forecast;
- 【文献出处】 长沙电力学院学报(自然科学版) ,Journal of Changsha University of Electric Power(Natural Science) , 编辑部邮箱 ,2002年03期
- 【分类号】TP393.03
- 【被引频次】9
- 【下载频次】95