自调度集群的研究与实现

传统的Web集群服务器均以集中控制的负载均衡为特征，带来的主要问题是负载评估比较粗略，高负载情况下后端服务器容易出现“活锁“现象，前端负载均衡器也容易成为整个系统的瓶颈。针对传统集群负载均衡技术的缺点，提出一种自调度负载均衡技术，把负载均衡的工作转移到后端的服务器，能够提高整个集群系统的性能。intel评测实验室的测试表明，自调度集群在系统高负载情况下仍表现出很好的并发能力。     

一种分布式动态负载均衡调度算法

目前计算机应用服务系统经常采用集群系统,负载均衡调度是集群系统的关键。在通用负载均衡调度算法的基础上,提出一种分布式动态负载均衡调度算法.该算法动态收集、统计和分析服务器的信息,以此为根据完成服务器负载均衡的任务,能够实现集群正常调度.在此基础上,采取分布式调度的策略,提高负载均衡调度的效率、性能,以使其对业务系统整体性能的影响最小。     

动态反馈的异构集群负载均衡算法的实现

虚拟服务技术(LVS)的集群负载调度系统中的加权调度算法权值是静态的,没有动态调整机制,不能依据真实服务器处理能力进行动态的任务分配;给出了一种通过量化调度器和真实服务器的实时反馈负载信息指标,采用服务器负载率和分配权值为计算指标,引入临界回归因子,利用动态反馈临界加速回归的算法思想,实现基于动态反馈机制的动态反馈临界加速回归分配算法。该算法能根据负载均衡调度器和业务处理服务器的实时反馈信息,及时进行负载调度,实现负载动态平衡,进一步提高服务器的利用效率和集群系统的吞吐率,并在LVS的负载平衡调度集群系统中进行了应用性的实验验证。测试结果表明,该算法可实时反馈负载信息,动态进行负载调度,整体上较好的实现了负载动态平衡,提高了服务器的利用效率和集群系统的吞吐率。     

基于SDN技术的服务器负载均衡设计

传统服务器负载均衡的实现方式存在可靠性低、维护性差、增加额外开销等问题.软件定义网络(SDN)在流调度上具有灵活、可靠性高、可维护的特点.在研究现有负载均衡方法的基础上,结合SDN技术,提出基于SDN的云中心动态负载均衡方法,实现了基于流级的动态负载均衡.Floodlight与OVS仿真实验证明,利用SDN技术实现服务器集群负载均衡的方案是可行的.     

一种基于服务器主动调度策略的集群体系结构

在分析现有集群服务器调度机制的基础上,提出一种基于服务器主动调度策略的集群体系结构.该体系结构摒弃了传统层次上的负载均衡工作方式,消除了高负载下服务器的"活锁"现象,提高了服务器的有效利用率,保证了较短的响应时间,实现了最大的处理能力,以及公平服务、容错、可扩展等功能.     

基于最小负载的Linux Web机群负载均衡算法

为了充分发挥Web机群后端服务器的实际处理能力,实现了一种基于最小负载的Web机群负载均衡算法.该算法依据后端服务器的实际状态:CPU使用率、内存使用率、网络利用率和磁盘性能,通过定时获取后端服务器的状态信息,导出服务器综合负载并放大取整,作为服务器权值.基于最小负载的均衡算法能够动态反馈,具有自适应特性.与加权轮转调度算法相比,基于最小负载的调度算法具有更高的请求成功数和较低的请求失败数.     

基于集群的Web服务负载均衡算法研究

使用服务器集群系统解决网络服务节点的性能瓶颈问题是目前普遍采用的方法,其中负载均衡技术又是决定整个集群的性能和可伸缩性的关键因素。在此提出了一种结合动态任务分配表和基于多IP虚拟路由器集群系统的负载均衡技术。     

基于负载均衡的任务调度算法

基于传统任务调度算法, 通过在调度过程中增设服务器最佳期望序列及负载均衡指数, 采用任务连接数约束服务器选择, 解决了传统任务调度算法对于集群负载均衡性能的忽略问题. 实验结果表明, 该改进算法能达到较高负载均衡度, 同时缩短任务完成时间, 并提高了集群对于批量级任务的处理能力, 从而达到了优化的目的.     

基于排队理论的自适应负载均衡算法研究

