基于Petri网的集群应用系统性能评价

利用随机Petri网理论给出了一个集群应用软件负载平衡系统的抽象模型,通过细化其中的本地节点处理部分对3种集群动态负载平衡的调度策略和应用系统体系结构对负载平衡系统的影响进行了分析,得到了一些对大部分应用系统的设计起到指导作用的结论.这些结论是:(1)无论是静态负载平衡还是动态负载平衡都能提高集群系统的性能,动态负载平衡会得到更好的性能;(2)在动态负载平衡算法中除了要考虑系统中最重要的等待队列--应用队列外,还要考虑数据库队列;(3)异步体系架构将任务切分到各处理子系统中,有助于将各子系统负载数据综合到负载向量中,能够更准确地衡量系统负载、提高负载平衡系统的性能,优于同步体系结构.     

集群负载平衡的性能评测方法

随着单一系统映像(SSI)集群的发展,其提供的易于使用的高性能和高可用的计算环境,对用户越来越具有吸引力。但是,对于单一系统映像集群,现有的基准测试程序在测试系统性能时将负载静态地平均到各个处理器,而没有考虑系统的动态负载平衡特性。基于此,提出一种针对负载平衡集群的性能评测方法,采用非平衡树搜索算法提供动态负载,通过负载单元的运行时间评测系统在真实的负载平衡环境下的性能。     

一种动态网络负载平衡集群系统的实现

集群系统近年来在计算机网络中的应用越来越广泛,提供服务的负载分配算法对集群的性能有很大的影响。本文通过对集群系统中的负载平衡算法的研究,在Linux下实现了一种集群系统动态网络负载平衡算法。通过实验结果分析,此算法能够提高集群系统服务程序的运行性能。     

分布式数据流处理系统的动态负载平衡技术

设计了一种新的大规模分布式数据流处理系统的体系结构。系统由一组异构的服务器集群组成，负载在每个服务器集群内部多台同构的服务器之间获得平衡，从而达到整个系统的负载平衡。集群设计的主要目标之一是以资源换性能，服务器集群中服务器的最大数目足够保证系统不再发生过载现象，不再需要会降低性能的卸载技术。而且投入运行的服务器的数目根据实际的系统负载来决定，负载较轻时，一部分服务器可以进入休眠状态来减少能源的消耗。根据系统动态增减服务器的特点，设计了全新的初始化算法、动态负载平衡算法。与以前的分布式数据流处理系统相比，由于单个集群的服务器的数目大大减少，算法复杂性降低、速度加快、优化的空间增大。     

使用资源利用率作为负载平衡系统的负载指标

一个可以正确反映当前系统负载情况的负载指标对一个成功的动态负载平衡系统来说是至关重要的．但是，很少负载平衡系统对其选定给出一个实验说明，而且多数系统使用资源队列长度（即ＣＰＵ队列长度）作为负载指标．本文说明了这种负载指标存在的缺点，并对一种新的负载指标－资源利用率进行了讨论．实验表明，在动态负载平衡系统中，使用资源利用率作为负载指标比使用资源队列长度作为负载指标对资源利用率及作业响应时间的改进更有效．     

分布式数据库系统的动态负载平衡策略及算法设计

随着网络中数据库应用的发展，使得分布式数据库系统的负载平衡问题突显出来。目前大多数分布式数据库管理系统没有负责平衡功能，其负载平衡依赖于操作系统的负载平衡机制来解决，这样带来的问题是系统负载的评价粒度细小和负载转移的开销增加。讨论了动态负载平衡策略的要素，针对分布式数据库系统的负载平衡问题，提出了以事务队列长度作为负载评价标准，并给出了一个动态负载平衡策略及算法。     

基于随机高级Petri网模型的服务器均衡集群

在均衡集群中请求的分配和选择服务是影响服务器集群性能的关键。本文基于随机高级Petri网(SHLPN)模型提出了动态反馈请求负载分配算法和加权队列选择的综合均衡调度方案。根据集群中各服务器实体的实时负载状况动态分配请求并结合请求权值实施服务,提高了系统的负载均衡能力。     

