NEOS and Condor: solving optimization problems over the Internet

ABSTRACT

We discuss the use of Condor, a distributed resource management system, as a provider of computational resources for NEOS, an environment for solving optimization problems over the Internet. We also describe how problems are submitted and processed by NEOS, and then scheduled and solved by Condor on available (idle) workstations

REFERENCES

• 1: Peter Arbenz , Walter Gander , Michael Oettli, The Remote Computation System, Proceedings of the International Conference and Exhibition on High-Performance Computing and Networking, p.662-667, April 15-19, 1996
• 2: Brett M. Averick , Jorge J. Moré , Christian H. Bischof , Alan Carle , Andreas Griewank, Computing large sparse Jacobian matrices using automatic differentiation, SIAM Journal on Scientific Computing, v.15 n.2, p.285-294, March 1994 [doi>10.1137/0915020]
• 3: BISCHOF, C. H., BOUARICHA, A., KHADEMI, P. M., AND MOR , J.J. 1997. Computing gradients in large-scale optimization using automatic differentiation. INFORMS J. Comput. 9, 2, 185-194.
• 4: BISCHOF, A., CARLE, A., CORLISS, G., GRIEWANK, A., AND HOVLAND, P. 1992. ADIFOR Generating derivative codes from Fortran programs. Sci. Program. 1, 1, 1-29.
• 5: BISCHOF, C., CARLE, A., AND KHADEMI, P. 1994a. Fortran 77 interface specification to the SparsLinC library. Tech. Rep. ANL/MCS-TM-196. Argonne National Laboratory, Argonne, IL.
• 6: BISCHOF, C., CARLE, A., KHADEMI, P., AND MAUER, A. 1994b. The ADIFOR 2.0 system for the automatic differentiation of Fortran 77 programs. Preprint MCS-P381-1194. Argonne National Laboratory, Argonne, IL. Also available as Tech. Rep. CRPC-TR94491 from Rice University's Center for Research on Parallel Computation.
• 7: Ali Bouaricha , Jorge J. Morè, Impact of Partial Separability on Large-Scale Optimization, Computational Optimization and Applications, v.7 n.1, p.27-40, Jan. 1997 [doi>10.1023/A:1008628114432]
• 8: Henri Casanova , Jack Dongarra, Applying NetSolve's Network-Enabled Server, IEEE Computational Science & Engineering, v.5 n.3, p.57-67, July 1998 [doi>10.1109/99.714602]
• 9: Joseph Czyzyk , Michael P. Mesnier , Jorge J. Moré, The NEOS Server, IEEE Computational Science & Engineering, v.5 n.3, p.68-75, July 1998 [doi>10.1109/99.714603]
• 10: DIRKSE, S. P. AND FERRIS, M. C. 1995a. MCPLIB: A collection of nonlinear mixed complementarity problems. Optim. Meth. Softw. 5, 3, 319-345.
• 11: DIRKSE, S. P. AND FERRIS, M. C. 1995b. The PATH solver: A non-monotone stabilization scheme for mixed complementarity problems. Optim. Meth. Softw. 5, 2, 123-156.
• 12: D. H. J. Epema , M. Livny , R. van Dantzig , X. Evers , J. Pruyne, A worldwide flock of Condors: load sharing among workstation clusters, Future Generation Computer Systems, v.12 n.1, p.53-65, May 1996 [doi>10.1016/0167-739X(95)00035-Q]
• 13: FERRIS, M. C. AND MUNSON, T. S. 1998. Modeling languages and Condor: Metacomputing for optimization. Tech. Rep. 98-13. University of Wisconsin at Madison, Madison, WI.
• 14: Michael C. Ferris , Todd S. Munson, Interfaces to PATH 3.0: Design, Implementation and Usage, Computational Optimization and Applications, v.12 n.1-3, p.207-227, Jan. 1999 [doi>10.1023/A:1008636318275]
• 15: M. C. Ferris , J. S. Pang, Engineering and Economic Applications of Complementarity Problems, SIAM Review, v.39 n.4, p.669-713, Dec. 1997 [doi>10.1137/S0036144595285963]
• 16: FOURER, R., GAY, D. M., AND KERNIGHAN, B. 1993. AMPL: A Modeling Language for Mathematical Programming. The Scientific Press.
• 17: Andreas Griewank , David Juedes , Jean Utke, Algorithm 755: ADOL-C: a package for the automatic differentiation of algorithms written in C/C++, ACM Transactions on Mathematical Software (TOMS), v.22 n.2, p.131-167, June 1996 [doi>10.1145/229473.229474]
• 18: GROPP, W. AND MOR , J. J. 1997. Optimization environments and the NEOS Server. In Approximation Theory and Optimization, M. D. Buhmann and A. Iserles, Eds. Cambridge University Press, New York, NY, 167-182.
• 19: LITZKOW, M. J., LIVNY, M., AND MUTKA, M.W. 1988. Condor--A hunter of idle workstations. In Proceedings of the 8th International Conference on Distributed Computing Systems (ICDCS '88, Washington, D. C., June), IEEE Computer Society Press, Los Alamitos, CA, 108-111.
• 20: SIMANTIRAKI, E. AND SHANNO, D. F. 1997. An infeasible-interior-point algorithm for solving mixed complementarity problems. In Complementarity and Variational Problems: State of the Art, M. C. Ferris and J. S. Pang, Eds. SIAM, Philadelphia, PA, 386-404.

INDEX TERMS

Primary Classification:
  G. Mathematics of Computing

Additional Classification:
  C. Computer Systems Organization
  C.2 COMPUTER-COMMUNICATION NETWORKS

  D. Software
  D.2 SOFTWARE ENGINEERING

General Terms:
Algorithms, Design, Languages, Performance, Reliability

Keywords:
automatic differentiation, complementarity problems, computational servers, network computing, resource management