{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T22:40:02Z","timestamp":1752360002734,"version":"3.41.2"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2000,12,1]],"date-time":"2000-12-01T00:00:00Z","timestamp":975628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cluster Computing"],"published-print":{"date-parts":[[2000,12]]},"DOI":"10.1023\/a:1019044623636","type":"journal-article","created":{"date-parts":[[2003,2,19]],"date-time":"2003-02-19T17:49:22Z","timestamp":1045676962000},"page":"245-254","source":"Crossref","is-referenced-by-count":19,"title":["Attacking the bottlenecks of backfilling schedulers"],"prefix":"10.1007","volume":"3","author":[{"given":"Peter J.","family":"Keleher","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dmitry","family":"Zotkin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dejan","family":"Perkovic","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"327475_CR1","unstructured":"D. Feitelson and A. Weil, Utilization and predictability in scheduling in IBM SP2 with backfilling, in: Proceedings of the 12th International Parallel Processing Symposium (1998)."},{"key":"327475_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-63574-2","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1997","unstructured":"D.G. Feitelson and M.A. Jette, Improved utilization and responsiveness with gang scheduling, in: Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science (Springer, Berlin, 1997)."},{"key":"327475_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-63574-2","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1997","unstructured":"D.G. Feitelson, L. Rudolph, U. Schwiegelshohn, K.C. Sevcik and P. Wong, Theory and practice in parallel job scheduling, in: Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science (Springer, Berlin, 1997)."},{"key":"327475_CR4","doi-asserted-by":"crossref","unstructured":"J.K. Hollingsworth and S. Maneewongvatana, Imprecise calendars: an approach to scheduling computational grids, in: The 8th High Performance Distributed Computing Conference (1999) pp. 352\u2013359.","DOI":"10.1109\/ICDCS.1999.776537"},{"key":"327475_CR5","series-title":"Lecture Notes in Computer Science","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D. Lifka","year":"1995","unstructured":"D. Lifka, The ANL\/IBM SP scheduling system, in: Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science (Springer, Berlin, 1995)."},{"key":"327475_CR6","doi-asserted-by":"crossref","unstructured":"C. McCann, R. Vaswani and J. Zahorjan, A dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors, ACM Transactions on Computer Systems 11(2) (1997).","DOI":"10.1145\/151244.151246"},{"key":"327475_CR7","series-title":"Lecture Notes in Computer Science","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"J. Skovira","year":"1996","unstructured":"J. Skovira, W. Chan, H. Zhou and D. Lifka, The EASY-LoadLeveler API project, in: Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science (Springer, Berlin, 1996)."},{"key":"327475_CR8","unstructured":"D. Talby and D.G. Feitelson, Supporting priorities and improving utilization of the IBM SP scheduler using slack-based backfilling, in: Proceedings of the 13th International Parallel Processing Symposium (1999)."}],"container-title":["Cluster Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019044623636.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1019044623636\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1019044623636.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,12]],"date-time":"2025-07-12T21:58:56Z","timestamp":1752357536000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1019044623636"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,12]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2000,12]]}},"alternative-id":["327475"],"URL":"https:\/\/doi.org\/10.1023\/a:1019044623636","relation":{},"ISSN":["1386-7857","1573-7543"],"issn-type":[{"type":"print","value":"1386-7857"},{"type":"electronic","value":"1573-7543"}],"subject":[],"published":{"date-parts":[[2000,12]]}}}