{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T19:56:05Z","timestamp":1762458965109},"publisher-location":"Berlin, Heidelberg","reference-count":33,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540635741"},{"type":"electronic","value":"9783540695998"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/3-540-63574-2_24","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T23:30:02Z","timestamp":1330299002000},"page":"238-261","source":"Crossref","is-referenced-by-count":105,"title":["Improved utilization and responsiveness with gang scheduling"],"prefix":"10.1007","author":[{"given":"Dror G.","family":"Feitelson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Morris A.","family":"Jettee","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,7,12]]},"reference":[{"key":"11_CR1","doi-asserted-by":"crossref","unstructured":"G. Alverson, S. Kahan, R. Korry, C. McCann, and B. Smith, \u201cScheduling on the Tera MTA\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 19\u201344, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_21"},{"key":"11_CR2","unstructured":"Cray Research, Inc., Cray T3D System Architecture Overview. Order number HR-04033, Sep 1993."},{"key":"11_CR3","first-page":"251","volume":"II","author":"D. Sharma Das","year":"1994","unstructured":"D. Das Sharma and D. K. Pradhan, \u201cJob scheduling in mesh multicomputers In Intl. Conf. Parallel Processing, vol. II, pp. 251\u2013258, Aug 1994.","journal-title":"Intl. Conf. Parallel Processing"},{"key":"11_CR4","doi-asserted-by":"crossref","unstructured":"D. G. Feitelson, \u201cPacking schemes for gang scheduling\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 89\u2013110, Springer-Verlag, 1996. Lecture Notes in Computer Science Vol. 1162.","DOI":"10.1007\/BFb0022289"},{"key":"11_CR5","unstructured":"D. G. Feitelson, A Survey of Scheduling in Multiprogrammed Parallel Systems. Research Report RC 19790 (87657), IBM T. J. Watson Research Center, Oct 1994."},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"D. G. Feitelson and B. Nitzberg, \u201cJob characteristics of a production parallel scientific workload on the NASA Ames iPSC\/860\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 337\u2013360, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_38"},{"issue":"5","key":"11_CR7","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, \u201cDistributed hierarchical control for parallel processing\u201d. Computer 23(5), pp. 65\u201377, May 1990.","journal-title":"Computer"},{"issue":"1","key":"11_CR8","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1006\/jpdc.1996.0064","volume":"35","author":"D. G. Feitelson","year":"1996","unstructured":"D. G. Feitelson and L. Rudolph, \u201cEvaluation of design choices for gang scheduling using distributed hierarchical control\u201d. J. Parallel & Distributed Comput. 35(1), pp. 18\u201334, May 1996.","journal-title":"J. Parallel & Distributed Comput."},{"issue":"4","key":"11_CR9","doi-asserted-by":"crossref","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, \u201cGang scheduling performance benefits for finegrain synchronization\u201d. J. Parallel & Distributed Comput. 16(4), pp. 306\u2013318, Dec 1992.","journal-title":"J. Parallel & Distributed Comput."},{"key":"11_CR10","doi-asserted-by":"crossref","unstructured":"D. G. Feitelson and L. Rudolph, \u201cParallel job scheduling: issues and approaches\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 1\u201318, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_20"},{"key":"11_CR11","doi-asserted-by":"crossref","unstructured":"D. G. Feitelson, L. Rudolph, U. Schwiegelshohn, K. C. Sevcik, and P. Wong, \u201cTheory and practice in parallel job scheduling\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer Verlag, 1997. Lecture Notes in Computer Science (this volume).","DOI":"10.1007\/3-540-63574-2_14"},{"key":"11_CR12","first-page":"214","volume":"II","author":"B. Gorda","year":"1995","unstructured":"B. Gorda and R. Wolski, \u201cTime sharing massively parallel machines\u201d. In Intl. Conf. Parallel Processing, vol. II, pp. 214\u2013217, Aug 1995.","journal-title":"Intl. Conf. Parallel Processing"},{"key":"11_CR13","unstructured":"B. C. Gorda and E. D. Brooks III, Gang Scheduling a Parallel Machine. Technical Report UCRL-JC-107020, Lawrence Livermore National Laboratory, Dec 1991."},{"key":"11_CR14","doi-asserted-by":"crossref","unstructured":"R. L. Henderson, \u201cJob scheduling under the portable batch system\u201d In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 279\u2013294, Springer-Verlag, 1995. Lecture Notes in Computer Science Vola 949.","DOI":"10.1007\/3-540-60153-8_34"},{"key":"11_CR15","doi-asserted-by":"crossref","unstructured":"S. Hotovy, \u201cWorkload evolution on the Cornell Theory Center IBM SP2\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 27\u201340, Springer-Verlag, 1996. Lecture Notes in Computer Science Vol. 1162.","DOI":"10.1007\/BFb0022285"},{"key":"11_CR16","unstructured":"Intel Corp., iPSC\/860 Multi-User Accounting, Control, and Scheduling Utilities Manual. Order number 312261-002, May 1992."},{"key":"11_CR17","unstructured":"M. Jette, D. Storch, and E. Yim, \u201cTimesharing the Cray T3D\u201d. In Cray User Group, pp. 247\u2013252, Mar 1996."},{"issue":"1","key":"11_CR18","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0743-7315(91)90032-5","volume":"12","author":"K. Li","year":"1991","unstructured":"K. Li and K-H. Cheng, \u201cA two-dimensional buddy system for dynamic resource allocation in a partitionable mesh connected system\u201d. J. Parallel & Distributed Comput. 12(1), pp. 79\u201383, May 1991.","journal-title":"J. Parallel & Distributed Comput."},{"key":"11_CR19","doi-asserted-by":"crossref","unstructured":"D. Lifka, \u201cThe ANL\/IBM SP scheduling system\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 295-\u2013303, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_35"},{"issue":"2","key":"11_CR20","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1145\/151244.151246","volume":"11","author":"C. McCann","year":"1993","unstructured":"C. McCann, R. Vaswani, and J. Zahorjan, \u201cA dynamic processor allocation policy for multiprogrammed shared-memory multiprocessors\u201d. ACM Trans. Comput. Syst. 11(2), pp. 146\u2013178, May 1993.","journal-title":"ACM Trans. Comput. Syst."},{"key":"11_CR21","doi-asserted-by":"crossref","unstructured":"C. McCann and J. Zahorjan, \u201cScheduling memory constrained jobs on distributed memory parallel computers\u201d. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 208\u2013219, May 1995.","DOI":"10.1145\/223586.223610"},{"key":"11_CR22","unstructured":"J. K. Ousterhout, \u201cScheduling techniques for concurrent systems\u201d. In 3rd Intl. Conf. Distributed Comput. Syst., pp. 22\u201330, Oct 1982."},{"key":"11_CR23","doi-asserted-by":"crossref","unstructured":"E. W. Parsons and K. C. Sevcik, \u201cMultiprocessor scheduling for high-variability service time distributions\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 127\u2013145, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_26"},{"issue":"8","key":"11_CR24","doi-asserted-by":"crossref","first-page":"736","DOI":"10.1109\/TC.1973.5009152","volume":"C-22","author":"R. C. Regis","year":"1973","unstructured":"R. C. Regis, \u201cMultiserver queueing models of multiprocessing systems\u201d. IEEE Trans. Comput. C-22(8), pp. 736\u2013745, Aug 1973.","journal-title":"IEEE Trans. Comput."},{"issue":"2-3","key":"11_CR25","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1016\/0166-5316(94)90037-X","volume":"19","author":"E. Rosti","year":"1994","unstructured":"E. Rosti, E. Smirni, L. W. Dowdy, G. Serazzi, and B. M. Carlson, \u201cRobust partitioning schemes of multiprocessor systems\u201d. Performance Evaluation 19(2-3), pp. 141\u2013165, Mar 1994.","journal-title":"Performance Evaluation"},{"key":"11_CR26","doi-asserted-by":"crossref","unstructured":"E. Rosti, E. Smirni, G. Serazzi, and L. W. Dowdy, \u201cAnalysis of non-work-conserving processor partitioning policies\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 165\u2013181, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_28"},{"key":"11_CR27","doi-asserted-by":"crossref","unstructured":"B. Schnor, \u201cDynamic scheduling of parallel applications\u201d. In Parallel Computing Technologies, V. Malyshkin (ed.), pp. 109\u2013116, Springer-Verlag, Sep 1995. Lecture Notes in Computer Science vol. 964.","DOI":"10.1007\/3-540-60222-4_101"},{"issue":"2-3","key":"11_CR28","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1016\/0166-5316(94)90036-1","volume":"19","author":"K. C. Sevcik","year":"1994","unstructured":"K. C. Sevcik, \u201cApplication scheduling and processor allocation in multiprogrammed parallel processing systems\u201d. Performance Evaluation 19(2-3), pp. 107\u2013140, Mar 1994.","journal-title":"Performance Evaluation"},{"key":"11_CR29","doi-asserted-by":"crossref","unstructured":"K. C. Sevcik, \u201cCharacterization of parallelism in applications and their use in scheduling\u201d. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 171\u2013180, May 1989.","DOI":"10.1145\/75372.75391"},{"key":"11_CR30","doi-asserted-by":"crossref","unstructured":"A. Tucker and A. Gupta, \u201cProcess control and scheduling issues for multiprogrammed shared-memory multiprocessors\u201d. In 12th Symp. Operating Systems Principles, pp. 159\u2013166, Dec 1989.","DOI":"10.1145\/74850.74866"},{"key":"11_CR31","doi-asserted-by":"crossref","unstructured":"M. Wan, R. Moore, G. Kremenek, and K. Steube, \u201cA batch scheduler for the Intel Paragon with a non-contiguous node allocation algorithm\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 48\u201364, Springer-Verlag, 1996. Lecture Notes in Computer Science Vol. 1162.","DOI":"10.1007\/BFb0022287"},{"key":"11_CR32","doi-asserted-by":"crossref","unstructured":"K. Windisch, V. Lo, R. Moore, D. Feitelson, and B. Nitzberg, \u201cA comparison of workload traces from two production parallel machines\u201d. In 6th Symp. Frontiers Massively Parallel Comput., pp. 319\u2013326, Oct 1996.","DOI":"10.1109\/FMPC.1996.558107"},{"issue":"10","key":"11_CR33","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1109\/71.246077","volume":"4","author":"Q. Yang","year":"1993","unstructured":"Q. Yang and H. Wang, \u201cA new graph approach to minimizing processor fragmentation in hypercube multiprocessors\u201d. IEEE Trans. Parallel & Distributed Syst. 4(10), pp. 1165\u20131171, Oct 1993.","journal-title":"IEEE Trans. Parallel & Distributed Syst."}],"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-63574-2_24.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T11:51:19Z","timestamp":1640951479000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-63574-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540635741","9783540695998"],"references-count":33,"URL":"https:\/\/doi.org\/10.1007\/3-540-63574-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}