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

一种基于系统负载的轮流服务模型
引用本文:王文丰,赵跃龙.一种基于系统负载的轮流服务模型[J].华南理工大学学报(自然科学版),2009,37(10).
作者姓名:王文丰  赵跃龙
作者单位:华南理工大学,计算机科学与工程学院,广东,广州,510640
基金项目:国家自然科学基金资助项目,广州市科技计划项目,高等学校博士学科点专项科研基金资助项目 
摘    要:针对现有集群系统在可用性和服务质量等方面存在的不足,首先引入一种动态k叉树结构,在此基础上提出了一种基于系统负载的轮流服务模型.在该模型中,分别介绍了一种自回归负载预测模型、基于选举域划分的多机心跳机制以及动态域主节点的选举机制和算法.理论分析和实验结果表明,该模型大大提高了系统的可靠性和可用性,减小了请求处理的平均响应时间,降低了选举开销,能够满足大规模集群服务的高可用性和高服务质量的要求.

关 键 词:可用性  动态k叉树  选举域  自适应性  轮流服务  
收稿时间:2008-11-11
修稿时间:2009-3-13

A Model of Alternate Service based on System Load
Wang Wen-feng,Zhao Yue-long.A Model of Alternate Service based on System Load[J].Journal of South China University of Technology(Natural Science Edition),2009,37(10).
Authors:Wang Wen-feng  Zhao Yue-long
Abstract:To overcome the deficiencies in availability and quality of service (QoS) of existing clusters, this paper firstly introduces a dynamic k-ary tree architecture, and then proposes a model of alternate service based on system load. In the model, an autoregressive load prediction model, a multi-machine heartbeat mechanism based on election domain partition and dynamic domain leader election mechanism and algorithm is presented. Theoretical analysis and experimental results demonstrate that it greatly improves the reliability and availability, as well as reduces the average response time and election overhead. It can satisfy the requirements of high availability and QoS of large-scale cluster-based services.
Keywords:availability  dynamic k-ary tree  election domain  self-adaptability  alternate service
本文献已被 万方数据 等数据库收录!
点击此处可从《华南理工大学学报(自然科学版)》浏览原始摘要信息
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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