Scheduling a metacomputer with uncooperative sub-schedulers

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1659, Issue , 1999, Pages 179-201

  Gehring, Jörn ^a   Preiss, Thomas ^a  

^a UNIVERSITY OF PADERBORN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

SCHEDULING;

EFFICIENT SCHEDULING; GENERIC SIMULATION; MACHINE MANAGEMENTS; MACHINE MODELS; MANAGEMENT SYSTEMS; PARALLEL APPLICATION; PEAK PERFORMANCE; SCHEDULING MODELS;

SCHEDULING ALGORITHMS;

EID: 84947916671     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-47954-6_10     Document Type: Conference Paper

References (44)

1. Academic Computing Services Amsterdam. The SARA Metacomputing Project. WWW Page. http://www.sara.nl/hec/projects/meta/. 182
2. Carl Albing. Cray NQS: production batch for a distributed computing world. In Proceedings of the 11th Sun User Group Conference and Exhibition, pages 302-309, Brookline, MA, USA, December 1993. Sun User Group, Inc. 184
3. J. Almond and D. Snelling. UNICORE: Secure and Uniform Access to Distributed Resources via the World Wide Web, 1998. http://www.kfajuelich. de/zam/RD/coop/unicore/. 182
4. Stergios V. Anastasiadis and Kenneth C. Sevcik. Parallel application scheduling on networks of workstations. Journal of Parallel and Distributed Computing, 43(2):109-124, June 1997. 183
5. T. E. Anderson, D. E. Culler, and D. A. Patterson. A case for NOW (Networks of Workstations). IEEE Micro, 15(1):54-64, February 1995. 181
6. R. Baraglia, R. Ferrini, D. Laforenza, and A. Lagana. Metacomputing to overcome the power limits of a single machine. Lecture Notes in Computer Science, 1225:982ff, 1997. 182
7. M. Calzarossa and G. Serazzi. A characterization of the variation in time of workload arrival patterns. IEEE Transactions on Computers, Vol. C-34, :2, 156-162, 1985. 187
8. Olivier Catoni. Solving scheduling problems by simulated annealing. SIAM Journal on Control and Optimization, 36(5):1539-1575, September 1998. 183
9. Steve J. Chapin, Dimitrios Katramatos, John Karpovich, and Andrew S. Grimshaw. Resource management in legion. Technical Report CS-98-09, Department of Computer Science, University of Virginia, February 11 1998. Wed, 19 Aug 1998 17:14:25 GMT. 181
10. Su-Hui Chiang, Rajesh K. Mansharamani, and Mary K. Vernon. Use of Application Characteristics and Limited Preemption for Run-To-Completion Parallel Processor Scheduling Policies. In Proceedings of the 1994 ACM SIGMETRICS Conference, pages 33-44, February 1994. 183
11. Cray Research. NQE. commercial product. 184
12. Thomas A. DeFanti, Ian Foster, Michael E. Papka, Rick Stevens, and Tim Kuhfuss. Overview of the I-WAY: Wide-area visual supercomputing. The International Journal of Supercomputer Applications and High Performance Computing, 10(2/3):123-131, Summer/Fall 1996. 179
13. Jack Dongarra and Hans Meuer and Erich Strohmaier. Top 500 Report. WWW Page, 1998. http://www.netlib.org/benchmark/top500/top500.list.html. 186
14. Allen B. Downey. A parallel workload model and its implications for processor allocation. Technical Report CSD-96-922, University of California, Berkeley, November 6, 1996. 187, 187, 188, 188, 190
15. Allen B Downey. A model for speedup of parallel programs. Technical Report CSD-97-933, University of California, Berkeley, January 30, 1997. 190
16. D. G. Feitelson. Packing schemes for gang scheduling. Lecture Notes in Computer Science, 1162:89ff, 1996. 188
17. D. G. Feitelson and B. Nitzberg. Job characteristics of a production parallel scientific workload on the NASA ames iPSC/ 860. Lecture Notes in Computer Science, 949:337ff, 1995. 188
18. D. G. Feitelson and L. Rudolph. Metrics and benchmarking for parallel job scheduling. Lecture Notes in Computer Science, 1459:1ff, 1998. 185, 187, 187, 187, 187, 188, 188, 190, 190
19. D. G. Feitelson, L. Rudolph, U. Schwiegelshohn, and K. C. Sevcik. Theory and practice in parallel job scheduling. Lecture Notes in Computer Science, 1291:1ff, 1997. 180, 182, 182, 182, 185, 190
20. I. Foster and C. Kesselman. Globus: A metacomputing infrastructure toolkit. The International Journal of Supercomputer Applications and High Performance Computing, 11(2):115-128, Summer 1997. 181, 184, 185
21. J. Gehring and F. Ramme. Architecture-independent request-scheduling with tight waiting-time estimations. Lecture Notes in Computer Science, 1162:65ff, 1996. 182, 183, 184, 188, 192
22. J. Gehring, A. Reinefeld, and A. Weber. PHASE and MICA: Application specific metacomputing. In Proceedings of Europar 97, Passau, Germany, 1997. 182, 186, 186
23. Genias Software GmbH, Erzgebirgstr. 2B, D-93073 Neutraubling. CODINE User's Guide, 1993. http://www.genias.de/genias/english/codine/. 181
24. Hoare. Quicksort. In C. A. A. Hoare and C. B. Jones (Ed.), Essays in Computing Science, Prentice Hall. 1989. 185
25. Chao-Ju Hou and Kang G. Shin. Implementation of decentralized load sharing in networked workstations using the Condor package. Journal of Parallel and Distributed Computing, 40(2):173-184, February 1997. 181
26. IBM Corporation. Using and Administering LoadLeveler - Release 3.0, 4 edition, August 1996. Document Number SC23-3989-00. 184
27. K. Koski. A step towards large scale parallelism: building a parallel computing environment from heterogenous resources. Future Generation Computer Systems, 11(4-5):491-498, August 1995. 182
28. Robert R. Lipman and Judith E. Devaney. Websubmit - running supercomputer applications via the web. In Supercomputing '96, Pittsburgh, PA, November 1996. 182
29. Walter T. Ludwig. Algorithms for scheduling malleable and nonmalleable parallel tasks. Technical Report CS-TR-95-1279, University ofWisconsin, Madison, August 1995. 183, 184, 193, 194
30. The NRW Metacomputing Initiative. WWW Page. http://www.unipaderborn. de/pc2/nrwmc/. 182, 184
31. B. J. Overeinder and P. M. A. Sloot. Breaking the curse of dynamics by task migration: Pilot experiments in the polder metacomputer. Lecture Notes in Computer Science, 1332:194ff, 1997. 181, 184, 185
32. E. W. Parsons and K. C. Sevcik. Implementing multiprocessor scheduling disciplines. Lecture Notes in Computer Science, 1291:166ff, 1997. 180, 183
33. Platform Computing Corporation. LSF Product Information. WWW Page, October 1996. http://www.platform.com/. 181
34. F. Ramme and K. Kremer. Scheduling a metacomputer by an implicit voting system. In Int. IEEE Symposium on High-Performance Distributed Computing. Paderborn Center for Parallel Computing, 94. 184, 192
35. A. Reinefeld, R. Baraglia, T. Decker, J. Gehring, D. Laforenza, F. Ramme, T. Römke, and J. Simon. The MOL project: An open, extensible metacomputer. In Debra Hensgen, editor, Proceedings of the 6th Heterogeneous Computing Workshop, pages 17-31, Washington, April 1 1997. IEEE Computer Society Press. 182, 183, 188
36. V. Sander, D. Erwin, and V. Huber. High-performance computer management based on Java. Lecture Notes in Computer Science, 1401:526ff, 1998. 181, 184, 185, 188
37. M. Schwehm and T. Walter. Mapping and scheduling by genetic algorithms. Lecture Notes in Computer Science, 854:832ff, 1994. 183
38. Uwe Schwiegelshohn. Preemptive weighted completion time scheduling of parallel jobs. In Josep Díaz and Maria Serna, editors, Algorithms|ESA '96, Fourth Annual European Symposium, volume 1136 of Lecture Notes in Computer Science, pages 39-51, Barcelona, Spain, 25-27 September 1996. Springer. 183
39. Uwe Schwiegelshohn and Ramin Yahyapour. Analysis of first-come-first-serve parallel job scheduling. In Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, pages 629-638, San Francisco, California, 25-27 January 1998. 184, 192
40. S. Setia and S. Tripathi. A comparative analysis of static processor partitioning policies for parallel computers. In Internat. Workshop on Modeling and Simulation of Computer and Telecommunication Systems (MASCOTS), pages 283-286, January 1993. 184
41. Jon Siegel. CORBA: Fundamentals and Programming. John Wiley & Sons Inc., New York, 1 edition, 1996. 182
42. Larry Smarr and Charles E. Catlett. Metacomputing. Communications of the ACM, 35(6):44-52, June 1992. 179, 181
43. W. Smith, I. Foster, and V. Taylor. Predicting application run times using historical information. Lecture Notes in Computer Science, 1459:122ff, 1998. 183
44. A. W. van Halderen, Benno J. Overeinder, Peter M. A. Sloot, R. van Dantzig, Dick H. J. Epema, and Miron Livny. Hierarchical resource management in the polder metacomputing initiative. submitted to Parallel Computing, 1997. 181, 184