二叉树动态负载平衡方法

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

基于集群的VOD系统的动态负载平衡模型

基于多服务器集群的VOD系统能以低成本高性能满足日益增长点播需求,服务器调度和动态负载平衡是实现的关键。本文从校园网VOD用户点播行为特点出发,引入动态负载平衡模型(LBM,Load Balancing Model),清晰地表达了各因素逻辑关系。实验主要对独立性强、任务执行时间不确定的任务,在Linux集群环境下,实现了动态负载平衡模型。实验表明该策略可取得较高负载平衡效率。     

网络入侵检测系统中动态负载平衡策略的设计

随着互联网的广泛应用,网络信息量迅猛增长,网络攻击数量和方式大大增加,网络入侵检测系统需要部署多个感知器(Sensor)时网络监测和保护,通过增加Sensor,可以增强系统分析检测能力。然而,为了充分利用系统处理能力,需要动态分配处理节点任务,实现动态负载平衡。该文在分析网络入侵检测系统的基础上,提出负载值计算方法,结合通用负载平衡策略,提出了分布式入侵检测系统的动态负载平衡策略,实现了良好的动态负载平衡效果,提高了系统性能。     

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

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

调度服务在虚拟试验系统中的研究与应用

为了提高虚拟试验系统的执行效率,保证系统负载平衡,提高系统的实时性和可靠性,研究并设计了一种实时任务调度服务;该调度服务以节点任务调度算法和迁移策略为基础,提供了一种动态的、可靠的任务分配策略和负载均衡机制,使虚拟试验的任务得到了合理分配和调度;以节点容纳度作为试验参数进行多次试验,试验结果表明:该调度服务在虚拟试验系统中能够动态维持各个节点的负载平衡,降低了任务平均响应时间,提高系统的实时性和可靠性,达到了提高虚拟试验系统整体性能的目的。     

基于并行构件的动态负载池平衡技术的研究

在基于并行构件的系统中，负载平衡技术是充分利用系统资源，提高系统性能的关键技术。该文提出了一种基于并行构件的动态负载池平衡技术，与已有的负载平衡策略不同，该技术综合考虑了通信延迟、容错技术以及数据一致性对负载平衡策略的影响，旨在提高策略的准确性、高效性和健壮性，增强运行时系统的性能。     

一种MPI并行程序设计中的动态负载平衡策略

介绍了MPI并行编程环境和MPI并行程序设计的特点,讨论了在MPI并行程序设计中实现动态负载平衡的方法,提出一种根据计算节点的计算能力和实时负载情况进行任务迁移的动态负载平衡策略。     

基于M/M/1模型的多用户分布式系统负载平衡

针对分布式系统负载平衡问题,对动态全局最优策略进行改进,结合静态全局最优策略,提出动静结合的负载平衡策略。策略克服在较高通信开销时动态负载平衡策略的缺点,有效提高分布式系统的综合性能。仿真结果表明,使用该策略在通信开销较高和系统负载率大于40%的情况下,能够获得比动态负载平衡更小的系统预期响应时间。     

工作站机群中一种有效的并行体绘制策略

基于脚印体绘制方法，结合工作站机群和体数据的特性，提出了任务池组／图象组动态负载平衡策略和Ｓｕｐｅｒｖｉｓｏｒ－Ｗｏｒｋｅｒ－Ｃｏｌｌｅｃｔｏｒ结构的并行体绘制方法。理论分析和实验结果表明：本文提出的动态负载平衡策略和并行绘制方法，提高了体绘制的并行效率。     

基于．NET Remoting的动态负载平衡模型

在对.NET Remoting技术和传统的分布式负载平衡算法深入研究的基础上,提出一种排序队列和哈希映射矩阵相结合的负载平衡策略,给出一个分布式环境下的动态负载平衡模型。一方面可提高系统吞吐量,另一方面可缩短任务请求的响应时间。模型采用模块化设计方法,使其具有部署灵活性和容错性,并应用滑动窗口机制提高模型的负载平衡指标可信度。     

Strategy and Simulation of Adaptive RID for Distributed Dynamic Load Balancing in Parallel Systems

Dynamic load balancing schemes are significant for efficiently executing nonuniform problems in highly parallel multicomputer systems.The objective is to minimize the total exectuion time of single applications.This paper has proposed an ARID strategy for distributed dynamic load balancing.Its principle and control protocol are described,and te communication overhead,the effect on system stability and the performance efficiency are analyzed.Finally,simulation experiments are carried out to compare the adaptive strategy with other dynamic load balancing schemes.     

集群动态负载平衡系统的性能评价