基于退火算法的动态负载均衡研究

分析现有服务器集群的动态负载平衡算法的特点和劣势,结合模拟退火算法和动态加权轮询算法的优势,提出一种动态负载平衡模型和解决方法。该模型使用模拟退火算法,自适应并且精确地确定性能权重向量,利用动态加权轮询算法,实时计算应用服务器负载,动态分配请求。通过该方法可以获得更合理的性能权重向量,有效地分配服务器负载,充分地利用服务器计算能力。实验结果表明,在负载逐渐提高的情况下,该算法保持了良好的平均响应时间和吞吐量,并且优于对比算法。     

二叉树动态负载平衡方法

文中提出了一种二叉树动态负载平衡方法，该方法使用二叉树动态负载平衡系统模型，解决了集中式负载平衡系统中主结点在分配任务、响应请求以及负载移动时的潜在瓶颈问题；提出了负载小于给定值时请求负载平衡以提高处理器的利用率。分析表明，该方法在可以有效地提高并行计算的性能，特别是对于任务密集的情况。     

一种基于中间件的自适应动态负载平衡方法

负载平衡是提高分布式系统性能不可缺少的技术,同时也是系统高可用性、可扩展性、容错性的必然要求。该文在分析和研究负载平衡模型的基础上,提出了一种基于消息队列的负载平衡模型,并在此模型下改进了基于阈值的动态负载平衡算法,给出了一种自适应的动态负载平衡算法。最后,在J2EE平台下,进行了实验和性能比较。     

Dynamic cluster resource allocations for jobs with known andunknown memory demands

The cluster system we consider for load sharing is a compute farm which is a pool of networked server nodes providing high-performance computing for CPU-intensive, memory-intensive, and I/O active jobs in a batch mode. Existing resource management systems mainly target at balancing the usage of CPU loads among server nodes. With the rapid advancement of CPU chips, memory and disk access speed improvements significantly lag behind advancement of CPU speed, increasing the penalty for data movement, such as page faults and I/O operations, relative to normal CPU operations. Aiming at reducing the memory resource contention caused by page faults and I/O activities, we have developed and examined load sharing policies by considering effective usage of global memory in addition to CPU load balancing in clusters. We study two types of application workloads: 1) Memory demands are known in advance or are predictable and 2) memory demands are unknown and dynamically changed during execution. Besides using workload traces with known memory demands, we have also made kernel instrumentation to collect different types of workload execution traces to capture dynamic memory access patterns. Conducting different groups of trace-driven simulations, we show that our proposed policies can effectively improve overall job execution performance by well utilizing both CPU and memory resources with known and unknown memory demands     

一种基于透明计算的动态负载平衡算法

服务器集群在透明计算新模式中的引入，需要多种资源(CPU、内存和I/O等)有效共享。针对传统负载平衡算法考虑资源因素单一、难以满足需求的现状，该文提出一种基于透明计算的负载平衡算法(LBTC)，它充分考虑系统多种资源，并采用负载向量表征和协调。通过不同平均内存需求情况下、不同系统中、不同算法执行复杂任务时的平均减速比较，表明LBTC能以适当增加计算复杂度为代价有效实现资源共享，提高系统性能。     

A dynamic resource management in mobile agent by artificial neural network

In this paper, a resource management for dynamic load balancing in mobile agent by artificial neural network scheme (ANN-DLB) is presented to maximize the number of the served tasks in developing high performance cluster. This dynamic load balance with the growth of the service type and user number in the mobile networks of the higher performance is required in service provision and throughput. Most of the conventional policies are used in load indices with the threshold value to decide the load status of the agent hosts by CPU or memory. The main factor influencing the workload is the competitions among the computing resources such as CPU, memory, I/O and network. There are certain I/O data of the intensive applications where load balancing becomes the important issue. This relationship between the computing resources is very complex to define the rules for deciding the workload. This paper proposed a new dynamic load balancing for evaluating the agent hosts’ workload with the artificial neural network (ANN). By applying the automatic learning of the back-propagation network (BPN) model can establish the ANN model and also can measure the agent host loading with five inputs: CPU, memory, I/O, network and run-queue length. The structure of the load balancing system is composed of three design agents: the load index agent (LIA), the resource management agent (RMA) and the load transfer agent (LTA). These experimental results reveal that the proposed ANN-DLB yields better performance than the other methods. These results demonstrate that the proposed method has high throughput, short response time and turnaround time, and less agent host negotiation complexity and migrating tasks than the previous methods.     

