An enabling framework for master-worker applications on the Computational Grid

Proceedings of the IEEE International Symposium on High Performance Distributed Computing

Volumn 2000-January, Issue , 2000, Pages 43-50

  Goux, J P ^a   Kulkarni, S ^b   Linderoth, J ^c   Yoder, M ^b  

^a NORTHWESTERN UNIVERSITY   (United States)

^b University of Wisconsin Madison ^*  (United States)

^c ARGONNE NATIONAL LABORATORY   (United States)

Author keywords

Application software; Computer applications; Computer science; Concurrent computing; Grid computing; Laboratories; Mathematics; Pervasive computing; Robustness; Software tools

Indexed keywords

APPLICATION PROGRAMS; COMBINATORIAL OPTIMIZATION; COMPUTER AIDED SOFTWARE ENGINEERING; COMPUTER APPLICATIONS; COMPUTER PROGRAMMING; COMPUTER SCIENCE; COMPUTER SOFTWARE; DISTRIBUTED COMPUTER SYSTEMS; LABORATORIES; MATHEMATICAL TECHNIQUES; OPTIMIZATION; ROBUSTNESS (CONTROL SYSTEMS); UBIQUITOUS COMPUTING; COMBINATORIAL MATHEMATICS; COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; INTERFACES (COMPUTER); NATURAL SCIENCES COMPUTING; PROBLEM SOLVING;

COMBINATORIAL OPTIMIZATION PROBLEMS; COMPUTATIONAL GRIDS; CONCURRENT COMPUTING; HIGH-THROUGHPUT COMPUTING; MASTER-WORKER APPLICATIONS; MASTER-WORKER PARADIGMS; SCIENTIFIC COMPUTATION; SOFTWARE FRAMEWORKS;

GRID COMPUTING; PARALLEL PROCESSING SYSTEMS;

COMPUTATIONAL GRID; CONDOR COMPUTING SYSTEM; INFRASTRUCTURE PROGRAMMING INTERFACE; MASTER WORKER APPLICATION;

EID: 0033684156     PISSN: 10828907     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/HPDC.2000.868633     Document Type: Conference Paper

References (26)

1. K. Anstreicher and N. Brixius. A new bound for the quadratic assignment problem based on convex quadratic programming. Technical report, Department of Management Sciences, University of Iowa, 1999. Available from http://www.biz.uiowa.edu/faculty/anstreicher/qapqp.ps.
2. K. Anstreicher, N. Brixius, J.-P. Goux, G. Hudek-Davis, and J. Linderoth. Location theory gives rise to QAP problem, data link, March 2000. The Alliance Online Technical News Letter, available from http://www.ncsa.uiuc.edu/SCD/Alliance/datalink/0003/QA.Condor.html.
3. A. Baratloo, M. Karaul, Z. Kedem, and P. Wyckoff. Charlotte: Metacomputing on the Web. International Journal on Future Generation Computer Systems, 15:559-570, 1999.
4. W. Bell. Solving QAP with Condor. Access, May 2000. http://access.ncsa.uiuc.edu/Features/Condor/.
5. H. Casanova and J. Dongarra. NetSolve : Network enabled solvers. IEEE Computational Science and Engineering, 5(3):57-67, 1998.
6. E. Cela. The Quadratic Assignment Problem - Theory and Algorithms. Kluwer, 1998.
7. Q. Chen, M. Ferris, and J. Linderoth. Fatcop 2.0: Advanced features in an opportunistic mixed integer programming solver. Data Mining Institute 99-11, Computer Sciences Department, University of Wisconsin, Madison, Wisconsin, 1999. Available from http://www.mcs.anl.gov/metaneos/fatcop2.ps.
8. The Condor Team. Extending your Condor pool by Gliding into Globus-controlled machines, 2000. http://www.cs.wisc.edu/condor/manual/v6.1/2-12Extending-your.html.
9. D. H. J. Epema, M. Livny, R. van Dantzig, X. Evers, and J. Pruyne. A worldwide flock of Condors: Load sharing among workstation clusters. Journal on Future Generation Computer Systems, 12:67-85, 1996.
10. G. Fagg, K. Moore, and J. Dongarra. Scalable networked information processing environment (SNIPE). International Journal on Future Generation Computer Systems, 15:595-605, 1999.
11. I. Foster and C. Kesselman. Globus: A metacomputing infrastructure toolkit. Intl. J. Supercomputer Applications, 1997. Available as ftp://ftp.globus.org/pub/globus/papers/globus.ps.gz.
12. I. Foster and C. Kesselman. The Grid: Blueprint for a New Computing Infrastructure. Morgan-Kaufmann, 1999.
13. D. Gelernter and D. Kaminsky. Supercomputing out of recycled garbage : preliminary experience with piranha. In ACM, International Conference on Supercomputing, , July 1992.
14. J.-P. Goux and S. Leyffer. Mixed-integer nonlinear programming on metacomputing platform. Working Paper, 1999.
15. J.-P. Goux, J. Linderoth, and M. Yoder. Metacomputing and the master-worker paradigm. Preprint ANL/MCS-P792-0200, Mathematics and Computer Science Division, Argonne National Laboratory, 2000.
16. A. Grimshaw, A. Ferrari, F. Knabe, and M. Humphrey. Legion: An operating system for wide-area computing. Available as http://legion.virginia.edu/papers/CS-99-12.ps.Z, 1999.
17. J. Linderoth and S. Wright. Solving large stochastic programs in a metacomputing environment. Invited Presentation at APMOD - Applied Modelling for Optimization, April 2000.
18. M. Litzkow. Remote Unix - Turning idle workstations into cycle servers. In Proceedings of Usenix Summer Conference, 1987.
19. M. Livny, J. Basney, R. Raman, and T. Tannenbaum. Mechanisms for high throughput computing. SPEEDUP, 11, 1997. Available from http://www.cs.wisc.edu/condor/doc/htc-mech.ps.
20. The MetaNEOS Project. Metacomputing Environments for Optimization, 2000. http://www.mcs.anl.gov/metaneos.
21. 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, 1994. Available as http://www.cs.wisc.edu/condor/doc/condor-pvm-framework.ps.Z.
22. J. Pruyne and M. Livny. Interfacing Condor and PVM to harness the cycles of workstation clusters. Journal on Future Generations of Computer Systems, 12:53-65, 1996.
23. L. Sarmenta and S. Hirano. Bayanihan: Building and studying volunteer computing systems using java. Future Generation Computer Systems, 15(5/6):675-686, 1999.
24. M. van Steen, P. Homburg, and A. Tanenbaum. Globe: A wide-area distributed system. IEEE Concurrency, 7:70-78, 1999.
25. R. Wolski, J. Brevik, C. Krintz, G. Obertelli, N. Spring, and A. Su. Running Everyware on the computational Grid. In SC99 Conference on High-performance Computing, 1999. Available from http://www.cs.utk.edu/~rich/papers/ev-sc99.ps.gz.
26. R. Wolski, N. Spring, and J. Hayes. The Network Weather Service: A distributed resource performance forecasting service for metacomputing. Future Generations of Computer Systems, 15:757-768, 1999.