{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,22]],"date-time":"2025-01-22T05:14:48Z","timestamp":1737522888457,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":43,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540666769"},{"type":"electronic","value":"9783540479543"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-47954-6_10","type":"book-chapter","created":{"date-parts":[[2007,10,5]],"date-time":"2007-10-05T07:39:08Z","timestamp":1191569948000},"page":"179-201","source":"Crossref","is-referenced-by-count":15,"title":["Scheduling a Metacomputer with Uncooperative Sub-schedulers"],"prefix":"10.1007","author":[{"given":"J\u00f6rn","family":"Gehring","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Preiss","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,7,14]]},"reference":[{"key":"10_CR1","unstructured":"Academic Computing Services Amsterdam. The SARA Metacomputing Project. WWW Page. http:\/\/www.sara.nl\/hec\/projects\/meta\/ ."},{"key":"10_CR2","unstructured":"Carl Albing. Cray NQS: production batch for a distributed computing world. In Proceedings of the 11th Sun User Group Conference and Exhibition, pages 302\u2013309, Brookline, MA, USA, December 1993. Sun User Group, Inc."},{"key":"10_CR3","unstructured":"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\/ ."},{"issue":"2","key":"10_CR4","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1006\/jpdc.1997.1335","volume":"43","author":"S. V. Anastasiadis","year":"1997","unstructured":"Stergios V. Anastasiadis and Kenneth C. Sevcik. Parallel application scheduling on networks of workstations. Journal of Parallel and Distributed Computing, 43 (2):109\u2013124, June 1997.","journal-title":"Journal of Parallel and Distributed Computing"},{"issue":"1","key":"10_CR5","doi-asserted-by":"crossref","first-page":"54","DOI":"10.1109\/40.342018","volume":"15","author":"T. E. Anderson","year":"1995","unstructured":"T. E. Anderson, D. E. Culler, and D. A. Patterson. A case for NOW (Networks of Workstations). IEEE Micro, 15(1):54\u201364, February 1995.","journal-title":"IEEE Micro"},{"key":"10_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"982ff","DOI":"10.1007\/BFb0031676","volume-title":"Metacomputing to overcome the power limits of a single machine","author":"R. Baraglia","year":"1997","unstructured":"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."},{"issue":"2","key":"10_CR7","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1109\/TC.1985.1676552","volume":"C-34","author":"M. Calzarossa","year":"1985","unstructured":"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\u2013162, 1985.","journal-title":"IEEE Transactions on Computers"},{"issue":"5","key":"10_CR8","doi-asserted-by":"publisher","first-page":"1539","DOI":"10.1137\/S0363012996307813","volume":"36","author":"O. Catoni","year":"1998","unstructured":"Olivier Catoni. Solving scheduling problems by simulated annealing. SIAM Journal on Control and Optimization, 36 (5):1539\u20131575, September 1998.","journal-title":"SIAM Journal on Control and Optimization"},{"issue":"14","key":"10_CR9","first-page":"25","volume":"17","author":"S. J. Chapin","year":"1998","unstructured":"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 199817:14:25 GMT.","journal-title":"Resource management in legion"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"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\u201344, February 1994.","DOI":"10.1145\/183019.183023"},{"key":"10_CR11","unstructured":"Cray Research. NQE. commercial product."},{"issue":"2\/3","key":"10_CR12","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1177\/109434209601000201","volume":"10","author":"T. A. DeFanti","year":"1996","unstructured":"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\u2013131, Summer\/Fall 1996.","journal-title":"The International Journal of Supercomputer Applications and High Performance Computing"},{"key":"10_CR13","unstructured":"Jack Dongarra and Hans Meuer and Erich Strohmaier. Top 500 Report. WWW Page, 1998. http:\/\/www.netlib.org\/benchmark\/top500\/top500.list.html . 186"},{"key":"10_CR14","series-title":"Technical Report","doi-asserted-by":"crossref","DOI":"10.21236\/ADA637066","volume-title":"A parallel workload model and its implications for processor allocation","author":"A. B. Downey","year":"1996","unstructured":"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."},{"key":"10_CR15","series-title":"Technical Report","doi-asserted-by":"crossref","DOI":"10.21236\/ADA637068","volume-title":"A model for speedup of parallel programs","author":"A. B. Downey","year":"1997","unstructured":"Allen B Downey. A model for speedup of parallel programs. Technical Report CSD-97-933, University of California, Berkeley, January 30, 1997."},{"key":"10_CR16","doi-asserted-by":"publisher","first-page":"89ff","DOI":"10.1007\/BFb0022283","volume":"1162","author":"D. G. Feitelson","year":"1996","unstructured":"D. G. Feitelson. Packing schemes for gang scheduling. Lecture Notes in Computer Science, 1162:89ff, 1996.","journal-title":"Lecture Notes in Computer Science"},{"key":"10_CR17","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"337ff","DOI":"10.1007\/3-540-60153-8_38","volume-title":"Job characteristics of a production parallel scientific workload on the NASA ames iPSC\/ 860","author":"D. G. Feitelson","year":"1995","unstructured":"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."},{"key":"10_CR18","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1ff","DOI":"10.1007\/BFb0053977","volume-title":"Metrics and benchmarking for parallel job scheduling","author":"D. G. Feitelson","year":"1998","unstructured":"D. G. Feitelson and L. Rudolph. Metrics and benchmarking for parallel job scheduling. Lecture Notes in Computer Science, 1459:1ff, 1998."},{"key":"10_CR19","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1ff","DOI":"10.1007\/3-540-63574-2","volume-title":"Theory and practice in parallel job scheduling","author":"D. G. Feitelson","year":"1997","unstructured":"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."},{"issue":"2","key":"10_CR20","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1177\/109434209701100205","volume":"11","author":"I. Foster","year":"1997","unstructured":"I. Foster and C. Kesselman. Globus: A metacomputing infrastructure toolkit. The International Journal of Supercomputer Applications and High Performance Computing, 11 (2):115\u2013128, Summer 1997.","journal-title":"The International Journal of Supercomputer Applications and High Performance Computing"},{"key":"10_CR21","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"65ff","DOI":"10.1007\/BFb0022288","volume-title":"Architecture-independent request-scheduling with tight waiting-time estimations","author":"J. Gehring","year":"1996","unstructured":"J. Gehring and F. Ramme. Architecture-independent request-scheduling with tight waiting-time estimations. Lecture Notes in Computer Science, 1162:65ff, 1996."},{"key":"10_CR22","doi-asserted-by":"crossref","unstructured":"J. Gehring, A. Reinefeld, and A. Weber. PHASE and MICA: Application specific metacomputing. In Proceedings of Europar 97, Passau, Germany, 1997.","DOI":"10.1007\/BFb0002889"},{"key":"10_CR23","unstructured":"Genias Software GmbH, Erzgebirgstr. 2B, D-93073 Neutraubling. CODINE User\u2019s Guide, 1993. http:\/\/www.genias.de\/genias\/english\/codine\/ ."},{"key":"10_CR24","unstructured":"Hoare. Quicksort. In C. A. A. Hoare and C. B. Jones (Eds.), Essays in Computing Science, Prentice Hall. 1989."},{"issue":"2","key":"10_CR25","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1006\/jpdc.1996.1244","volume":"40","author":"C.-J. Hou","year":"1997","unstructured":"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\u2013184, February 1997.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10_CR26","unstructured":"IBM Corporation. Using and Administering LoadLeveler (Release 3.0), 4 edition, August 1996. Document Number SC23-3989-00."},{"issue":"4-5","key":"10_CR27","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1016\/0167-739X(95)00018-N","volume":"11","author":"K. Koski","year":"1995","unstructured":"K. Koski. A step towards large scale parallelism: building a parallel computing environment from heterogenous resources. Future Generation Computer Systems, 11 (4-5):491\u2013498, August 1995.","journal-title":"Future Generation Computer Systems"},{"key":"10_CR28","unstructured":"Robert R. Lipman and Judith E. Devaney. Websubmit\u2013running supercomputer applications via the web. In Supercomputing\u2019 96, Pittsburgh, PA, November 1996."},{"key":"10_CR29","series-title":"Technical Report","volume-title":"Algorithms for scheduling malleable and nonmalleable parallel tasks","author":"W. T. Ludwig","year":"1995","unstructured":"Walter T. Ludwig. Algorithms for scheduling malleable and nonmalleable parallel tasks. Technical Report CS-TR-95-1279, University ofWisconsin, Madison, August 1995."},{"key":"10_CR30","unstructured":"The NRW Metacomputing Initiative. WWW Page. http:\/\/www.unipaderborn.de\/pc2\/nrwmc\/ ."},{"key":"10_CR31","unstructured":"B. J. Overeinder and P. M. A. Sloot. Breaking the curse of dynamics by task migration: Pilot experiments in the polder metacomputer."},{"key":"10_CR32","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"166ff","DOI":"10.1007\/3-540-63574-2_21","volume-title":"Implementing multiprocessor scheduling disciplines","author":"E. W. Parsons","year":"1997","unstructured":"E. W. Parsons and K. C. Sevcik. Implementing multiprocessor scheduling disciplines. Lecture Notes in Computer Science, 1291:166ff, 1997."},{"key":"10_CR33","unstructured":"Platform Computing Corporation. LSF Product Information. WWW Page, October 1996. http:\/\/www.platform.com\/ ."},{"key":"10_CR34","doi-asserted-by":"crossref","unstructured":"F. Ramme and K. Kremer. Scheduling a metacomputer by an implicit voting system. In Int. IEEE Symposium on High-Perform94","DOI":"10.1109\/HPDC.1994.340254"},{"key":"10_CR35","doi-asserted-by":"crossref","unstructured":"A. Reinefeld, R. Baraglia, T. Decker, J. Gehring, D. Laforenza, F. Ramme, T. R\u00e9mke;, and J. Simon. The MOL project: An open, extensible metacomputer. In Debra Hensgen, editor, Proceedings of the 6th Heterogeneous Computing Workshop, pages 17\u201331, Washington, April 1 1997. IEEE Computer Society Press.","DOI":"10.1109\/HCW.1997.581407"},{"key":"10_CR36","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"526ff","DOI":"10.1007\/BFb0037180","volume-title":"High-performance computer management based on Java","author":"V. Sander","year":"1998","unstructured":"V. Sander, D. Erwin, and V. Huber. High-performance computer management based on Java. Lecture Notes in Computer Science, 1401:526ff, 1998."},{"key":"10_CR37","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"832ff","DOI":"10.1007\/3-540-58430-7_72","volume-title":"Mapping and scheduling by genetic algorithms","author":"M. Schwehm","year":"1994","unstructured":"M. Schwehm and T. Walter. Mapping and scheduling by genetic algorithms. Lecture Notes in Computer Science, 854:832ff, 1994."},{"key":"10_CR38","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-61680-2_45","volume-title":"Preemptive weighted completion time scheduling of parallel jobs","author":"U. Schwiegelshohn","year":"1996","unstructured":"Uwe Schwiegelshohn. Preemptive weighted completion time scheduling of parallel jobs. In Josep D\u00edaz and Maria Serna, editors, Algorithms ESA\u2019 96, Fourth Annual European Symposium, volume 1136 of Lecture Notes in Computer Science, pages 39\u201351, Barcelona, Spain, 25-27 September 1996. Springer."},{"key":"10_CR39","unstructured":"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\u2013638, San Francisco, California, 25-27 January 1998. i. 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\u2013286, January 1993."},{"key":"10_CR40","volume-title":"CORBA: Fundamentals and Programming","author":"J. Siegel","year":"1996","unstructured":"Jon Siegel. CORBA: Fundamentals and Programming. John Wiley & Sons Inc., New York, 1 edition, 1996.","edition":"1 edition"},{"issue":"6","key":"10_CR41","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1145\/129888.129890","volume":"35","author":"L. Smarr","year":"1992","unstructured":"Larry Smarr and Charles E. Catlett. Metacomputing. Communications of the ACM, 35 (6):44\u201352, June 1992.","journal-title":"Communications of the ACM"},{"key":"10_CR42","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"122ff","DOI":"10.1007\/BFb0053984","volume-title":"Predicting application run times using historical information","author":"W. Smith","year":"1998","unstructured":"W. Smith, I. Foster, and V. Taylor. Predicting application run times using historical information. Lecture Notes in Computer Science, 1459:122ff, 1998."},{"key":"10_CR43","doi-asserted-by":"crossref","unstructured":"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.","DOI":"10.1016\/S0167-8191(98)00079-9"}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-47954-6_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T12:04:10Z","timestamp":1737461050000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-47954-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540666769","9783540479543"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/3-540-47954-6_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]}}}