首页 | 本学科首页   官方微博 | 高级检索  
     

基于内容的分布式Web服务器调度算法
引用本文:杜增凯,郑名扬,鞠九滨. 基于内容的分布式Web服务器调度算法[J]. 软件学报, 2003, 14(12): 2068-2073
作者姓名:杜增凯  郑名扬  鞠九滨
作者单位:吉林大学,计算机科学与技术学院,吉林,长春,130012
基金项目:Supported by the National Natural Science Foundation of China under Grant No.60073040 (国家自然科学基金)
摘    要:在分布式Web服务系统的研究中,基于内容的调度策略日益受到关注.但是,基于内容的请求调度带来的额外开销使得调度节点成为系统的瓶颈,限制了系统规模.为了实现系统的容错和扩展,集中讨论了分布式调度策略的设计问题,并针对难于分布的面向缓存调度策略设计了相应的分布式调度算法DWARD(distributed workload-aware request distribution).基于LINUX IP协议栈的系统测试表明,DWARD算法可以在适当调整的情况下获得良好的性能.

关 键 词:分布式Web服务器  基于内容  可扩展性  容错
收稿时间:2002-08-20
修稿时间:2003-03-04

A Distributed Algorithm for Content-Aware Web Server Clusters
DU Zeng-Kai,ZHENG Ming-Yang and JU Jiu-Bin. A Distributed Algorithm for Content-Aware Web Server Clusters[J]. Journal of Software, 2003, 14(12): 2068-2073
Authors:DU Zeng-Kai  ZHENG Ming-Yang  JU Jiu-Bin
Abstract: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.
Keywords:distributed Web server (DWS)  content-based  scalability  fault tolerance
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《软件学报》浏览原始摘要信息
点击此处可从《软件学报》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号