{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:30:21Z","timestamp":1764783021835},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540001720"},{"type":"electronic","value":"9783540361800"}],"license":[{"start":{"date-parts":[[2002,1,1]],"date-time":"2002-01-01T00:00:00Z","timestamp":1009843200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/3-540-36180-4_6","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T09:27:38Z","timestamp":1188293258000},"page":"88-102","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":27,"title":["Scheduling Jobs on Parallel Systems Using a Relaxed Backfill Strategy"],"prefix":"10.1007","author":[{"suffix":"Jr.","given":"William A.","family":"Ward","sequence":"first","affiliation":[]},{"given":"Carrie L.","family":"Mahood","sequence":"additional","affiliation":[]},{"given":"John E.","family":"West","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,11,27]]},"reference":[{"key":"6_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"98","DOI":"10.1007\/BFb0053983","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"K. Aida","year":"1998","unstructured":"Aida, K., Kasahara, H., Narita, S.: Job scheduling scheme for pure space sharing among rigid jobs. In Feitelson, D.G., Rudolph, L., eds.: Job Scheduling Strategies for Parallel Processing. Volume 1459 of Lecture Notes in Computer Science., Berlin Heidelberg New York, Springer-Verlag (1998) 98\u2013121 89"},{"key":"6_CR2","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"58","DOI":"10.1007\/3-540-63574-2_16","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"R. Gibbons","year":"1997","unstructured":"Gibbons, R.: A historical application profiler for use by parallel schedulers. In Feitelson, D. G., Rudolph, L., eds.: Job Scheduling Strategies for Parallel Processing. Volume 1291 of Lecture Notes in Computer Science., Berlin Heidelberg New York, Springer-Verlag (1997) 58\u201377 89"},{"key":"6_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1007\/3-540-63574-2_21","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"E.W. Parsons","year":"1997","unstructured":"Parsons, E.W., Sevcik, K.C.: Implementing multiprocessor scheduling disciplines. In Feitelson, D. G., Rudolph, L., eds.: Job Scheduling Strategies for Parallel Processing. Volume 1291 of Lecture Notes in Computer Science., Berlin Heidelberg New York, Springer-Verlag (1997) 166\u2013192 89"},{"key":"6_CR4","volume-title":"An Operating System Vade Mecum","author":"R. Finkel","year":"1988","unstructured":"Finkel, R.: An Operating System Vade Mecum. Prentice-Hall, Englewood Cliffs, New Jersey (1988) 89"},{"key":"6_CR5","unstructured":"Talby, D., Feitelson, D. G.: Supporting priorities and improving utilization of the IBMS P2 scheduler using slack-based backfilling. In: 13th Intl. Parallel Processing Symp. (1999) 513\u2013517 89, 90"},{"key":"6_CR6","unstructured":"Feitelson, D.G.: A survey of scheduling in multiprogrammed parallel systems. Research Report RC 19790 (87657), IBMT. J. Watson Research Center (1994) 89"},{"key":"6_CR7","unstructured":"Intel Corp.: iPSC\/860 Multi-User Accounting, Control, and Scheduling Utilities Manual. (1992) Order Number 312261-002. 89"},{"key":"6_CR8","unstructured":"Das Sharma, D., Pradhan, D. K.: Job scheduling in mesh multicomputers. In: Intl. Conf. Parallel Processing. Volume II. (1994) 1\u201318 89"},{"key":"6_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/3-540-45540-X_6","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D. Jackson","year":"2001","unstructured":"Jackson, D., Snell, Q., Clement, M.: Core algorithms of the Maui scheduler. In Feitelson, D. G., Rudolph, L., eds.: Job Scheduling Strategies for Parallel Processing. Volume 2221 of Lecture Notes in Computer Science., Berlin Heidelberg New York, Springer-Verlag (2001) 87\u2013102 89"},{"key":"6_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/3-540-45540-X_9","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"Y. Zhang","year":"2001","unstructured":"Zhang, Y., Franke, H., Moreira, J. E., Sivasubramanian, A.: An integrated approach to parallel scheduling using gang-scheduling, backfill, and migration. In Feitelson, D. G., Rudolph, L., eds.: Job Scheduling Strategies for Parallel Processing. Volume 2221 of Lecture Notes in Computer Science., Berlin Heidelberg New York, Springer-Verlag (2001) 133\u2013158 89"},{"key":"6_CR11","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/3-540-60153-8_35","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D. A. Lifka","year":"1995","unstructured":"Lifka, D. A.: The ANL\/IBMSP scheduling system. In Feitelson, D.G., Rudolph, L., eds.: Job Scheduling Strategies for Parallel Processing. Volume 949 of Lecture Notes in Computer Science., Berlin Heidelberg New York, Springer-Verlag (1995) 295\u2013303 89"},{"key":"6_CR12","volume-title":"Introduction to Algorithms","author":"T.H. Cormen","year":"1990","unstructured":"Cormen, T.H., Leiserson, C. E., Rivest, R. L.: Introduction to Algorithms. MIT Press, Cambridge, Massachusetts (1990) 90"},{"key":"6_CR13","volume-title":"Algorithms from P to NP","author":"B. M.E. Moret","year":"1991","unstructured":"Moret, B. M.E., Shapiro, H.D.: Algorithms from P to NP. Benjamin\/Cummings, Redwood City, California (1991) 90"},{"key":"6_CR14","unstructured":"Zotkin, D., Keleher, P. J.: Job-length estimation and performance in backfilling schedulers. In: 8th High Performance Distributed Computing Conf., IEEE (1999) 90, 96"},{"key":"6_CR15","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1023\/A:1019044623636","volume":"3","author":"D. Zotkin","year":"2000","unstructured":"Zotkin, D., Keleher, P. J., Perkovic, D.: Attacking the bottlenecks of backfilling schedulers. Cluster Computing 3 (2000) 245\u2013254 90, 96","journal-title":"Cluster Computing"}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-36180-4_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,29]],"date-time":"2020-01-29T07:48:45Z","timestamp":1580284125000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-36180-4_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9783540001720","9783540361800"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-36180-4_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2002]]},"assertion":[{"value":"27 November 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}