A Throughput-Driven Scheduling Algorithm of Differentiated Service for Web Cluster

Requests distribution is an key technology for Web cluster server. This paper presents a throughput-driven scheduling algorithm （TDSA）. The algorithm adopts the throughput of cluster back-ends to evaluate their load and employs the neural network model to predict the future load so that the scheduli...

Full description

Saved in:
Bibliographic Details
Published in:Wuhan University journal of natural sciences 2006, Vol.11 (1), p.88-92
Main Authors: Yan, Cai-Rong, Shen, Jun-Yi, Peng, Qin-Ke, Wan, Yong-Quan
Format: Article
Language:English
Subjects:
Web聚类
区别服务
生产量
调度算法
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Requests distribution is an key technology for Web cluster server. This paper presents a throughput-driven scheduling algorithm （TDSA）. The algorithm adopts the throughput of cluster back-ends to evaluate their load and employs the neural network model to predict the future load so that the scheduling system features a self-learning capability and good adaptability to the change of load. Moreover, it separates static requests from dynamic requests to make full use of the CPU resources and takes the locality of requests into account to improve the cache hit ratio. Experimental re suits from the testing tool of WebBench^TM show better per formance for Web cluster server with TDSA than that with traditional scheduling algorithms.
ISSN:1007-1202
1993-4998
DOI:10.1007/bf02831710