FATCOP: A fault tolerant condor-PVM mixed integer programming solver

SIAM Journal on Optimization

Volumn 11, Issue 4, 2001, Pages 1019-1036

  Chen, Qun ^a   Ferris, Michael C ^b  

^a ORACLE CORPORATION   (United States)

^b University of Wisconsin Madison   (United States)

Author keywords

Branch and bound; Condor; Fault tolerance; Mixed integer programming; Opportunistic environment

Indexed keywords

EID: 0035618984     PISSN: 10526234     EISSN: None     Source Type: Journal    
DOI: 10.1137/S1052623499353911     Document Type: Article

References (28)

1. K. ANSTREICHER, N. BRIXIUS, J.-P. GOUX, AND J. LINDEROTH, Solving Large Quadratic Assignment Problems on Computational Grids, Technical report, Argonne National Laboratory, Argonne, IL, 2000.
2. M. AVRIEL AND B. GOLANY, Mathematical Programming for Industrial Engineers, Marcel Dekker, New York, 1996.
3. P. V. BALAKRISHNAN AND V. S. JACOB, Genetic algorithms for product design, Management Sci., 42 (1996), pp. 1105-1117.
4. M. BENICHOU AND J. M. GAUTHIER, Experiments in mixed-integer linear programming, Management Sci., 20 (1974), pp. 736-773.
5. R. E. BIXBY, S. CERIA, C. M. MCZEAL, AND M. W. P. SAVELSBERGH, MIPLIB 3.0, available online at http://www.caam.rice.edu/~bixby/miplib/miplib.html.
6. R. E. BIXBY, W. COOK, A. COX, AND E. K. LEE, Parallel Mixed Integer Programming, Technical report CRPC-TR95554, Center for Research on Parallel Computation, Rice University, Houston, TX, 1995. Available online at ftp://softlib.rice.edu/pub/CRPC-TRs/reports/CRPC-TR95554.pdf.
7. A. BROOKE, D. KENDRICK, AND A. MEERAUS, GAMS: A User's Guide, The Scientific Press, South San Francisco, CA, 1988.
8. Q. CHEN, M. C. FERRIS, AND J. T. LINDEROTH, FATCOP 2.0: Advanced features in an opportunistic mixed integer programming solver, Ann. Oper. Res., to appear.
9. CPLEX Optimizer, available online at http://www.cplex.com.
10. D. L. EAGER, M. C. FERRIS, AND M. K. VERNON, Optimized regional caching for on-demand data delivery, in Multimedia Computing and Networking 1999, Proc. SPIE 3654, SPIE -The International Society for Optical Engineering, Bellingham, WA, 1999, pp. 301-316.
11. J. ECKSTEIN, Parallel branch-and-bound algorithms for general mixed integer programming on the CM-5, SIAM J. Optim., 4 (1994), pp. 794-814.
12. D. H. EPEMA AND M. LIVNY, A worldwide flock of condors: Load sharing among workstation clusters, Future Generation Comput. Systems, 12 (1996), pp. 53-65.
13. M. C. FERRIS AND R. R. MEYER, Models and solution for on-demand data delivery problems, in Approximation and Complexity in Numerical Optimization: Continuous and Discrete Problems, Kluwer Academic Publishers, Dordrecht, the Netherlands, 1999, pp. 175-188.
14. A. GEIST, A. BEGUELIN, J. J. DONGARRA, W. JIANG, R. MANCHEK, AND V. S. SUNDERAM, PVM: Parallel Virtual Machine - A User's Guide and Tutorial for Networked Parallel Computing, The MIT Press, Cambridge, MA, 1994.
15. B. GENDRON AND T. G. CRAINIC, Parallel branch-and-bound algorithms: Survey and synthesis, Oper. Res., 42 (1994), pp. 1042-1060.
16. J.-P. GOUX, S. KULKARNI, J. LINDEROTH, AND M. E. YODER, An enabling framework for master-worker applications on the computational grid, in Proceedings of the Ninth IEEE International Symposium on High Performance Distributed Computing, Pittsburgh, PA, 2000, pp. 43-50.
17. W. GROPP, E. LUSK, AND A. SKJELLUM, Using MPI: Portable Parallel Programming with the Message-Passing Interface, The MIT Press, Cambridge, MA, 1994.
18. Z. GU, G. L. NEMHAUSER, AND M. W. P. SAVELSBERGH, Lifted cover inequalities for 0-1 integer programs: Computation, INFORMS J. Comput., 10 (1998), pp. 427-437.
19. J. LINDEROTH AND M. W. P. SAVELSBERGH, A computational study of search strategies for mixed integer programming, INFORMS J. Comput., 11 (1999), pp. 173-187.
20. M. J. LITZKOW AND M. LIVNY, Condor - A hunter of idle workstations, in Proceedings of the 8th International Conference on Distributed Computing Systems, Washington, DC, IEEE Computer Society Press, Los Alamitos, CA, 1988, pp. 108-111.
21. J. L. NAZARETH, Computer Solution of Linear Programs, Oxford University Press, Oxford, New York, 1987.
22. G. L. NEMHAUSER AND L. WOLSEY, Integer and Combinatorial Optimization, Wiley-Interscience, New York, 1989.
23. J. PRUYNE AND M. LIVNY, Providing resource management services to parallel applications, in Proceedings of the Second Workshop on Environments and Tools for Parallel Scientific Computing, J. J. Dongarra and B. Tourancheau, eds., Proceedings in Applied Mathematics 74, SIAM, Philadelphia, 1994, pp. 152-161.
24. E. A. PRUUL AND G. L. NEMHAUSER, Branch-and-bound and parallel computation: A historical note, Oper. Res. Lett., 7 (1988), pp. 65-69.
25. M. W. P. SAVELSBERGH, Preprocessing and probing for mixed integer programming problems, ORSA J. Comput., 6 (1994), pp. 445-454.
26. L. SHI, S. ÓLAFSSON, AND Q. CHEN, An optimization framework for product design, Management Sci., submitted.
27. S. J. WRIGHT, Solving optimization problems on computational grids, Optima, to appear.
28. R. WUNDERLING, SOPLEX Library Documentation, available online at http://www.zib.de/Optimization/Software/Soplex.