{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T05:48:38Z","timestamp":1757310518362},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540411208"},{"type":"electronic","value":"9783540399971"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-39997-6_1","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T09:42:51Z","timestamp":1186825371000},"page":"1-17","source":"Crossref","is-referenced-by-count":21,"title":["Effect of Job Size Characteristics on Job Scheduling Performance"],"prefix":"10.1007","author":[{"given":"Kento","family":"Aida","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"1_CR1","doi-asserted-by":"publisher","first-page":"413\u2013 422","DOI":"10.1109\/71.97898","volume":"2","author":"K. Li","year":"1991","unstructured":"K. Li and K. Cheng. Job Scheduling in a Partitionable Mesh Using a Two-Dimensional Buddy System Partitioning Scheme. IEEE Trans. on Parallel and Distributed Systems, 2(4):413\u2013 422, 1991.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"1_CR2","series-title":"Lect Notes Comput Sci","first-page":"295\u2013 303","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D. A. Lifka","year":"1995","unstructured":"D. A. Lifka. The ANL\/IBM SP Scheduling System. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 949, pages 295\u2013 303. Springer-Verlag, 1995."},{"key":"1_CR3","series-title":"Lect Notes Comput Sci","first-page":"41\u2013 47","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"J. S. Skovira","year":"1996","unstructured":"J. S. Skovira, W. Chan, and H. Zhou. The EASY-LoadLev eler API Project. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1162, pages 41\u2013 47. Springer-Verlag, 1996."},{"issue":"5","key":"1_CR4","doi-asserted-by":"publisher","first-page":"488\u2013 497","DOI":"10.1109\/71.282559","volume":"5","author":"P. Krueger","year":"1994","unstructured":"P. Krueger, T. Lai, and V. A. Dixit-Radiya. Job Scheduling Is More Important than Processor Allocation for Hypercube Computers. IEEE Trans. on Parallel and Distributed Systems, 5(5):488\u2013 497, 1994.","journal-title":"IEEE Trans. on Parallel and Distributed Systems"},{"key":"1_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"89\u2013 110","DOI":"10.1007\/BFb0022283","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D. G. Feitelson","year":"1996","unstructured":"D. G. Feitelson. Packing Scheme for Gang Scheduling. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1162, pages 89\u2013 110. Springer-Verlag, 1996."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"J. Subhlok, T. Gross, and T Suzuoka. Impact of Job Mix on Optimizations for Space Sharing Scheduler. In Proc. of Supercomputing \u201996, 1996.","DOI":"10.1145\/369028.369144"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"A. B. Downey. A parallel workload model and its implications for processor allocation. In Proc. the 6th International Symposium of High Performance Distributed Computing, pages 112\u2013 123, 1997.","DOI":"10.1109\/HPDC.1997.622368"},{"key":"1_CR8","series-title":"Lect Notes Comput Sci","first-page":"25\u2013 46","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"V. Lo","year":"1999","unstructured":"V. Lo, J. Mache, and K. Windisch. A Comparative Study of Real Workload Traces and Synthetic Workload. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1459, pages 25\u2013 46. Springer-Verlag, 1998."},{"key":"1_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1\u2013 26","DOI":"10.1007\/BFb0022283","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D. G. Feitelson","year":"1996","unstructured":"D. G. Feitelson and L. Rudolph. Toward Convergence in Job Schedulers for Parallel Supercomputers. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1162, pages 1\u2013 26. Springer-Verlag, 1996."},{"key":"1_CR10","series-title":"Lect Notes Comput Sci","first-page":"58\u2013 77","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"R. Gibbons","year":"1997","unstructured":"R. Gibbons. A Historical Application Profiler for Use by Parallel Schedulers. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1291, pages 58\u2013 77. Springer-Verlag, 1997."},{"key":"1_CR11","series-title":"Lect Notes Comput Sci","first-page":"98\u2013 121","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"K. Aida","year":"1998","unstructured":"K. Aida, H. Kasahara, and S. Narita. Job Scheduling Scheme for Pure Space Sharing Among Rigid Jobs. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1459, pages 98\u2013 121, 1998."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"H. Franke, J. Jann, J. E. Moreira, P. Pattnaik, and M. A. Jette. An Evaluation of Parallel Job Scheduling for ASCI Blue-Pacific. In Proc. SC99, 1999.","DOI":"10.1145\/331532.331577"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"E. G. Coffman, M. R. Garey, and D. S. Johnson. Approximation Algorithms for Bin-packing-An Updated Survey. In Algorithm Design for Computer System Design, pages 49\u2013 106. Springer-Verlag, 1984.","DOI":"10.1007\/978-3-7091-4338-4_3"},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"406\u2013 428","DOI":"10.1016\/0885-064X(87)90009-4","volume":"3","author":"E. G. Coffman","year":"1987","unstructured":"E. G. Coffman, M. R. Garey, and D. S. Johnson. Bin Packing with Divisible Item Sizes. Journal of Complexity, 3:406\u2013 428, 1987.","journal-title":"Journal of Complexity"}],"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-39997-6_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T10:35:02Z","timestamp":1550745302000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39997-6_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411208","9783540399971"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/3-540-39997-6_1","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}