Two phase algorithm for load balancing in heterogeneous distributed systems

Proceedings - Euromicro Conference on Parellel, Distribeted and Network-based Proceeding

Volumn , Issue , 2004, Pages 434-439

  Attiya, Gamal ^a   Hamam, Yskandar ^a  

^a ESIEE PARIS   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BRANCH-AND-BOUND (BB); CLUSTERING; LOAD BALANCING; SIMULATED ANNEALING (SA);

ALGORITHMS; COMPUTATIONAL COMPLEXITY; COMPUTER NETWORKS; COMPUTER WORKSTATIONS; GRAPH THEORY; HEURISTIC METHODS; LOCAL AREA NETWORKS; MATHEMATICAL MODELS; PARALLEL PROCESSING SYSTEMS; PROBLEM SOLVING; WIDE AREA NETWORKS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 3042621268     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/EMPDP.2004.1271476     Document Type: Conference Paper

References (16)

1. E. Aarts and J. Korst. Simulated Annealing and Boltzmann Machines. John Wiley and Sons, New York, 1989.
2. J. Aguilar and E. Gelenbe. Task assignment and transaction clustering heuristics for distributed systems. Information Sciences, 97(1-2):199-219, March 1997.
3. G. Attiya and Y. Hamam. Optimal allocation of tasks onto networked heterogeneous computers using minimax criterion. International Network Optimization Conference (INOC'03), Evry/Paris, France, 2003.
4. st IFIP TC 7 Conference on System Modeling and Optimization, Sophia Antipolis, Nice, France, July 2003.
5. C. A. Bohn and G. B. Lamont. Load balancing for heterogeneous clusters of pcs. Future Generation Computer Systems, 18(3):389-400, January 2002.
6. P. Bouvry, J. Chassin, M. Dobruck, L. Hluch, E. Luque, and T. Margalef. Mapping and load balancing on distributed memory systems. Proceedings of the Eight Symposium on Microcomputer and Microprocessor Applications, 1:315-324, 1994.
7. P. Bouvry, J. Chassin, and D. Trystram. Efficient solution for mapping parallel programs. Proceedings of EuroPar'95, 966 of LNCS:379-390, August 1995.
8. Y. Hamam and K. S. Hindi. Assignment of program modules to processors: A simulated annealing approach. European Journal of Operational Research, 122(2):509-513, April 2000.
9. C.-C. Hui and S. T. Chanson. Allocating task interaction graphs to processors in heterogeneous networks. IEEE Transactions on Parallel and Distributed Systems, 8(9):908-925, September 1997.
10. M. Kafil and I. Ahmad. Optimal task assignment in heterogeneous distributed computing systems. IEEE Concurrency, 6(3):42-51, July-September 1998.
11. S. Kirkpatrick, C. D. Gelatt, and J.M.P.Vecchi. Optimization by simulated annealing. Science, 220:671-680, May 1983.
12. Y.-C. Ma and C.-P. Chung. A dominance relation enhanced branch-and-bound task allocation. Journal of Systems and Software, 58(2):125-134, September 2001.
13. M. A. Senar, A. Ripoll, A. Corts, and E. Luque. Clustering and reassignment-based mapping strategy for message-passing architectures. Journal of Systems Architecture, 48(8-10):267-283, March 2003.
14. D. Sinclair. The gst load balancing algorithm for parallel and distributed systems. International Journal of Approximate Reasoning, 19(1-2):39-56, July-August 1998.
15. A. D. Stefano, L. L. Bello, and E. Tramontana. Factors affecting the design of load balancing algorithms in distributed systems. Journal of Systems and Software, 48(2):105-117, September 1999.
16. A. Tom and C. S. R. Murthy. Optimal task allocation in distributed systems by graph matching and state space search. Journal of Systems and Software, 46(1):59-75, April 1999.