基于内容的分布式Web服务器调度算法  

A Distributed Algorithm for Content-Aware Web Server Clusters

作　　者：杜增凯[1] 郑名扬[1] 鞠九滨[1] 

机构地区：[1]吉林大学计算机科学与技术学院,吉林长春130012

出　　处：《软件学报》2003年第12期2068-2073,共6页Journal of Software

基　　金：国家自然科学基金~~

摘　　要：在分布式Web服务系统的研究中,基于内容的调度策略日益受到关注.但是,基于内容的请求调度带来的额外开销使得调度节点成为系统的瓶颈,限制了系统规模.为了实现系统的容错和扩展,集中讨论了分布式调度策略的设计问题,并针对难于分布的面向缓存调度策略设计了相应的分布式调度算法DWARD(distributed workload-aware request distribution).基于LINUX IP协议栈的系统测试表明,DWARD算法可以在适当调整的情况下获得良好的性能.While content-aware distribution policies are getting more popular in cluster-based web systems, they make the dispatching node a bottleneck. To address the scalability and fault-tolerance problem, issues about designing distributed dispatching policies are discussed. For the policies aiming at improving the cache hit rate, a distributed dispatching policy named DWARD (distributed workload-aware request distribution) that takes into account both the load balance and the locality enhancement is presented. Finally, a testbed is implemented on the basis of a Linux kernel to benchmark various dispatching algorithms. The performance results show that DWARD can achieve a favorable throughput compared with the state-of-the-art dispatching policies.

关 键 词：分布式WEB服务器 基于内容 可扩展性 容错 

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