{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T16:10:23Z","timestamp":1742400623586},"publisher-location":"Berlin, Heidelberg","reference-count":11,"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_6","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T05:42:51Z","timestamp":1186810971000},"page":"74-86","source":"Crossref","is-referenced-by-count":5,"title":["Resource Allocation Schemes for Gang Scheduling"],"prefix":"10.1007","author":[{"given":"Bing Bing","family":"Zhou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Walsh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Richard P.","family":"Brent","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"A. B. Downey, A parallel workload model and its implications for processor allocation, Proceedings of 6th International Symposium on High Performance Distributed Computing, Aug 1997.","DOI":"10.1109\/HPDC.1997.622368"},{"key":"6_CR2","unstructured":"D. G. Feitelson, Packing schemes for gang scheduling, In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Lecture Notes Computer Science, Vol. 1162, Springer-Verlag, 1996, pp.89\u2013110."},{"issue":"5","key":"6_CR3","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1109\/2.53356","volume":"23","author":"D. G. Feitelson","year":"1990","unstructured":"D. G. Feitelson and L. Rudolph, Distributed hierarchical control for parallel processing, Computer, 23(5), May 1990, pp.65\u201377.","journal-title":"Computer"},{"key":"6_CR4","volume-title":"Job scheduling for parallel supercomputers, in Encyclopedia of Computer Science and Technology","author":"D. G. Feitelson","year":"1998","unstructured":"D. G. Feitelson and L. Rudolph, Job scheduling for parallel supercomputers, in Encyclopedia of Computer Science and Technology, Vol. 38, Marcel Dekker, Inc, New York, 1998."},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1016\/0743-7315(92)90014-E","volume":"16","author":"D. G. Feitelson","year":"1992","unstructured":"D. G. Feitelson and L. Rudolph, Gang scheduling performance bene.ts for.negrained synchronisation, Journal of Parallel and Distributed Computing, 16(4), Dec. 1992, pp.306\u2013318.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"6_CR6","unstructured":"V. Lo, J. Mache and K. Windisch, A comparative study of real workload traces and synthetic workload models for parallel job scheduling, In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), Lecture Notes Computer Science, Vol. 1459, Springer-Verlag, 1998, pp.25\u201346."},{"key":"6_CR7","unstructured":"J. K. Ousterhout, Scheduling techniques for concurrent systems, Proceedings of Third International Conference on Distributed Computing Systems, May 1982, pp.20\u201330."},{"issue":"6","key":"6_CR8","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1145\/359605.359626","volume":"20","author":"J. L. Peterson","year":"1977","unstructured":"J. L. Peterson and T. A. Norman, Buddy systems, Comm. ACM, 20(6), June 1977, pp.421\u2013431.","journal-title":"Comm. ACM"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"J. Skovira, W. Chan, H. Zhou and D. Lifka, The EASY-LoadLeveler API project, In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (Eds.), Lecture Notes Computer Science, Vol. 1162, Springer-Verlag, 1996.","DOI":"10.1007\/BFb0022286"},{"key":"6_CR10","unstructured":"K. Suzaki, H. Tanuma, S. Hirano, Y. Ichisugi and M. Tukamoto, Time sharing systems that use a partitioning algorithm on mesh-connected parallel computers, Proceedings of the Ninth International Conference on Distributed Computing Systems, 1996, pp.268\u2013275."},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"B. B. Zhou, R. P. Brent, C. W. Johnson and D. Walsh, Job repacking for enhancing the performance of gang scheduling, Proceedings of 5th Workshop on Job Scheduling Strategies for Parallel Processing, San Juan, April 1999, pp.129\u2013143.","DOI":"10.1007\/3-540-47954-6_7"}],"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_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T03:20:52Z","timestamp":1550719252000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39997-6_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411208","9783540399971"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/3-540-39997-6_6","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}