{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:40:02Z","timestamp":1737398402102,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001720"},{"type":"electronic","value":"9783540361800"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36180-4_1","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T13:27:38Z","timestamp":1188307658000},"page":"1-23","source":"Crossref","is-referenced-by-count":11,"title":["A Self-Tuning Job Scheduler Family with Dynamic Policy Switching"],"prefix":"10.1007","author":[{"given":"Achim","family":"Streit","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,27]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"C. Ernemann, V. Hamscher, U. Schwiegelshohn, A. Streit, and R. Yahyapour. On Advantages of Grid Computing for Parallel Job Scheduling. In Proceedings of the 2nd IEEE International Symposium on Cluster Computing and the Grid (CCGRID 2002), 2002. 2, 7","key":"1_CR1","DOI":"10.1109\/CCGRID.2002.1017110"},{"doi-asserted-by":"crossref","unstructured":"D.G. Feitelson and M.A. Jette. Improved Utilization and Responsiveness with Gang Scheduling. In D.G. Feitelson and L. Rudolph, editor, Proc. of 3rd Workshop on Job Scheduling Strategies for Parallel Processing, volume 1291, pages 238\u2013262. Springer Verlag, 1997. 1","key":"1_CR2","DOI":"10.1007\/3-540-63574-2_24"},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1109\/52.754053","volume":"16","author":"D.G. Feitelson","year":"1999","unstructured":"D.G. Feitelson and M. Naaman. Self-Tuning Systems. In IEEE Software 16(2), pages 52\u201360, April\/May 1999. 3, 4","journal-title":"IEEE Software"},{"doi-asserted-by":"crossref","unstructured":"D.G. Feitelson and A. Mu\u2019alem Weil. Utilization and Predictability in Scheduling the IBM SP2 with Backfilling. In Proceedings of the 1st Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing (IPPS\/SPDP-98), pages 542\u2013547, Los Alamitos, March 1998. IEEE Computer Society. 1, 3, 10","key":"1_CR4","DOI":"10.1109\/IPPS.1998.669970"},{"doi-asserted-by":"crossref","unstructured":"H. Franke, J. Jann, J. Moreira, P. Pattnaik, and M. Jette. An Evaluation of Parallel Job Scheduling for ASCI Blue-Pacific. In Proceedings of SC\u201999, Portland, Oregon, pages 11\u201318. ACM Press and IEEE Computer Society Press, 1999. 1","key":"1_CR5","DOI":"10.1145\/331532.331577"},{"doi-asserted-by":"crossref","unstructured":"J. Gehring and F. Ramme. Architecture-Independent Request-Scheduling with Tight Waiting-Time Estimations. In D.G. Feitelson and L. Rudolph, editor, Proc. of 2nd Workshop on Job Scheduling Strategies for Parallel Processing, volume 1162, pages 65\u201380. Springer Verlag, 1996. 2","key":"1_CR6","DOI":"10.1007\/BFb0022288"},{"doi-asserted-by":"crossref","unstructured":"V. Hamscher, U. Schwiegelshohn, A. Streit, and R. Yahyapour. Evaluation of job-scheduling strategies for grid computing. In Proceedings of 1st IEEE\/ACM International Workshop on Grid Computing (Grid 2000), volume 1971, pages 191\u2013202, 2000. 7","key":"1_CR7","DOI":"10.1007\/3-540-44444-0_18"},{"key":"1_CR8","first-page":"1","volume":"3","author":"A. Keller","year":"2001","unstructured":"A. Keller and A. Reinefeld. Anatomy of a Resource Management System for HPC Clusters. In Annual Review of Scalable Computing, vol. 3, Singapore University Press, pages 1\u201331, 2001. 2","journal-title":"Annual Review of Scalable Computing"},{"unstructured":"J. Krallmann. A Quantative Analysis of Scheduling-Algorithms for Parallel Machines (in German). Master\u2019s thesis, Dortmund University, 1998. 7","key":"1_CR9"},{"key":"1_CR10","series-title":"Lect Notes Comput Sci","first-page":"831","volume-title":"A Gang-Scheduling System for ASCI Blue-Pacific","author":"J. E. Moreira","year":"1999","unstructured":"J. E. Moreira, H. Franke, W. Chan, and L. L. Fong. A Gang-Scheduling System for ASCI Blue-Pacific. In Proceedings of the 7th International Conference in High-Performance Computing and Networking (HPCN\u201999), volume 1593 of Lecture Notes in Computer Science, pages 831\u2013840. Springer, 1999. 1"},{"issue":"6","key":"1_CR11","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/71.932708","volume":"12","author":"A.W. Mu\u2019alem","year":"2001","unstructured":"A.W. Mu\u2019alem and D. G. Feitelson. Utilization, Predictability, Workloads, and User Runtime Estimates in Scheduling the IBM SP2 with Backfilling. In IEEE Trans. Parallel & Distributed Systems 12(6), pages 529\u2013543, June 2001. 1","journal-title":"IEEE Trans. Parallel & Distributed Systems"},{"doi-asserted-by":"crossref","unstructured":"F. Ramme and K. Kremer. Scheduling a Metacomputer by an Implicit Voting System. In 3 rd Int. IEEE Symposium on High-Performance Distributed Computing, pages 106\u2013113, 1994. 2","key":"1_CR12","DOI":"10.1109\/HPDC.1994.340254"},{"doi-asserted-by":"crossref","unstructured":"J. Skovira, W. Chan, H. Zhou, and D. Lifka. The EASY \u2014 LoadLeveler API Project. In D.G. Feitelson and L. Rudolph, editor, Proc. of 2nd Workshop on Job Scheduling Strategies for Parallel Processing, volume 1162, pages 41\u201347. Springer Verlag, 1996. 1","key":"1_CR13","DOI":"10.1007\/BFb0022286"},{"doi-asserted-by":"crossref","unstructured":"W. Smith, I. Foster, and V. Taylor. Predicting Application Run Times Using Historical Information. In D.G. Feitelson and L. Rudolph, editor, Proc. of 4th Workshop on Job Scheduling Strategies for Parallel Processing, volume 1459, pages 122\u2013142. Springer Verlag, 1998. 1","key":"1_CR14","DOI":"10.1007\/BFb0053984"},{"key":"1_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/3-540-45307-5_6","volume-title":"On Job Scheduling for HPC-Clusters and the dynP Scheduler","author":"A. Streit","year":"2001","unstructured":"A. Streit. On Job Scheduling for HPC-Clusters and the dynP Scheduler. In Proceedings of the 8th International Conference on High Performance Computing (HiPC 2001), volume 2228 of Lecture Notes in Computer Science, pages 58\u201367. Springer, December 2001. 3, 6, 17, 18"},{"key":"1_CR16","series-title":"Lect Notes Comput Sci","volume-title":"The Self-Tuning dynP Job-Scheduler","author":"A. Streit","year":"2002","unstructured":"A. Streit. The Self-Tuning dynP Job-Scheduler. In Proceedings of the 11th International Heterogenous Computing Workshop (HCW) at IPDPS 2002, Lecture Notes in Computer Science, 2002. 5"},{"key":"1_CR17","series-title":"TR","volume-title":"Supporting Priorities and Improving Utilization of the IBM SP2 Scheduler Using Slack-Based Backfilling","author":"D. Talby","year":"1999","unstructured":"D. Talby and D. G. Feitelson. Supporting Priorities and Improving Utilization of the IBM SP2 Scheduler Using Slack-Based Backfilling. TR 98-13, Hebrew University, Jerusalem, April 1999. 1"},{"doi-asserted-by":"crossref","unstructured":"Y. Zhang, H. Franke, J. E. Moreira, and A. Sivasubramaniam. Improving Parallel Job Scheduling by Combining Gang Scheduling and Backfilling Techniques. In D.G. Feitelson and L. Rudolph, editor, Proceedings of the 14th International Conference on Parallel and Distributed Processing Symposium (IPDPS-00), pages 133\u2013144. Springer Verlag, 2000. 10","key":"1_CR18","DOI":"10.1109\/IPDPS.2000.845975"},{"doi-asserted-by":"crossref","unstructured":"Y. Zhang, H. Franke, J. E. Moreira, and A. Sivasubramaniam. An Integrated Approach to Parallel Scheduling Using Gang-Scheduling, Back.lling, and Migration. In D.G. Feitelson and L. Rudolph, editor, Proc. of 7th Workshop on Job Scheduling Strategies for Parallel Processing, volume 2221, pages 133\u2013158. Springer Verlag, 2001. 1","key":"1_CR19","DOI":"10.1007\/3-540-45540-X_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-36180-4_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:05:14Z","timestamp":1737396314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36180-4_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001720","9783540361800"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/3-540-36180-4_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]}}}