共查询到20条相似文献,搜索用时 31 毫秒
1.
We give a general model of partially asynchronous, distributed load-balancing algorithms for the discrete load model in parallel
computers, where the processor loads are treated as non-negative integers. We prove that all load-balancing algorithms in
this model are finite. This means that all load-balancing algorithms based on this model are guaranteed to reach a stable
situation at a certain time (which depends on the particular algorithm) at which no load will be sent from one processor to
another. With an additional assumption, we prove that the largest load difference between any two processors, in the final
stable situation of the load-balancing algorithms in this model, is upper-bounded by the diameter of the topology. 相似文献
2.
Load balancing a distributed/parallel system consists in allocating work (load) to its processors so that they have to process
approximately the same amount of work or amounts in relation with their computation power. In this paper, we present a new
distributed algorithm that implements the Most to Least Loaded (M2LL) policy. This policy aims at indicating pairs of processors, that will exchange loads, taking into account actually broken
edges as well as the current load distribution in the system. The M2LL policy fixes the pairs of neighboring processors by
selecting in priority the most loaded and the least loaded processor of each neighborhood. Our first and main result is that
the M2LL distributed implementation terminates after at most (n/2)⋅d
t
iterations where n and d
t
are respectively the number of nodes and the degree of the system at time t. We then present a performance comparison between Generalized Adaptive Exchange (GAE) that uses M2LL and Relaxed First Order Scheme (RFOS), two load balancing algorithms for dynamic networks in which only link failures are considered. The comparison is carried
out on a dedicated test bed that we have designed and implemented to this end. Our second important result is that although
generating more communications, the GAE algorithm with the M2LL policy is faster than RFOS in balancing the system load. In
addition, GAE M2LL is able to achieve a more stable balanced state than RFOS and scales well. 相似文献
3.
Dongliang Zhang Changjun Jiang Shu Li 《Simulation Modelling Practice and Theory》2009,17(6):1032-1042
Balancing the work load can improve the performance of distributed simulation systems. In this paper we propose a fast adaptive balancing method, in which a binary tree structure is used to partition the simulation region into sub-domains. From a global view to local views, we balance the loads between sub-domains recursively by compressing and stretching sub-domains in group. This method can adjust the sub-domains with heavy loads and decompose their loads very fast. Then we compare the algorithm with two previously proposed algorithms by an artificial case and a real distributed case respectively. In both cases, our method can get a faster convergence speed and a lower communication overhead. 相似文献
4.
The objective of the study was to achieve balanced load among processors, reduce the communication overhead of the load balancing algorithm, and improve respource utilization, which results in better average resonse time. A communication protocol and a fully distributed algorithm for dynamic load balancing through task migration in a connected N -processor network are presented. Each processor communicates its load directly with only a subset (of the size √ N ) of processors, reducing communication traffic and average response time. It is proved that the given algorithm will perform task migration even if there is only one light load processor and one heavy load processor in the system. Simulation results show that the proposed scheme can save up to 60% of the protocol messages used by the broadcast algorithms and can reduce the average response time 相似文献
5.
In this work, a practical implementation of two parallel thinning algorithms on a multicomputer system are described. The solution has been conceived for a multiprocessor using the SPMD (single program multiple data) programming model. Our main goal is intended to describe our experiences on data partition/distribution among processors for parallel thinning algorithms as a representative type of algorithm where communications take place between neighbor processors and the work load for each processor depends on the input data. It will be shown how the efficiency of the parallel implementation can be improved through the application of a preprocess. This preprocess is based on the analysis of the work load balance. An analysis of the communication cost is also made. Although the results shown here are concerned with the implementations of two parallel thinning algorithms we think that our proposal about data distribution is general and useful for a wide set of algorithms in the field of image processing. Copyright © 2000 John Wiley & Sons, Ltd. 相似文献
6.
Shah R. Veeravalli B. Misra M. 《Parallel and Distributed Systems, IEEE Transactions on》2007,18(12):1675-1686
In this paper, we address several issues that are imperative to grid environments such as handling resource heterogeneity and sharing, communication latency, job migration from one site to other, and load balancing. We address these issues by proposing two job migration algorithms, which are MELISA (modified ELISA) and LBA (load balancing on arrival). The algorithms differ in the way load balancing is carried out and is shown to be efficient in minimizing the response time on large and small-scale heterogeneous grid environments, respectively. MELISA, which is applicable to large-scale systems (that is, interGrid), is a modified version of ELISA in which we consider the job migration cost, resource heterogeneity, and network heterogeneity when load balancing is considered. The LBA algorithm, which is applicable to small-scale systems (that is, intraGrid), performs load balancing by estimating the expected finish time of a job on buddy processors on each job arrival. Both algorithms estimate system parameters such as the job arrival rate, CPU processing rate, and load on the processor and balance the load by migrating jobs to buddy processors by taking into account the job transfer cost, resource heterogeneity, and network heterogeneity. We quantify the performance of our algorithms using several influencing parameters such as the job size, data transfer rate, status exchange period, and migration limit, and we discuss the implications of the performance and choice of our approaches. 相似文献
7.
8.
异构系统中负载平衡扩散算法的加速方法 总被引:2,自引:0,他引:2
目前,很多单位与组织都有连接着数百台工作站和微机的局域网,并将它们作为一个机群系统使用.在这样的异构系统上动态负载平衡是提高性能的一个重要方法.扩散方法是同构系统的动态负载平衡算法.将散算法扩展到异构系统中,对异构系统中速度不同的处理机的位置与扩散收敛速度的关系进行了研究,提出了加速扩散算法的收敛速度的优化方法.初步实验证明,该方法能通过合理安排处理机,加快扩散算法的速度. 相似文献
9.
The paper concerns parallel methods for extremal optimization (EO) applied in processor load balancing in execution of distributed programs. In these methods EO algorithms detect an optimized strategy of tasks migration leading to reduction of program execution time. We use an improved EO algorithm with guided state changes (EO-GS) that provides parallel search for next solution state during solution improvement based on some knowledge of the problem. The search is based on two-step stochastic selection using two fitness functions which account for computation and communication assessment of migration targets. Based on the improved EO-GS approach we propose and evaluate several versions of the parallelization methods of EO algorithms in the context of processor load balancing. Some of them use the crossover operation known in genetic algorithms. The quality of the proposed algorithms is evaluated by experiments with simulated load balancing in execution of distributed programs represented as macro data flow graphs. Load balancing based on so parallelized improved EO provides better convergence of the algorithm, smaller number of task migrations to be done and reduced execution time of applications. 相似文献
10.
On runtime parallel scheduling for processor load balancing 总被引:3,自引:0,他引:3
Min-You Wu 《Parallel and Distributed Systems, IEEE Transactions on》1997,8(2):173-186
Parallel scheduling is a new approach for load balancing. In parallel scheduling, all processors cooperate to schedule work. Parallel scheduling is able to accurately balance the load by using global load information at compile-time or runtime. It provides high-quality load balancing. This paper presents an overview of the parallel scheduling technique. Scheduling algorithms for tree, hypercube, and mesh networks are presented. These algorithms can fully balance the load and maximize locality at runtime. Communication costs are significantly reduced compared to other existing algorithms 相似文献
11.
Ghada F. El Kabbany Nayer M. Wanas Nadia H. Hegazi Samir I. Shaheen 《International journal of parallel programming》2011,39(2):143-182
Load balancing algorithms are designed essentially to equally distribute the load on processors and maximize their utilities
while minimizing the total task execution time. In order to achieve these goals, the load-balancing mechanism should be “fair”
in distributing the load across the different processors. This implies that the difference between the heaviest-loaded and
the lightest-loaded processors should be minimized. Therefore, the load information on each processor must be updated such
that the load-balancing mechanism can be more effective. In this work, we present an application independent dynamic algorithm
for scheduling tasks and load- balancing in message passing systems. We propose a DAG-based Dynamic Load Balancing algorithm
for Real time applications (DAG-DLBR) that is designed to work dynamically to cope with possible changes in the load that
might occur during runtime. This algorithm addresses the challenge of devising a load balancing scheme which judicially deals
with the hybrid execution of existing real-time application (represented by a Direct Acyclic Graph (DAG)) together with newly
arriving jobs. The main objective of this algorithm is to reduce response times of the newly arriving jobs while maintaining
the time constrains of the existing DAG. To evaluate the performance of the DAG-DLBR algorithm, a comparison with the performance
of two common dynamic load balancing algorithms is presented. This comparison is performed by evaluating, experimentally,
the execution time of different load balancing algorithms on a homogenous real parallel machine. In addition, the values of
load imbalance, the execution time, and the communication overhead time are evaluated analytically using different benchmarks
as test-bed workloads. These workloads cover a wide range of dynamic applications with different task types. Experimental
results illustrate the improved performance of the DAG-DLBR algorithm compared to both distributed and hierarchal based algorithms
by at least 12 and 19%, respectively. This improvement is true for all workloads, even with highly dependent workload. The
DAG-DLBR algorithm achieves lower computation time than its corresponding values of both the distributed and the hierarchical-based
algorithms for 4, 8, 12 and 16 processors. 相似文献
12.
《IEEE transactions on pattern analysis and machine intelligence》1985,(5):491-496
A loosely coupled multiprocessor system contains multiple processors which have their own local memories. To balance the load among multiple processors is of fundamental importance in enhancing the performance of such a multiple processor system. Probabilistic load balancing in a heterogeneous multiple processor system with many job classes is considered in this study. The load balancing scheme is formulated as a nonlinear programming problem with linear constraints. An optimal probabilistic load balancing algorithm is proposed to solve this nonlinear programming problem. The proposed load balancing method is proven globally optimum in the sense that it results in a minimum overall average job response time on a probabilistic basis. 相似文献
13.
The paper describes methods for using Extremal Optimization (EO) for processor load balancing during execution of distributed applications. A load balancing algorithm for clusters of multicore processors is presented and discussed. In this algorithm the EO approach is used to periodically detect the best tasks as candidates for migration and for a guided selection of the best computing nodes to receive the migrating tasks. To decrease the complexity of selection for migration, the embedded EO algorithm assumes a two-step stochastic selection during the solution improvement based on two separate fitness functions. The functions are based on specific models which estimate relations between the programs and the executive hardware. The proposed load balancing algorithm is assessed by experiments with simulated load balancing of distributed program graphs. The algorithm is compared against a greedy fully deterministic approach, a genetic algorithm and an EO-based algorithm with random placement of migrated tasks. 相似文献
14.
Hamidzadeh B. Lau Ying Kit Lilja D.J. 《Parallel and Distributed Systems, IEEE Transactions on》2000,11(11):1151-1163
Algorithms for scheduling independent tasks on to the processors of a multiprocessor system must trade-off processor load balance, memory locality, and scheduling overhead. Most existing algorithms, however, do not adequately balance these conflicting factors. This paper introduces the self-adjusting dynamic scheduling (SADS) class of algorithms that use a unified cost model to explicitly account for these factors at runtime. A dedicated processor performs scheduling in phases by maintaining a tree of partial schedules and incrementally assigning tasks to the least-cost schedule. A scheduling phase terminates whenever any processor becomes idle, at which time partial schedules are distributed to the processors. An extension of the basic SADS algorithm, called DBSADS, controls the scheduling overhead by giving higher priority to partial schedules with more task-to-processor assignments. These algorithms are compared to two distributed scheduling algorithms within a database application on an Intel Paragon distributed memory multiprocessor system. 相似文献
15.
Didier Y. Hinz 《Acta Informatica》1992,29(1):63-94
We discuss a simple run-time load balancing strategy which applies to numerical applications working on planar domains with localized data dependency. We develop an iterative and adaptive partitioner, able to work in a distributed way among the processors of a parallel system. Our algorithm subdivides data space into general quadrilaterals, where each processor works on the data of one area. The topology of these domains is that of a rectangular grid and does not change during execution. In this way a very simple and efficient communication structure is given. The administration overhead due to irregular geometry is small. Also, the overhead caused by periodically read-justing load balance is rather small because of the adaptivity and parallelity of the partitioning algorithm. We ran an scientific application to compare our method with a method working by recursive bisection, and obtained satisfactory results. 相似文献
16.
Parallelizing the Data Cube 总被引:1,自引:0,他引:1
Frank Dehne Todd Eavis Susanne Hambrusch Andrew Rau-Chaplin 《Distributed and Parallel Databases》2002,11(2):181-201
This paper presents a general methodology for the efficient parallelization of existing data cube construction algorithms. We describe two different partitioning strategies, one for top-down and one for bottom-up cube algorithms. Both partitioning strategies assign subcubes to individual processors in such a way that the loads assigned to the processors are balanced. Our methods reduce inter processor communication overhead by partitioning the load in advance instead of computing each individual group-by in parallel. Our partitioning strategies create a small number of coarse tasks. This allows for sharing of prefixes and sort orders between different group-by computations. Our methods enable code reuse by permitting the use of existing sequential (external memory) data cube algorithms for the subcube computations on each processor. This supports the transfer of optimized sequential data cube code to a parallel setting.The bottom-up partitioning strategy balances the number of single attribute external memory sorts made by each processor. The top-down strategy partitions a weighted tree in which weights reflect algorithm specific cost measures like estimated group-by sizes. Both partitioning approaches can be implemented on any shared disk type parallel machine composed of p processors connected via an interconnection fabric and with access to a shared parallel disk array.We have implemented our parallel top-down data cube construction method in C++ with the MPI message passing library for communication and the LEDA library for the required graph algorithms. We tested our code on an eight processor cluster, using a variety of different data sets with a range of sizes, dimensions, density, and skew. Comparison tests were performed on a SunFire 6800. The tests show that our partitioning strategies generate a close to optimal load balance between processors. The actual run times observed show an optimal speedup of p. 相似文献
17.
Hydrodynamic load balancing 总被引:1,自引:0,他引:1
Chi-Chung Hui Chanson S.T. 《Parallel and Distributed Systems, IEEE Transactions on》1999,10(11):1118-1137
This paper presents a hydrodynamic framework to solving the dynamic load balancing problem in heterogeneous distributed systems. In this approach, each processor is viewed as a liquid cylinder where the cross-sectional area corresponds to the capacity of the processor, the communication links are modeled as liquid channels between the cylinders, the workload is represented by liquid, and the load balancing algorithm manages the flow of the liquid. It is proven that all algorithms under this framework converge geometrically to the state of equilibrium, in which the heights of the liquid columns are the same in all the cylinders. In this way, each processor obtains an amount of workload proportional to its capacity. A hydrodynamic algorithm is presented and its performance is evaluated. The algorithm is applied to solve several practical applications to demonstrate the applicability of the framework 相似文献
18.
Many solutions have been proposed to tackle the load balancing issue in DHT-based P2P systems. However, all these solutions either ignore the heterogeneity nature of the system, or reassign loads among nodes without considering proximity relationships, or both. In this paper, we present an efficient, proximity-aware load balancing scheme by using the concept of virtual servers. To the best of our knowledge, this is the first work to use proximity information in load balancing. In particular, our main contributions are: 1) relying on a self-organized, fully distributed k-ary tree structure constructed on top of a DHT, load balance is achieved by aligning those two skews in load distribution and node capacity inherent in P2P systems - that is, have higher capacity nodes carry more loads; 2) proximity information is used to guide virtual server reassignments such that virtual servers are reassigned and transferred between physically close heavily loaded nodes and lightly loaded nodes, thereby minimizing the load movement cost and allowing load balancing to perform efficiently; and 3) our simulations show that our proximity-aware load balancing scheme reduces the load movement cost by 11-65 percent for all the combinations of two representative network topologies, two node capacity profiles, and two load distributions of virtual servers. Moreover, we achieve virtual server reassignments in O(log N) time. 相似文献
19.
J. E. Boillat 《Concurrency and Computation》1990,2(4):289-313
We present a fully distributed dynamic load balancing algorithm for parallel MIMD architectures. The algorithm can be described as a system of identical parallel processes, each running on a processor of an arbitrary interconnected network of processors. We show that the algorithm can be interpreted as a Poisson (heath) equation in a graph. This equation is analysed using Markov chain techniques and is proved to converge in polynomial time resulting in a global load balance. We also discuss some important parallel architectures and interconnection schemes such as linear processor arrays, tori, hypercubes, etc. Finally we present two applications where the algorithm has been successfully embedded (process mapping and molecular dynamic simulation). 相似文献