MW: A Software Framework for Combinatorial Optimization on Computational Grids

Parallel Combinatorial Optimization

Volumn , Issue , 2006, Pages 239-261

  Glankwamdee, Wasu ^a   Linderoth, Jeff ^a  

^a Lehigh University   (United States)

Author keywords

Combinatorial optimization on computational grids; Knapsack computation by Condor glide in mechanism; Master worker based parallel algorithms on computational grids

Indexed keywords

EID: 68749086700     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1002/9780470053928.ch10     Document Type: Chapter

References (27)

1. J.D.C. Little, K.G. Murty, D.W. Sweeney, and C. Karel. An algorithm for the traveling salesman problem. Oper. Res., 21:972-989 (1963).
2. B. Gendron and T.G. Crainic. Parallel branch and bound algorithms: Survey and synthesis. Oper. Res., 42:1042-1066 (1994).
3. I. Foster and C. Kesselman. Computational grids. In I. Foster and C. Kesselman, ed., The Grid: Blueprint for a New Computing Infrastructure. Morgan Kaufmann, 1999, Chapt. 2. San Franciso, CA.
4. K. Anstreicher, N. Brixius, J.-P. Goux, and J.T. Linderoth. Solving large quadratic assignment problems on computational grids. Math. Prog. Ser B, 91:563-588 (2002).
5. Setihome: Search for extraterrestrial intelligence at home. Available at http://setiathome.ssl.berkeley.edu.
6. M. Livny, J. Basney, R. Raman, and T. Tannenbaum. Mechanisms for high throughput computing. SPEEDUP, 11 (1997).
7. D.H.J. Epema, M. Livny, R. van Dantzig, X. Evers, and J. Pruyne. A worldwide flock of condors: Load sharing among workstation clusters. J. Fut. Gener. Comput. Systems, 12 (1996).
8. J. Frey, T. Tannenbaum, I. Foster, M. Livny, and S. Tuecke. Condor-G: A computation management agent for multi-institutional grids. Cluster Comput, 5:237-246 (2002).
9. K. Aida, W. Natsume, and Y. Futakata. Distributed computing with hierarchical master-worker paradigm for parallel branch and bound algorithm. Proceedings of the 3rd IEEE/ACM International Symposium on Cluster Computing and the Grid (CCGrid 2003), 2003, pp 156-163.
10. K. Aida and T. Osumi. A case study in running a parallel branch and bound application on the grid. Proceedings of the IEEE/IPSJ: The 2005 Symposium on Applications & the Internet (SAINT2005), 2005, pp. 164-173.
11. Y. Tanaka, M. Hirano, M. Sato, H. Nakada, and S. Sekiguchi. Performance evaluation of a firewall-compliant globus-based wide-area cluster system. 9th IEEE International Symposium on High Performance Distributed Computing (HPDC 2000), 2000, pp. 121-128.
12. I. Foster and C. Kesselman. Globus: A metacomputing infrastructure toolkit. Intl. J. Supercomput. App., 11:115-128 (1997).
13. Y. Xu, T.K. Ralphs, L. Ladányi, and M.J. Saltzman. ALPS: A framework for implementing parallel search algorithms. The Proceedings of the Ninth Conference of the INFORMS Computing Society, 2005. To appear, Available from http://www.lehigh.edu/~tkr2/research/pubs.html.
14. M. Benechouche et al. Building a parallel branch and bound library. Solving Combinatorial Optimization Problems in Parallel, Springer, Berlin, 1996.
15. J. Eckstein, C.A. Phillips, and W.E. Hart. PICO: An object-oriented framework for parallel branch-and-bound. Proceeding of the Inherently Parallel Algorithms in Feasibility and Optimization and Their Applications, 2001, pp. 219-265.
16. S. Tschöke and T. Polzer. Portable parallel branch and bound library user manual, library version 2.0. Technical report, Department of Computer Science, University of Paderborn, Paderborn, Germany, 1998.
17. A. Iamnitchi and I. Foster. A problem specific fault tolerance mechanism for asynchronous, distributed systems. In Proceedings of 2000 International Conference on Parallel Processing (29th ICPP'00). IEEE, 2000.
18. N. Alon, A. Barak, and U. Mander. On disseminating information reliably and without broadcasting. 7th Internaltional Conference on Distributed Computing Systems ICDCS97. IEEE Press, 1997. Baltimore, USA
19. L.M.A. Drummond et al. A grid-enabled branch-and-bound algorithm with application on the steiner problem in graphs. Unpublished Manuscript.
20. J.V. Filho, L.M.A. Drummond, E. Uchoa, and M.C.S. de Castro. Towards a grid enabled branch-and-bound algorithm. Available at http://www.optimizationonline.org/DB_HTML/2003/10/756.html.
21. G.B. Dantzig. Discrete variable extremum problems. Oper. Res., 5:266-277 (1957).
22. H. Greenberg and R.L. Hegerich. A branch search algorithm for the knapsack problem. Manag. Sci., 16 (1970).
23. E. Horowitz and S. Sahni. Computing partitions with applications to the knapsack problem. J. ACM, 21:277-292 (1974).
24. D. Pisinger and P. Toth. Knapsack problems. In D.Z. Du and P. Pardalos, eds., Handbook of Combinatorial Optimization, Kluwer, 1998, pp. 1-89. Boston, MA.
25. D. Pisinger. Where are the hard knapsack problems? Comput. Oper. Res., 32:2271-2284 (2005).
26. S. Martello and P. Toth. A new algorithm for the 0-1 knapsack problem. Manag. Sci., 34:633-644 (1988).
27. D. Pisinger. An expanding-core algorithm for the exact 0-1 knapsack problem. Eur. J. Oper. Res., 87:175-187 (1995).