{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T19:23:20Z","timestamp":1781292200612,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540648253","type":"print"},{"value":"9783540685364","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0053987","type":"book-chapter","created":{"date-parts":[[2006,7,6]],"date-time":"2006-07-06T14:59:07Z","timestamp":1152197947000},"page":"180-198","source":"Crossref","is-referenced-by-count":37,"title":["Improving first-come-first-serve job scheduling by gang scheduling"],"prefix":"10.1007","author":[{"given":"Uwe","family":"Schwiegeishohn","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ramin","family":"Yahyapour","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"10_CR1","doi-asserted-by":"crossref","unstructured":"S.-H. Chiang, R.K. Masharamani, and M.K. Vernon. Use of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies. In Proceedings of ACM SIGMETRICS Conference on Measurement of Computer Systems, pages 33\u201344, 1994.","DOI":"10.1145\/183018.183023"},{"key":"10_CR2","doi-asserted-by":"crossref","unstructured":"D.G. Feitelson. Packing schemes for gang scheduling. In D.G. Feitelson and L. Rudolph, editors, IPPS'96 Workshop: Job Scheduling Strategies for Parallel Processing, pages 89\u2013110. Springer-Verlag, Lecture Notes in Computer Science LNCS 1162, 1996.","DOI":"10.1007\/BFb0022289"},{"key":"10_CR3","doi-asserted-by":"crossref","unstructured":"D.G. Feitelson and M.A. Jette. Improved utilization and responsiveness with gang scheduling. In D.G. Feitelson and L. Rudolph, editors, IPPS'97 Workshop: Job Scheduling Strategies for Parallel Processing, pages 238\u2013261. Springer-Verlag, Lecture Notes in Computer Science LNCS 1291, 1997.","DOI":"10.1007\/3-540-63574-2_24"},{"key":"10_CR4","doi-asserted-by":"crossref","unstructured":"D.G. Feitelson and B. Nitzberg. Job characteristics of a production parallel scientific workload on the NASA Ames iPSC\/860. In D.G. Feitelson and L. Rudolph, editors, IPPS'95 Workshop: Job Scheduling Strategies for Parallel Processing, pages 337\u2013360. Springer-Verlag, Lecture Notes in Computer Science LNCS 949, 1995.","DOI":"10.1007\/3-540-60153-8_38"},{"key":"10_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 benefits for fine-grain parallelization. Journal of Parallel and Distributed Computing, 16:306\u2013318, 1992.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10_CR6","doi-asserted-by":"crossref","unstructured":"D.G. Feitelson and L. Rudolph. Parallel job scheduling: Issues and approaches. In D.G. Feitelson and L. Rudolph, editors, IPPS'95 Workshop: Job Scheduling Strategies for Parallel Processing, pages 1\u201318. Springer-Verlag, Lecture Notes in Computer Science LNCS 949, 1995.","DOI":"10.1007\/3-540-60153-8"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1006\/jpdc.1996.0064","volume":"35","author":"D.G. Feitelson","year":"1996","unstructured":"D.G. Feitelson and L. Rudolph. Evaluation of design choices for gang scheduling using distributed hierarchical control. Journal of Parallel and Distributed Computing, 35:18\u201334, 1996.","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"10_CR8","doi-asserted-by":"crossref","unstructured":"D.G. Feitelson and L. Rudolph. Towards convergence in job schedulers for parallel supercomputers. In D.G. Feitelson and L. Rudolph, editors, IPPS'96 Workshop: Job Scheduling Strategies for Parallel Processing, pages 1\u201326. Springer-Verlag, Lecture Notes in Computer Science LNCS 1162, 1996.","DOI":"10.1007\/BFb0022284"},{"key":"10_CR9","doi-asserted-by":"crossref","unstructured":"D.G. Feitelson, L. Rudolph, U. Schwiegeishohn, K.C. Sevcik, and P. Wong. Theory and practice in parallel job scheduling. In D.G. Feitelson and L. Rudolph, editors, IPPS'97 Workshop: Job Scheduling Strategies for Parallel Processing, pages 1\u201334. Springer-Verlag, Lecture Notes in Computer Science LNCS 1291, 1997.","DOI":"10.1007\/3-540-63574-2_14"},{"key":"10_CR10","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0304-3975(94)90152-X","volume":"130","author":"A. Feldmann","year":"1994","unstructured":"A. Feldmann, J. Sgall, and S.-H. Teng. Dynamic scheduling on parallel machines. Theoretical Computer Science, 130:49\u201372, 1994.","journal-title":"Theoretical Computer Science"},{"key":"10_CR11","doi-asserted-by":"crossref","unstructured":"H. Franke, P. Pattnaik, and L. Rudolph. Gang scheduling for highly efficient distributed multiprocessor systems. In Proceedings of the 6 th Symp. on the Frontiers of Massively Parallel Computation, pages 1\u20139, 1996.","DOI":"10.1109\/FMPC.1996.558056"},{"issue":"2","key":"10_CR12","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1137\/0204015","volume":"4","author":"M. Garey","year":"1975","unstructured":"M. Garey and R.L. Graham. Bounds for multiprocessor scheduling with resource constraints. SIAM Journal on Computing, 4(2):187\u2013200, June 1975.","journal-title":"SIAM Journal on Computing"},{"key":"10_CR13","doi-asserted-by":"crossref","unstructured":"S. Hotovy. Workload evolution on the Cornell Theory Center IBM SP2. In D.G. Feitelson and L. Rudolph, editors, IPPS'96 Workshop: Job Scheduling Strategies for Parallel Processing, pages 27\u201340. Springer-Verlag, Lecture Notes in Computer Science LNCS 1162, 1996.","DOI":"10.1007\/BFb0022285"},{"key":"10_CR14","doi-asserted-by":"crossref","unstructured":"J. Jann, P. Pattnaik, H. Franke, F. Wang, J. Skovira, and J. Riordan. Modeling of workload in MPPs. In D.G. Feitelson and L. Rudolph, editors, IPPS'97 Workshop: Job Scheduling Strategies for Parallel Processing, pages 94\u2013116. Springer-Verlag, Lecture Notes in Computer Science LNCS 1291, 1997.","DOI":"10.1007\/3-540-63574-2_18"},{"issue":"4","key":"10_CR15","doi-asserted-by":"publisher","first-page":"1119","DOI":"10.1137\/0215081","volume":"15","author":"T. Kawaguchi","year":"1986","unstructured":"T. Kawaguchi and S. Kyan. Worst case bound of an LRF schedule for the mean weighted flow-time problem. SIAM Journal on Computing, 15(4):1119\u20131129, November 1986.","journal-title":"SIAM Journal on Computing"},{"key":"10_CR16","doi-asserted-by":"crossref","unstructured":"S. Leonardi and D. Raz. Approximating total flow time on parallel machines. In Proceedings of the 29 th ACM Symposium on the Theory of Computing, pages 110\u2013119, May 1997.","DOI":"10.1145\/258533.258562"},{"key":"10_CR17","doi-asserted-by":"crossref","unstructured":"D.A. Lifka. The ANL\/IBM SP scheduling system. In D.G. Feitelson and L. Rudolph, editors, IPPS'95 Workshop: Job Scheduling Strategies for Parallel Processing, pages 295\u2013303. Springer-Verlag, Lecture Notes in Computer Science LNCS 949, 1995.","DOI":"10.1007\/3-540-60153-8_35"},{"key":"10_CR18","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/3-540-61680-2_45","volume":"1136","author":"U. Schwiegelshohn","year":"1996","unstructured":"U. Schwiegelshohn. Preemptive weighted completion time scheduling of parallel jobs. In Proceedings of the 4 th Annual European Symposium on Algorithms (ESA96), pages 39\u201351. Springer-Verlag Lecture Notes in Computer Science LNCS 1136, September 1996.","journal-title":"Springer-Verlag Lecture Notes in Computer Science LNCS"},{"key":"10_CR19","doi-asserted-by":"crossref","unstructured":"Uwe Schwiegeishohn and Ramin Yahyapour. Analysis of First-Come-First-Serve Parallel Job Scheduling. In Proceedings of the 9 th SIAM Symposium on Discrete Algorithms, pages 629\u2013638, January 1998.","DOI":"10.1007\/BFb0053987"},{"key":"10_CR20","doi-asserted-by":"crossref","unstructured":"F. Wang, H. Franke, M. Papaefthymiou, P. Pattnaik, L. Rudolph, and M.S. Squillante. A gang scheduling design for multiprogrammed parallel computing environments. In D.G. Feitelson and L. Rudolph, editors, IPPS'96 Workshop: Job Scheduling Strategies for Parallel Processing, pages 111\u2013125. Springer-Verlag, Lecture Notes in Computer Science LNCS 1162, 1996.","DOI":"10.1007\/BFb0022290"},{"key":"10_CR21","doi-asserted-by":"crossref","unstructured":"F. Wang, M. Papaefthymiou, and M.S. Squillante. Performance evaluation of gang scheduling for parallel and distributed multiprogramming. In D.G. Feitelson and L. Rudolph, editors, IPPS'97 Workshop: Job Scheduling Strategies for Parallel Processing, pages 277\u2013298. Springer-Verlag, Lecture Notes in Computer Science LNCS 1291, 1997.","DOI":"10.1007\/3-540-63574-2_26"}],"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\/BFb0053987","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T21:22:52Z","timestamp":1555708972000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0053987"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540648253","9783540685364"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/bfb0053987","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998]]}}}