An efficient load balancing strategy for grid-based branch and bound algorithm

Parallel Computing

Volumn 33, Issue 4-5, 2007, Pages 302-313

  Mezmaz, M ^a   Melab, N ^a   Talbi, E G ^a  

^a UNIV LILLE   (France)

Author keywords

Branch and bound; Grid computing; Multi objective optimization

Indexed keywords

ALGORITHMS; COMPUTATIONAL METHODS; DYNAMIC LOADS; MULTIOBJECTIVE OPTIMIZATION; PROGRAM PROCESSORS; TREES (MATHEMATICS);

PARALLEL MODELS; SCHEDULING PROBLEMS; TREE NODES;

GRID COMPUTING;

EID: 34247131264     PISSN: 01678191     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.parco.2007.02.004     Document Type: Article

References (12)

1. K. Aida, Y. Futakata. High-performance parallel and distributed computing for the BMIeigenvalue problem, in: Parallel and Distributed Processing Symposium, Proceedings International, IPDPS 2002, Abstracts and CD-ROM, 2002, pp. 71-78.
2. K. Aida, T. Osumi. A case study in running a parallel branch and bound application on the grid, in: Proceedings. The 2005 Symposium on Applications and the Internet, 2005, pp. 164-173.
3. Anstreicher K., Brixius N., Goux J.P., and Linderoth J. Solving large quadratic assignment problems on computational grids. Mathematical Programming 91 3 (2002) 563-588
4. Gelenter D., and Crainic T.G. Parallel branch and bound algorithms: survey and synthesis. Operation Research 2 (1994) 1042-1066
5. Taillard E. Banchmarks for basic scheduling problems. European Journal of European Research 23 (1993) 661-673
6. Johnson D.S., Garey M.R., and Sethi R. The complexity of flow-shop and job-shop scheduling. Mathematics of Operations Research 1 (1976) 117-129
7. A. Iamnitchi, I. Foster. A problem-specific fault-tolerance mechanism for asynchronous, distributed Systems, in: 29th International Conference on Parallel Processing (ICPP), Toronto, Canada, August, 2000, pp. 21-24.
8. Du J., and Leung J.Y.-T. Minimizing total tardiness on one machine is NP-hard. Mathematics of Operations Research 15 (1990) 483-495
9. N. Melab. Contributions à la résolution de problèmes d'optimisation combinatoire sur grilles de calcul, HDR thesis, LIFL, USTL, Novembre 2005.
10. Y. Tanaka, M. Sato, M. Hirano, H. Nakada, S. Sekiguchi. Performance evaluation of a firewall-compliant Globus-based wide-area cluster system, in: Proceedings. The Ninth International Symposium on High-Performance Distributed Computing, 2000, pp. 121-128.
11. T'kindt V., and Billaut J.-C. Multicriteria Scheduling - Theory Models, and Algorithms (2002), Springer Verlag
12. H. Trienekens, A. de Bruin, Towards a taxonomy of parallel branch and bound algorithms. Report EUR-CS-92-01, Department of Computer Science, Erasmus University Rotterdam, 1992.