负载均衡集群技术中的负载均衡算法是整个互联网络应用研究中一个重要问题。本文针对“需求快速变化”这一企业级管理软件开发中呈现的特点，以及各应用软件之间的互操作性差、应用集成水平较低，无法实现信息的共享与交流这一问题，提出一种基于排队理论的负载均衡调度算法。该算法根据当前的负载情况和服务器的剩余处理能力，计算出服务器在随后的固定时间间隔中所需要的平均到达率，进而得到任务分配策略，从而得到较为优秀的负载均衡效果。最后通过仿真实验和对比分析，证明了该算法具有较好性能。     

集中式动态负载均衡算法的研究

目前的负载均衡算法中难以探测节点终端的实际负载,导致难以有效地满足负载均衡集群系统实时需求.通过分析集群系统中的资源管理优化技术和负载均衡调度算法,对集群系统的模型结构进行了分析,提出了一种改进的集群系统的负载均衡算法,该算法较好地解决了集群的资源调度问题.     

Characterization of Ordovician carbonate reservoirs, southeastern Saskatchewan, Canada

The discovery of the prolific Ordovician Red River reservoirs in 1995 in southeastern Saskatchewan was the catalyst for extensive exploration activity which resulted in the discovery of more than 15 new Red River pools. The best yields of Red River production to date have been from dolomite reservoirs. Understanding the processes of dolomitization is, therefore, crucial for the prediction of the connectivity, spatial distribution and heterogeneity of dolomite reservoirs.The Red River reservoirs in the Midale area consist of 3～4 thin dolomitized zones, with a total thickness of about 20 m, which occur at the top of the Yeoman Formation. Two types of replacement dolomite were recognized in the Red River reservoir: dolomitized burrow infills and dolomitized host matrix. The spatial distribution of dolomite suggests that burrowing organisms played an important role in facilitating the fluid flow in the backfilled sediments. This resulted in penecontemporaneous dolomitization of burrow infills by normal seawater. The dolomite in the host matrix is interpreted as having occurred at shallow burial by evaporitic seawater during precipitation of Lake Almar anhydrite that immediately overlies the Yeoman Formation. However, the low δ18O values of dolomited burrow infills (-5.9‰～ -7.8‰, PDB) and matrix dolomites (-6.6‰～ -8.1‰, avg. -7.4‰ PDB) compared to the estimated values for the late Ordovician marine dolomite could be attributed to modification and alteration of dolomite at higher temperatures during deeper burial, which could also be responsible for its 87Sr/86Sr ratios (0.7084～0.7088) that are higher than suggested for the late Ordovician seawaters (0.7078～0.7080). The trace amounts of saddle dolomite cement in the Red River carbonates are probably related to "cannibalization" of earlier replacement dolomite during the chemical compaction.     

An Index mechanism for multi-scale view in spatial databases

There are numerous geometric objects stored in the spatial databases. An importance function in a spatial database is that users can browse the geometric objects as a map efficiently. Thus the spatial database should display the geometric objects users concern about swiftly onto the display window. This process includes two operations:retrieve data from database and then draw them onto screen. Accordingly, to improve the efficiency, we should try to reduce time of both retrieving object and displaying them. The former can be achieved with the aid of spatial index such as R-tree, the latter require to simplify the objects. Simplification means that objects are shown with sufficient but not with unnecessary detail which depend on the scale of browse. So the major problem is how to retrieve data at different detail level efficiently. This paper introduces the implementation of a multi-scale index in the spatial database SISP (Spatial Information Shared Platform) which is generalized from R-tree. The difference between the generalization and the R-tree lies on two facets: One is that every node and geometric object in the generalization is assigned with a importance value which denote the importance of them, and every vertex in the objects are assigned with a importance value,too. The importance value can be use to decide which data should be retrieve from disk in a query. The other difference is that geometric objects in the generalization are divided into one or more sub-blocks, and vertexes are total ordered by their importance value. With the help of the generalized R-tree, one can easily retrieve data at different detail levels.Some experiments are performed on real-life data to evaluate the performance of solutions that separately use normal spatial index and multi-scale spatial index. The results show that the solution using multi-scale index in SISP is satisfying.     

A computer generator for randomly layered structures