该文使用随机Petri网对集群动态负载平衡系统建立了一个抽象模型．通过细化模型中的节点本地处理部分对5种动态负载平衡算法的性能进行了分析，并讨论了集群负载特性对动态负载平衡系统性能的影响，最后得出的主要结论有：(1)动态负载平衡算法可以取得比静态负载平衡算法更好的性能；(2)与传统的只考虑CPU就绪队列的负载平衡算法相比，考虑了各种I／O请求队列的负载平衡算法可以取得更好的性能；(3)即使在极端的集群负载特性中。集群动态负载平衡算法仍然能取得比较理想的性能，因此实现即使是十分简单的集群动态负载平衡系统也是很有必要的。     

Customized Dynamic Load Balancing for a Network of Workstations

Load balancing involves assigning to each processor work proportional to its performance, thereby minimizing the execution time of a program. Although static load balancing can solve many problems (e.g., those caused by processor heterogeneity and nonuniform loops) for most regular applications, the transient external load due to multiple users on a network of workstations necessitates a dynamic approach to load balancing. In this paper we show that different load balancing schemes are best for different applications under varying program and system parameters. Therefore, application-driven customized dynamic load balancing becomes essential for good performance. We present a hybrid compile-time and run-time modeling and decision process which selects (customizes) the best scheme, along with automatic generation of parallel code with calls to a run-time library for load balancing.     

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

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

Game-theoretic static load balancing for distributed systems

In this paper, we present a game theoretic approach to solve the static load balancing problem for single-class and multi-class (multi-user) jobs in a distributed system where the computers are connected by a communication network. The objective of our approach is to provide fairness to all the jobs (in a single-class system) and the users of the jobs (in a multi-user system). To provide fairness to all the jobs in the system, we use a cooperative game to model the load balancing problem. Our solution is based on the Nash Bargaining Solution (NBS) which provides a Pareto optimal solution for the distributed system and is also a fair solution. An algorithm for computing the NBS is derived for the proposed cooperative load balancing game. To provide fairness to all the users in the system, the load balancing problem is formulated as a non-cooperative game among the users who try to minimize the expected response time of their own jobs. We use the concept of Nash equilibrium as the solution of our non-cooperative game and derive a distributed algorithm for computing it. Our schemes are compared with other existing schemes using simulations with various system loads and configurations. We show that our schemes perform near the system optimal schemes and are superior to the other schemes in terms of fairness.     

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

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

Adaptive Task Pools: Efficiently Balancing Large Number of Tasks on Shared-address Spaces

Task based approaches with dynamic load balancing are well suited to exploit parallelism in irregular applications. For such applications, the execution time of tasks can often not be predicted due to input dependencies. Therefore, a static task assignment to execution resources usually does not lead to the best performance. Moreover, a dynamic load balancing is also beneficial for heterogeneous execution environments. In this article a new adaptive data structure is proposed for storing and balancing a large number of tasks, allowing an efficient and flexible task management. Dynamically adjusted blocks of tasks can be moved between execution resources, enabling an efficient load balancing with low overhead, which is independent of the actual number of tasks stored. We have integrated the new approach into a runtime system for the execution of task-based applications for shared address spaces. Runtime experiments with several irregular applications with different execution schemes show that the new adaptive runtime system leads to good performance also in such situations where other approaches fail to achieve comparable results.     

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

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

LBBSRT: An efficient SDN load balancing scheme based on server response time

The response time is the most important factor determining user experiences in the service provision model involving server clusters. However, traditional server cluster load balancing scheme are limited by the hardware conditions, and cannot completely exploit the server response times for load balancing. In order to effectively resolve the traditional load balancing schemes, we propose a load balancing scheme based on server response times by using the advantage of SDN flexibility, named LBBSRT. Using the real-time response time of each server measured by the controller for load balancing, we process user requests by obtaining an evenly balanced server loads. Simulation experiments show that our scheme exhibits a better load balancing effect and process requests with a minimum average server response times. In addition, our scheme is easy to implement, and exhibits good scalability and low cost characteristics.     

动态负载均衡算法在校园网格中的应用

校园网格能有效消除信息孤岛,实现我国高校的计算资源和信息资源的有效共享。一个亟待解决的问题是在校园网格环境下,服务器节点响应能力低下。目前已提出多种技术与方案以解决并提高校园网格的服务器节点的响应能力,负载均衡技术就是一种全新的技术。本文根据校园网格的特点和影响负载均衡的因素,对基于校园网格的负载均衡技术进行了分析和探讨,并提出一种动态负载均衡算法。