{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:18:16Z","timestamp":1725484696079},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428176"},{"type":"electronic","value":"9783540455400"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45540-x_5","type":"book-chapter","created":{"date-parts":[[2007,6,1]],"date-time":"2007-06-01T04:37:01Z","timestamp":1180672621000},"page":"66-86","source":"Crossref","is-referenced-by-count":15,"title":["The Influence of Communication on the Performance of Co-allocation"],"prefix":"10.1007","author":[{"given":"A.I.D.","family":"Bucur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.H.J.","family":"Epema","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,19]]},"reference":[{"key":"5_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":"K. Aida, H. Kasahara and S. Narita. Job SchedulingScheme for Pure Space SharingAmong Rigid Jobs. In Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1459, pages 98\u2013121. Springer-Verlag, 1998."},{"key":"5_CR2","doi-asserted-by":"crossref","unstructured":"A.H. Alhusaini, V.K. Prasanna, and C.S. Raghavendra, A Framework for Mapping with Resource Co-Allocation in Heterogeneous Computing Systems, Proc. 9th Heterogeneous ComputingW orkshop (HCW2000), C.S. Raghavendra (ed.), pp. 273\u2013286, 2000.","DOI":"10.1109\/HCW.2000.843751"},{"key":"5_CR3","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 (1998) 784\u2013790"},{"key":"5_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/3-540-63574-2_20","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 Schedulingfor Shared-Memory NUMA multiprocessors. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1291 Springer-Verlag (1997) 139\u2013165"},{"issue":"4","key":"5_CR5","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/506106.506115","volume":"34","author":"H.E. Bal","year":"2000","unstructured":"Bal, H.E., et al.: The Distributed ASCI Supercomputer Project. ACM OperatingSystems Review 34(4) (2000) 76\u201396","journal-title":"ACM OperatingSystems Review"},{"key":"5_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0022284","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 Springer-Verlag (1996) 1\u201326"},{"key":"5_CR7","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-63574-2","volume-title":"Theory and Practice in Parallel Job SchedulingJob Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1997","unstructured":"Feitelson, D.G., Rudolph, L.: Theory and Practice in Parallel Job SchedulingJob Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1291 Springer-Verlag (1997) 1\u201334"},{"key":"5_CR8","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"238","DOI":"10.1007\/3-540-63574-2_24","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 with GangScheduling. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1291 Springer-Verlag (1997) 238\u2013261"},{"key":"5_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1007\/BFb0022289","volume-title":"Job SchedulingStrategies for Parallel Processing","author":"D.G. Feitelson","year":"1996","unstructured":"Feitelson, D.G.: PackingSchemes for GangScheduling. Job SchedulingStrategies for Parallel Processing, Lecture Notes in Computer Science 1162 Springer-Verlag (1996) 89\u2013110"},{"key":"5_CR10","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-47954-6_1","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 Springer-Verlag (1999) 1\u201316"},{"key":"5_CR11","doi-asserted-by":"crossref","unstructured":"Kielmann, T., Hofman, R.F.H., Bal, H.E., Plaat, A., Bhoedjang, R.A.F.: MagPIe: MPI\u2019s Collective Communication Operations for ClusteredWide Area Systems. ACMSIGPLAN Symposium on Principles and Practice of Parallel Programming (1999) 131\u2013140","DOI":"10.1145\/301104.301116"},{"key":"5_CR12","unstructured":"Leinberger, W., Karypis, G., Kumar, V.: Milti-Capacity Bin Packing Algorithms with Applications to Job Schedulingunder Multiple Constraints. Proc. 1999 Int\u2019l Conference on Parallel Processing(1999) 404\u2013412"},{"key":"5_CR13","unstructured":"Foster, I., Kesselman, C. (eds): The Grid: Blueprint for a New ComputingInfrastructure. Morgan Kaufmann (1999)"},{"key":"5_CR14","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1007\/3-540-39997-6_9","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"Q. Snell","year":"2000","unstructured":"Snell, Q., Clement, M., Jackson, D., Gregory, C.: The Performance Impact of Advance Reservation Meta-Scheduling. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1911 Springer-Verlag (2000) 137\u2013153"},{"key":"5_CR15","series-title":"Lect Notes Comput Sci","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/3-540-39997-6_10","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"A.I.D. Bucur","year":"2000","unstructured":"Bucur, A.I.D., Epema, D.H.J: The Influence of the Structure and Sizes of Jobs on the Performance of Co-Allocation. Job Scheduling Strategies for Parallel Processing, Lecture Notes in Computer Science 1911 Springer-Verlag (2000) 154\u2013173"}],"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-45540-X_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,17]],"date-time":"2019-02-17T02:11:15Z","timestamp":1550369475000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45540-X_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428176","9783540455400"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/3-540-45540-x_5","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}