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

一种基于内容的Web服务器集群调度算法
引用本文:李永喜,陈小平,杨兴良. 一种基于内容的Web服务器集群调度算法[J]. 计算机应用与软件, 2008, 25(3): 215-216,268
作者姓名:李永喜  陈小平  杨兴良
作者单位:中国科学技术大学计算机科学与技术系,安徽,合肥,230027
摘    要:基于内容的Web服务器集群调度算法具有很多优点.在分析已有方法基础上,提出一种部分复制的基于内容调度算法PRLARD(partially replicated locality-aware request distribution).理论分析和仿真结果表明,该算法具有良好的负载均衡能力和高的CACHE命中率.

关 键 词:Web服务器集群  Cache命中率  负载均衡  内容分配
收稿时间:2006-04-17
修稿时间:2006-04-17

A CONTENT-BASED SCHEDULING ALGORITHM FOR WEB SERVER CLUSTER
Li Yongxi,Chen Xiaoping,Yang Xingliang. A CONTENT-BASED SCHEDULING ALGORITHM FOR WEB SERVER CLUSTER[J]. Computer Applications and Software, 2008, 25(3): 215-216,268
Authors:Li Yongxi  Chen Xiaoping  Yang Xingliang
Affiliation:Li Yongxi Chen Xiaoping Yang Xingliang(Department of Computer Science , Technology,University of Science , Technology of China,Hefei 230027,Anhui,China)
Abstract:There are many advantages in content-based Web server cluster scheduling algorithms.Based on the existing algorithms,a partially replicated locality-aware request distribution(PRLARD) algorithm is proposed.The theoretical analysis and the experimental results show that this algorithm has the characteristics of good load balance and high cache hit rate.
Keywords:Web server cluster Cache hit rate Load balance Content assignment
本文献已被 CNKI 维普 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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