The Gradient Model Load Balancing Method
IEEE Transactions on Software Engineering - Special issue on distributed systems
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
IEEE Transactions on Computers
Efficient dispersal of information for security, load balancing, and fault tolerance
Journal of the ACM (JACM)
A randomized parallel branch-and-bound procedure
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Implementing functional programs on a hypercube multiprocessor
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
The token distribution problem
SIAM Journal on Computing
Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
Load balancing, selection sorting on the hypercube
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Dynamic tree embeddings in butterflies and hypercubes
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Counting networks and multi-processor coordination
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Optimal speedup for backtrack search on a butterfly network
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
A simple load balancing scheme for task allocation in parallel machines
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Performance of dynamic load balancing algorithms for unstructured mesh calculations
Concurrency: Practice and Experience
STOC '92 Proceedings of the twenty-fourth annual ACM symposium on Theory of computing
Low contention load balancing on large-scale multiprocessors
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
A dynamic distributed load balancing algorithm with provable good performance
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Approximate load balancing on dynamic and asynchronous networks
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
A Parabolic Theory of Load Balance
A Parabolic Theory of Load Balance
Tight analyses of two local load balancing algorithms
STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Efficient load balancing and data remapping for adaptive grid calculations
Proceedings of the ninth annual ACM symposium on Parallel algorithms and architectures
Adaptive packet routing for bursty adversarial traffic
STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing
An adversarial model for distributed dynamic load balancing
Proceedings of the tenth annual ACM symposium on Parallel algorithms and architectures
Global load balancing with parallel mesh adaption on distributed-memory systems
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Improving the scalability of the CORBA event service with a multi-agent load balancing algorithm
Software—Practice & Experience
Load balancing for unstructured mesh applications
Progress in computer research
Distributing Tokens on a Hypercube without Error Accumulation
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
A peer-to-peer meta-scheduler for service-oriented grid environments
Proceedings of the first international conference on Networks for grid applications
A new analytical method for parallel, diffusion-type load balancing
Journal of Parallel and Distributed Computing
Atomic Congestion Games: Fast, Myopic and Concurrent
SAGT '08 Proceedings of the 1st International Symposium on Algorithmic Game Theory
Myopic distributed protocols for singleton and independent-resource congestion games
WEA'08 Proceedings of the 7th international conference on Experimental algorithms
A new analytical method for parallel, diffusion-type load balancing
IPDPS'06 Proceedings of the 20th international conference on Parallel and distributed processing
Coordinating learning agents for multiple resource job scheduling
ALA'09 Proceedings of the Second international conference on Adaptive and Learning Agents
Anonymous card shuffling and its applications to parallel mixnets
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
The fundamental problems in dynamic load balancing and job scheduling in parallel and distributed computers involve moving load between processors. In this paper, we consider a new model for load movement in synchronous parallel and distributed machines. In each step of our model, each processor can transfer load to at most one neighbor; also, any amount of load can be moved along a communication link between two processors in one step. This is a reasonable model for load movement in significant classes of dynamic load balancing problems.We derive efficient algorithms for a number of task reallocation problems under our model of load movement. These include dynamic load balancing on processor networks, adaptive mesh re-partitioning such as those in finite element methods, and progressive job migration under dynamic generation and consumption of load.To obtain the above-mentioned results, we introduce and solve the abstract problem of Incremental Weight Migration (IWM) on arbitrary graphs. Our main result is a simple, randomized, algorithm for this problem which provably results in asymptotically optimal convergence towards the state where weights on the nodes of the graph are all equal. This algorithm utilizes an appropriate random set of edges forming a matching. Our algorithm for the IWM problem is used in deriving efficient algorithms for all the problems mentioned above.Our results are very general. The algorithms we derive are local, and hence, scalable. They work for arbitrary load distributions and for networks of arbitrary topology which can possibly undergo link failures. Of independent interest is our proof technique which we use to lower bound the convergence of our algorithms in terms of the eigenstructure of the underlying graph.Finally, we present preliminary experimental results analyzing issues in load balancing related to our algorithms.