Parallel branch and bound on P2P systems

First International Conference on Complex, Intelligent and Software Intensive Systems, CISIS'07

Volumn , Issue , 2007, Pages 271-278

  Talbi, El Ghazali ^a   Bendjoudi, Ahcène ^b   Melab, Noredine ^a  

^a UNIV LILLE   (France)

^b UNIVERSITY OF BEJAIA   (Algeria)

Author keywords

Combinatorial optimization; Parallel branch and bound; Peer to peer computing; Permutation flow shop problem; ProActive

Indexed keywords

COMBINATORIAL OPTIMIZATION; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DISTRIBUTED COMPUTER SYSTEMS; PROBLEM SOLVING; PROGRAM PROCESSORS;

LARGE SCALE DISTRIBUTED SYSTEMS; MONOCRITERION PERMUTATION; PEER TO PEER COMPUTING;

PARALLEL PROCESSING SYSTEMS;

EID: 34547533496     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/CISIS.2007.45     Document Type: Conference Paper

References (28)

1. http://www-sop.inria.fr/oasis/ProActive. December 2006.
2. http://www.grid5000.org. December 2006.
3. K. Aida, Y. Futakata, and S. Hara. High-performance parallel and distributed computing for the bmi eigenvalue problem. In Proc. The 16th IEEE International Parallel and Distributed Processing Symposium, 2002.
4. K. Aida, W. Natsume, and Y. Futakata. Distributed Computing with Hierarchical Mast-Worker Paradigm for Parallel Branch-and-Bound Algorithm. IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2003), 2003.
5. K. Aida and T. Osumi. A case Study in Running a Parallel Branch and Bound Application on the Grid. IEEE International Symposium on Parallel Computing, 2004.
6. D. Anderson, J. Cobb, E. Corpela, M. Lepofsky, and D. Werthimer. SETI@Home: An Experiment in Public-Resource Computing. Communications of the ACM, Vol. 45(N. 11):56-61, November 2002.
7. L. Baduel, F. Baude, and D. Caromel. Efficient, flexible and typed group communication in java. Joint ACM Java Grande - ISCOPE Conference, pages 28-36, Seatlle, Washington, USA, ACM Press, ISBN 1-58113-559-8., November 2002.
8. B.Gendron and T. Crainic. Parallel Branch-and-Bound Algorithms: Survey and Synthesis. Operations Research, 42(06):1042-1066, 1994.
9. B. Bourbeaua, T. Crainica, and B. Gendron. Branch-and-bound parallelization strategies applied to a depot location and container fleet management problem. Elsevier, Parallel Computing(26):27-46, 2000.
10. D. Caromel, W. Klauser, and J. Vayssière. Towards seamless computing and metacomputing in Java, volume 10 of Wiley & Sons, Ltd, pages 1034-1061. In Geoffrey C. Fox, editor, Concurency Practice and Experience, September-November 1998.
11. G. Fedak, C. Germain, V. Néri, and F. Cappello. XtremWeb: A Generic Global Computing System. Proceedings of the first International Symposium on Cluster Computing and the Grid (CCGRID'01), IEEE, 2001.
12. I. Foster and C. Kesselman. The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, San Francisco, California, 1999.
13. M. Garey. NP-Commpleteness. 1979.
14. J. Goux, S. Kulkami, J. Linderoth, and M. Yoder. An enabling framework for master-worker applications on the computational grid. IEEE Symposium and High Performance. Distributed Computing (HPDC9), 9, 2000.
15. J.K.Lenstra, B.J.Lageweg, and A. Kan. A General boundind scheme for the permutation flow-shop problem. Operations Research, 26(1):53-67, 1978.
16. N. Melab. Contribution à la résolution des problèmes d'optimisation combinatoire sur grilles de calcul. Habilitation à Diriger les Recherches de l'USTL, November 2005.
17. M. Mezmaz, N. Melab, and E.-G. Talbi. A Grid-based Parallel Approach of the Multi-Objective Branch and. Bound. In Fifteen Euromicro Conference on Parallel, Distributed and Network-based Processing, Naples, Italy, February. 7-9 2007. IEEE Computer Society Press.
18. M. Mezmaz, N. Melab, and E.-G. Talbi. A Grid-enabled Branch and Bound Algorithm for Solving Challenging Combinatorial Optimization Problems. In Proc. of 21th IEEE Intl. Parallel and Distributed Processing Symposium, Long Beach, California, March 26th -30th 2007.
19. M. Mezmaz, N. Melab, and. E.-G. Talbi. Combining Metaheuristics and Exact. Methods for Solving Exactly Multi-Objective Problems on the Grid. Journal of Mathematical Modelling and Algorithms, Elsevier Science, To appear in 2007.
20. D. Milojicic, V. Kalogeraki, R. Lukose, K. Nagaraja, J. Pruyne, B. Richard, S. Rollins, Z. Xu, and. H. L. P. Alto. Peer-to-Peer Computing. Technical Report HPL-2002-57, HP, March 8th 2002.
21. L. Mitten. Branch-and-bound Methods: General formulation and properties. Operations Research 18, pages 24-34, 1970.
22. H. Nakada, S. Matsuoka, K. Seymour, J. Dongarra, C. Lee, and H. Casanova. GridRPC: A Remote Procedure Call API for Grid Computing. Edinburgh, Scotland, July 2002.
23. R. Schollmeier. A definition of Peer-to-Peer networking for the classification of Peer-to-Peer architectures and applications. IEEE, 2001 International Conference on Peer-to-Peer Computing (P2P2001), Linko pings Universitet, Sweden, august 2001.
24. E. Taillard. Benchmarks for basic scheduling problems. European Journal of Operations Research, 64:278-285, 1993.
25. Y. TANAKA, M. Sato, M. Hirano, H. Nakada, and S. Sekiguchi. Performance evaluation of firewall compliant, globus-based wide-area cluster system. IEEE Symposium on High-Perfonnace Distributed Computing (HPDC), 9, 2000.
26. H. Trienekens. Parallel Branch and Bound on an MIMD System. Erasmus University Rotterdam, 1989.
27. H. Trienekens and A. Bruin. Towards a Taxonomy of Parallel Branch and Bound Algorithms. Erasmus University, 1992.
28. M. Yang and C. Das. A Parallel Branch-and-Bound Algorithm for MIN-Based Multiprocessors. ACM, pages 222-223, 1991.