Analysis of a graph coloring based distributed load balancing algorithm

Journal of Parallel and Distributed Computing

Volumn 10, Issue 2, 1990, Pages 160-166

  Hosseini, S H ^a   Litow, B ^a   Malkawi, M ^a   McPherson, J ^a   Vairavan, K ^a  

^a UNIVERSITY OF WISCONSIN MILWAUKEE   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER OPERATING SYSTEMS--DESIGN; MATHEMATICAL TECHNIQUES--GRAPH THEORY;

GRAPH COLORING ALGORITHMS; LOAD BALANCING ALGORITHMS;

COMPUTER SYSTEMS, DIGITAL;

EID: 0025505781     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/0743-7315(90)90025-K     Document Type: Article

References (22)

1. An efficient algorithm for coloring the edges of a graph with delta + 1 colors
2. Take a walk, grow a tree
3. On the second eigenvalue of random regular graphs
4. A formal model of distributed decision making and its application to distributed load balancing
5. Analysis of three dynamic distributed load balancing strategies with varying global information requirements
6. Dynamic load balacing for distributed memory multiprocessors
7. Adaptive load sharing in homogeneous distributed systems
8. Stability and time analysis of a distributed load balancing algorithm
9. System modeling and performance analysis of a distributed load balancing algorithm
10. Distributed algorithms for load balancing in very large homogeneous systems
11. The gradient model load balancing method
12. The probabilistic method yields deterministic parallel algorithms
13. Programming a hypercube multicomputer
14. A probabilistic approach to the load sharing problem in distributed systems
15. Simulation of three adaptive, decentralized controlled job scheduling algorithms
16. An adaptive bidding algorithm for processes, clusters and distributed groups
17. A performance study of dynamic load balancing in distributed systems
18. On the stability of asynchronous iterative processes
19. A measurement study of load balancing performance