{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:21:34Z","timestamp":1725488494189},"publisher-location":"Berlin, Heidelberg","reference-count":10,"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_10","type":"book-chapter","created":{"date-parts":[[2007,8,11]],"date-time":"2007-08-11T09:42:51Z","timestamp":1186825371000},"page":"154-173","source":"Crossref","is-referenced-by-count":15,"title":["The Influence of the Structure and Sizes of Jobs on the Performance of Co-allocation"],"prefix":"10.1007","author":[{"given":"Anca I.D.","family":"Bucur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dick H.J.","family":"Epema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"10_CR1","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":"Aida, K., Kasahara, H., Narita, S.: Job Scheduling Scheme for Pure Space Sharing Among Rigid Jobs. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1459 (1998) 98\u2013 121"},{"key":"10_CR2","unstructured":"Bal, H.E., Plaat, A., Bakker, M.G., Dozy, P., Hofman, R.F.H.: Optimizing Parallel Applications forWide-Area Clusters. Proceedings of the 12th International Parallel Processing Symposium (IPPS\u201998) (1998) 784\u2013 790"},{"key":"10_CR3","series-title":"Lect Notes Comput Sci","first-page":"139\u2013 165","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"T.B. Brecht","year":"1997","unstructured":"Brecht, T.B.: An Experimental Evaluation of Processor Pool-Based Scheduling for Shared-Memory NUMA multiprocessors. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1291 (1997) 139\u2013 165"},{"key":"10_CR4","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":"Feitelson, D.G., Rudolph, L.: Toward Convergence in Job Schedulers for Parallel Supercomputers. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1162 (1996) 1\u2013 26"},{"key":"10_CR5","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1\u2013 34","DOI":"10.1007\/3-540-63574-2","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1997","unstructured":"Feitelson, D.G., Rudolph, L.: Theory and Practice in Parallel Job Scheduling. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1291 (1997) 1\u2013 34"},{"key":"10_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"238\u2013 261","DOI":"10.1007\/3-540-63574-2","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1997","unstructured":"Feitelson, D.G., Jette, M.A.: Improved Utilization and Responsiveness withGang Scheduling. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1291 (1997) 238\u2013 261"},{"key":"10_CR7","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":"Feitelson, D.G.: Packing Schemes for Gang Scheduling. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1162 (1996) 89\u2013 110"},{"key":"10_CR8","series-title":"Lect Notes Comput Sci","first-page":"1\u2013 16","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"J. Patton Jones","year":"1999","unstructured":"Patton Jones, J., Nitzberg, B.: Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1659 (1999) 1\u2013 16"},{"key":"10_CR9","unstructured":"Kielmann, T., Hofman, R.F.H., Bal, H.E., Plaat, A., Bhoedjang, R.A.F.: MagPIe: MPI\u2019s Collective Communication Operations for Clustered Wide Area Systems. ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (PPoPP\u201999) (1999) 131\u2013 140"},{"key":"10_CR10","doi-asserted-by":"crossref","unstructured":"Subhlok, J., Gross, T., Suzuoka, T.: Impact of Job Mix on Optimizations for Space Sharing Schedulers. Supercomputing \u201996 (1996)","DOI":"10.1145\/369028.369144"}],"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_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T23:02:21Z","timestamp":1556751741000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-39997-6_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540411208","9783540399971"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/3-540-39997-6_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]}}}