针对内容分发网络技术中本地负载均衡策略进行研究,提出一种适用于内容分发网络负载均衡的改进加权最小连接算法(improved weighted least connection,IWLC)。该算法在加权最小连接算法基础上考虑服务器性能与负载能力,引入服务器动态...针对内容分发网络技术中本地负载均衡策略进行研究,提出一种适用于内容分发网络负载均衡的改进加权最小连接算法(improved weighted least connection,IWLC)。该算法在加权最小连接算法基础上考虑服务器性能与负载能力,引入服务器动态性能与负载水平评估因子,计算出综合性能指标以及动态权值并以此性能指标为依据完成任务调度,能较好地利用底层硬件资源,同时降低任务响应时间。展开更多
To solve the query processing correctness problem for semantic-based relational data integration,the semantics of SAPRQL（simple protocol and RDF query language） queries is defined.In the course of query rewriting,al...To solve the query processing correctness problem for semantic-based relational data integration,the semantics of SAPRQL（simple protocol and RDF query language） queries is defined.In the course of query rewriting,all relative tables are found and decomposed into minimal connectable units.Minimal connectable units are joined according to semantic queries to produce the semantically correct query plans.Algorithms for query rewriting and transforming are presented.Computational complexity of the algorithms is discussed.Under the worst case,the query decomposing algorithm can be finished in O（n2） time and the query rewriting algorithm requires O（nm） time.And the performance of the algorithms is verified by experiments,and experimental results show that when the length of query is less than 8,the query processing algorithms can provide satisfactory performance.展开更多
广域信息管理(System Wide Information Management,SWIM)是"航空云(Aeronautical Cloud)"的基础设施,用于航空交通运输相关信息的传输与共享。SWIM系统的可靠性和生存能力对航空交通运输的安全运行具有重大影响。设计了面向S...广域信息管理(System Wide Information Management,SWIM)是"航空云(Aeronautical Cloud)"的基础设施,用于航空交通运输相关信息的传输与共享。SWIM系统的可靠性和生存能力对航空交通运输的安全运行具有重大影响。设计了面向SWIM系统生存能力的弹性灾难恢复方案。该方案采用Linux虚拟服务的组织架构,改进了Linux虚拟服务中的加权最小连接WLC(Weighted Least-Connection)调度算法,提高了SWIM服务的连续性。实验结果表明,改进后的加权最小连接算法可以有效提升SWIM系统的灾难恢复能力,满足SWIM系统的弹性灾难恢复需求。展开更多
文摘针对内容分发网络技术中本地负载均衡策略进行研究,提出一种适用于内容分发网络负载均衡的改进加权最小连接算法(improved weighted least connection,IWLC)。该算法在加权最小连接算法基础上考虑服务器性能与负载能力,引入服务器动态性能与负载水平评估因子,计算出综合性能指标以及动态权值并以此性能指标为依据完成任务调度,能较好地利用底层硬件资源,同时降低任务响应时间。
基金Weaponry Equipment Pre-Research Foundation of PLA Equipment Ministry (No. 9140A06050409JB8102)Pre-Research Foundation of PLA University of Science and Technology (No. 2009JSJ11)
文摘To solve the query processing correctness problem for semantic-based relational data integration,the semantics of SAPRQL（simple protocol and RDF query language） queries is defined.In the course of query rewriting,all relative tables are found and decomposed into minimal connectable units.Minimal connectable units are joined according to semantic queries to produce the semantically correct query plans.Algorithms for query rewriting and transforming are presented.Computational complexity of the algorithms is discussed.Under the worst case,the query decomposing algorithm can be finished in O（n2） time and the query rewriting algorithm requires O（nm） time.And the performance of the algorithms is verified by experiments,and experimental results show that when the length of query is less than 8,the query processing algorithms can provide satisfactory performance.
