{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T19:10:02Z","timestamp":1737400202786,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540679561"},{"type":"electronic","value":"9783540445203"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44520-x_34","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T03:51:43Z","timestamp":1188359503000},"page":"252-261","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Memory Management Techniques for Gang Scheduling"],"prefix":"10.1007","author":[{"given":"William","family":"Leinberger","sequence":"first","affiliation":[]},{"given":"George","family":"Karypis","sequence":"additional","affiliation":[]},{"given":"Vipin","family":"Kumar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2000,8,18]]},"reference":[{"key":"34_CR1","unstructured":"A. Batat and D.G. Feitelson. Gang scheduling with memory considerations. In Proceedings of the ISPDP\u2019 2000. IEEE Computer Society, May 2000."},{"key":"34_CR2","doi-asserted-by":"crossref","unstructured":"D.C. Burger, R.S. Hyder, B.P. Miller, and D.A. Wood. Paging tradeoffs in distributed-shared-memory multiprocessors. In Supercomputing\u2019 94, 1994.","DOI":"10.1145\/602770.602869"},{"key":"34_CR3","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BFb0022283","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1996","unstructured":"D.G. Feitelson. Packing schemes for gang scheduling. In D.G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 1162, pages 65\u201388. Springer-Verlag, New York, 1996. LNCS."},{"key":"34_CR4","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/3-540-63574-2_17","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1997","unstructured":"D.G. Feitelson. Memory usage in the lanl cm-5 workload. In D.G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 1291, pages 78\u201394. Springer-Verlag, New York, 1997. LNCS."},{"key":"34_CR5","series-title":"Lect Notes Comput Sci","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 D.G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 1291. Springer-Verlag, New York, 1997. LNCS."},{"key":"34_CR6","doi-asserted-by":"crossref","unstructured":"D.G. Feitelson and L. Rudolph. Evaluation of design choices for gang scheduling using distributed hierarchical control. J. of Parallel and Distr. Comp., 1996.","DOI":"10.1006\/jpdc.1996.0064"},{"key":"34_CR7","doi-asserted-by":"crossref","unstructured":"D.G. Feitelson and A.M. Weil. Utilization and predictability in scheduling the ibm sp2 with backfilling. In Proceedings of the IPPS\/SPDP 1998, pages 542\u2013546. IEEE Computer Society, 1998.","DOI":"10.1109\/IPPS.1998.669970"},{"key":"34_CR8","doi-asserted-by":"crossref","unstructured":"H. Franke, J. Jann, J.E. Moreira, and P. Pattnaik. An evaluation of parallel job scheduling for asci blue-pacific. In Supercomputing\u2019 99, November 1999.","DOI":"10.1145\/331532.331577"},{"key":"34_CR9","unstructured":"J.K. Ousterhout. Scheduling techniques for concurrent systems. In 3rd Intl. Conf. Distributed Computing Systems, pages 22\u201330, Oct 1982."},{"key":"34_CR10","doi-asserted-by":"crossref","unstructured":"V.G.J. Peris, M.S. Squillante, and V.K. Naik. Analysis of the impact of memory in distributed parallel processing systems. In Proc. of the ACM SIGMETRICS Conf. on Measurement and Modeling of Computer Systems, pages 5\u201318, 1994.","DOI":"10.1145\/183018.183021"},{"key":"34_CR11","series-title":"Lect Notes Comput Sci","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"U. Schwiegelshohn","year":"1998","unstructured":"U. Schwiegelshohn and R. Yahyapour. Improving first-come-first-serve job scheduling by gang scheduling. In D.G. Feitelson and L. Rudolph, editors, Job Scheduling Strategies for Parallel Processing, volume 1459. Springer-Verlag, New York, March 1998. LNCS."},{"key":"34_CR12","doi-asserted-by":"crossref","unstructured":"S. Setia, M.S. Squillante, and V.K. Naik. The impact of job memory requirements on gang-scheduling performance. Technical Report RC 21373, IBM T.J.Watson Research Center, March 1999.","DOI":"10.1145\/309746.309751"},{"key":"34_CR13","unstructured":"Y. Zhang, H. Franke, J.E. Moreira, and A. Sivasubramaniam. Improving parallel job scheduling by combining gang scheduling and backfilling techniques. Technical Report RC 21579, IBM T.J.Watson Research Center, October 1999."}],"container-title":["Lecture Notes in Computer Science","Euro-Par 2000 Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44520-X_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,20]],"date-time":"2025-01-20T18:35:57Z","timestamp":1737398157000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44520-X_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540679561","9783540445203"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/3-540-44520-x_34","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"18 August 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}