Load Balancing Parallel Explicit State Model Checking

This paper first identifies some of the key concerns about the techniques and algorithms developed for parallel model checking; specifically, the inherent problem with load balancing and large queue sizes resultant in a static partition algorithm. This paper then presents a load balancing algorithm to improve the run time performance in distributed model checking, reduce maximum queue size, and reduce the number of states expanded before error discovery. The load balancing algorithm is based on generalized dimension exchange (GDE). This paper presents an empirical analysis of the GDE based load balancing algorithm on three different supercomputing architectures—distributed memory clusters, Networks of Workstations (NOW) and shared memory machines. The analysis shows increased speedup, lower maximum queue sizes and fewer total states explored before error discovery on each of the architectures. Finally, this paper presents a study of the communication overhead incurred by using the load balancing algorithm, which although significant, does not offset performance gains.     

网络并行计算的动态负载平衡策略

本文主要概述动态负载平衡的概念和主要算法。     

互连网络局部迭代负载平衡技术

新的基于网络的计算模式（如网格计算,云计算,P2P计算）的共同特点是计算节点之间都是通过互连网络进行通信。对互连网络各个计算节点产生的工作负载进行平衡是提高计算系统性能的关键。文章介绍了近年来在互连网络上使用局部迭代方式求解负载平衡问题在算法设计及其性能分析反面的若干基本研究成果。     

TRINI: an adaptive load balancing strategy based on garbage collection for clustered Java systems

Nowadays, clustered environments are commonly used in high‐performance computing and enterprise‐level applications to achieve faster response time and higher throughput than single machine environments. Nevertheless, how to effectively manage the workloads in these clusters has become a new challenge. As a load balancer is typically used to distribute the workload among the cluster's nodes, multiple research efforts have concentrated on enhancing the capabilities of load balancers. Our previous work presented a novel adaptive load balancing strategy (TRINI) that improves the performance of a clustered Java system by avoiding the performance impacts of major garbage collection, which is an important cause of performance degradation in Java. The aim of this paper is to strengthen the validation of TRINI by extending its experimental evaluation in terms of generality, scalability and reliability. Our results have shown that TRINI can achieve significant performance improvements, as well as a consistent behaviour, when it is applied to a set of commonly used load balancing algorithms, demonstrating its generality. TRINI also proved to be scalable across different cluster sizes, as its performance improvements did not noticeably degrade when increasing the cluster size. Finally, TRINI exhibited reliable behaviour over extended time periods, introducing only a small overhead to the cluster in such conditions. These results offer practitioners a valuable reference regarding the benefits that a load balancing strategy, based on garbage collection, can bring to a clustered Java system. Copyright © 2016 John Wiley & Sons, Ltd.     

异构分层无线网络中基于业务和逗留时间的动态流量均衡算法

在异构分层无线网络中使用有效的流量均衡技术，可以给更多的移动用户提供服务。现有的流量均衡算法主要针对同种无线网络，因而不能直接用于异构无线网络。本文提出了一种适用于异构无线网络的基于业务和逗留时间的动态流量均衡算法，该算法首先根据移动模型计算移动用户在小区内的逗留时间，然后基于小区呼叫到达率和重叠覆盖小区的流量状态来确定一个周期内转移的非实时性呼叫数量，最后依据逗留时间门限值将重负载小区中满足条件的呼叫转移到轻负载的重叠覆盖小区中。为降低切换呼叫掉线率，还对异构网间的呼叫切换策略做了改进。仿真实验结果表明．本算法在新呼叫阻寒率和切换呼叫掉线率等性能指标上比传统方法有显著提高．