AcomputergeneratorforrandomlylayeredstructuresYUJia shun1,2,HEZhen hua2(1.TheInstituteofGeologicalandNuclearSciences,NewZealand;2.StateKeyLaboratoryofOilandGasReservoirGeologyandExploitation,ChengduUniversityofTechnology,China)Abstract:Analgorithmisintrod…     

海南岛地体及其毗邻陆缘晚中生代—新生代古地磁研究和构造演化

本文叙述了对海南岛及其毗邻大陆边缘白垩纪到第四纪地层岩石进行古地磁研究的全部工作过程。通过分析岩石中剩余磁矢量的磁偏角及磁倾角的变化,提出海南岛白垩纪以来经历的构造演化模式如下:早期伴随顺时针旋转而向南迁移,后期伴随逆时针转动并向北运移。联系该地区及邻区的地质、地球物理资料,对海南岛上述的构造地体运动提出以下认识:北部湾内早期有一拉张作用,主要是该作用使湾内地壳显著伸长减薄,形成北部湾盆地。从而导致了海南岛的早期构造运动,而海南岛后期的构造运动则主要是受南海海底扩张的影响。海南地体运动规律的阐明对于了解北部湾油气盆地的形成演化有重要的理论和实际意义。     

Exciton Seebeck in Molecular Systems

Various applications relevant to the exciton dynamics,such as the organic solar cell,the large-area organic light-emitting diodes and the thermoelectricity,are operating under temperature gradient.The potential abnormal behavior of the exicton dynamics driven by the temperature difference may affect the efficiency and performance of the corresponding devices.In the above situations,the exciton dynamics under temperature difference is mixed with     

Achieving Unusual States of Matter Under High Pressure

The elongation method,originally proposed by Imamura was further developed for many years in our group.As a method towards O(N)with high efficiency and high accuracy for any dimensional systems.This treatment designed for one-dimensional(ID)polymers is now available for three-dimensional(3D)systems,but geometry optimization is now possible only for 1D-systems.As an approach toward post-Hartree-Fock,it was also extended to     

《Chinese Science Bulletin》SUBJECT INDEX TO VOLUME 59(2014)

正~~     

An on-line scaling method for improving scalability of a database cluster

The explosive growth of the Internet and database applications has driven database to be more scalable and available, and able to support on-line scaling without interrupting service. To support more client's queries without downtime and degrading the response time, more nodes have to be scaled up while the database is running. This paper presents the overview of scalable and available database that satisfies the above characteristics. And we propose a novel on-line scaling method. Our method improves the existing on-line scaling method for fast response time and higher throughputs. Our proposed method reduces unnecessary network use, i.e. , we decrease the number of data copy by reusing the backup data. Also, our on-line scaling operation can be processed parallel by selecting adequate nodes as new node. Our performance study shows that our method results in significant reduction in data copy time.     

An improved R-tree based on childnode''s probability

R-Tree is a good structure for spatial searching. But in this indexing structure,either the sequence of nodes in the same level or sequence of traveling these nodes when queries are made is random. Since the possibility that the object appears in different MBR which have the same parents node is different, if we make the subnode who has the most possibility be traveled first, the time cost will be decreased in most of the cases. In some case, the possibility of a point belong to a rectangle will shows direct proportion with the size of the rectangle. But this conclusion is based on an assumption that the objects are symmetrically distributing in the area and this assumption is not always coming into existence. Now we found a more direct parameter to scale the possibility and made a little change on the structure of R-tree, to increase the possibility of founding the satisfying answer in the front sub trees. We names this structure probability based arranged R-tree (PBAR-tree).     

Integrating GIS Web services based on mediating architecture

The geographic information service is enabled by the advancements in general Web service technology and the focused efforts of the OGC in defining XML-based Web GIS service. Based on these models, this paper addresses the issue of services chaining,the process of combining or pipelining results from several interoperable GIS Web Services to create a customized solution. This paper presents a mediated chaining architecture in which a specific service takes responsibility for performing the process that describes a service chain. We designed the Spatial Information Process Language (SIPL) for dynamic modeling and describing the service chain, also a prototype of the Spatial Information Process Execution Engine (SIPEE) is implemented for executing processes written in SIPL. Discussion of measures to improve the functionality and performance of such system will be included.