{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T06:57:11Z","timestamp":1768028231672,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":55,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540618645","type":"print"},{"value":"9783540707103","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1996]]},"DOI":"10.1007\/bfb0022284","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T07:04:36Z","timestamp":1131865476000},"page":"1-26","source":"Crossref","is-referenced-by-count":94,"title":["Toward convergence in job schedulers for parallel supercomputers"],"prefix":"10.1007","author":[{"given":"Dror G.","family":"Feitelson","sequence":"first","affiliation":[]},{"given":"Larry","family":"Rudolph","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"issue":"2","key":"1_CR1","doi-asserted-by":"crossref","first-page":"152","DOI":"10.1147\/sj.342.0152","volume":"34","author":"T. Agerwala","year":"1995","unstructured":"T. Agerwala, J. L. Martin, J. H. Mirza, D. C. Sadler, D. M. Dias, and M. Snir, \u201cSP2 system architecture\u201d. IBM Syst. J. 34(2), pp. 152\u2013184, 1995.","journal-title":"IBM Syst. J."},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1145\/146941.146944","volume":"10","author":"T. E. Anderson","year":"1992","unstructured":"T. E. Anderson, B. N. Bershad, E. D. Lazowska, and H. M. Levy, \u201cScheduler activations: effective kernel support for the user-level management of parallelism\u201d. ACM Trans. Comput. Syst. 10(1), pp. 53\u201379, Feb 1992.","journal-title":"ACM Trans. Comput. Syst."},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"J. M. Barton and N. Bitar, \u201cA scalable multi-discipline, multiple-processor scheduling framework for IRIX\u201d In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 45\u201369, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_22"},{"key":"1_CR4","unstructured":"P. Brinch Hansen, \u201cAn analysis of response ratio scheduling\u201d. In IFIP Congress, Ljubljana, pp. TA-3 150\u2013154, Aug 1971."},{"issue":"1","key":"1_CR5","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/2.362631","volume":"28","author":"N. Carriero","year":"1995","unstructured":"N. Carriero, E. Freedman, D. Gelernter, and D. Kaminsky, \u201cAdaptive parallelism and Piranha\u201d. Computer 28(1), pp. 40\u201349, Jan 1995.","journal-title":"Computer"},{"issue":"9","key":"1_CR6","doi-asserted-by":"publisher","first-page":"1146","DOI":"10.1109\/12.57056","volume":"39","author":"M-S. Chen","year":"1990","unstructured":"M-S. Chen and K. G. Shin, \u201cSubcube allocation and task migration in hypercube multiprocessors\u201d. IEEE Trans. Comput. 39(9), pp. 1146\u20131155, Sep 1990.","journal-title":"IEEE Trans. Comput."},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"S-H. Chiang and M. Vernon, \u201cDynamic vs. static quantum-based parallel processor allocation\u201d. In Job Scheduling Strategies for Parallel Processing II, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1996. Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0022295"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"M. Crovella, P. Das, C. Dubnicki, T. LeBlanc, and E. Markatos, \u201cMultiprogramming on multiprocessors\u201d. In 3rd IEEE Symp. Parallel & Distributed Processing, pp. 590\u2013597, 1991.","DOI":"10.1109\/SPDP.1991.218246"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"D. Das Sharma and D. K. Pradhan, \u201cA fast and efficient strategy for submesh allocation in mesh-connected parallel computers\u201d. In IEEE Symp. Parallel & Distributed Processing, pp. 682\u2013689, Dec 1993.","DOI":"10.1109\/SPDP.1993.395466"},{"key":"1_CR10","unstructured":"M. Devarakonda and A. Mukherjee, \u201cIssues in implementation of cache-affinity scheduling\u201d. In Proc. Winter USENIX Technical Conf., pp. 345\u2013357, Jan 1992."},{"key":"1_CR11","doi-asserted-by":"crossref","unstructured":"J. Edler, A. Gottlieb, C. P. Kruskal, K. P. McAuliffe, L. Rudolph, M. Snir, P. J. Teller, and J. Wilson, \u201cIssues related to MIMD shared-memory computers: the NYU Ultracomputer approach\u201d. In 12th Ann. Intl. Symp. Computer Architecture Conf. Proc., pp. 126\u2013135, 1985.","DOI":"10.1145\/327070.327143"},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"D. G. Feitelson, \u201cPacking schemes for gang scheduling\u201d. In Job Scheduling Strategies for Parallel Processing II, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1996. Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0022289"},{"key":"1_CR13","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":"1_CR14","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":"1_CR15","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"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"D. G. Feitelson and L. Rudolph, \u201cEvaluation of design choices for gang scheduling using distributed hierarchical control\u201d. J. Parallel & Distributed Comput., 1996. to appear.","DOI":"10.1006\/jpdc.1996.0064"},{"issue":"4","key":"1_CR17","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":"1_CR18","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":"1_CR19","volume-title":"An online scheduler respecting job cost functions for parallel processors","author":"M. Frank","year":"1996","unstructured":"M. Frank, V. Lee, W. Lee, K. Mackenzie, and L. Rudolph, \u201cAn online scheduler respecting job cost functions for parallel processors\u201d. Manuscript in preperation, M.I.T. Cambridge, MA, 1996."},{"key":"1_CR20","doi-asserted-by":"crossref","unstructured":"J. Gehring and F. Ramme, \u201cArchitecture-independent request-scheduling with tight waiting-time estimations\u201d. In Job Scheduling Strategies for Parallel Processing II, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1996. Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0022288"},{"key":"1_CR21","doi-asserted-by":"crossref","unstructured":"A. Geist, A. Beguelin, J. Dongarra, W. Jiang, R. Manchek, and V. Sunderam, PVM 3 User's Guide and Reference Manual. Technical Report ORNL\/TM-12187, Oak Ridge National Laboratory, May 1994.","DOI":"10.7551\/mitpress\/5712.001.0001"},{"key":"1_CR22","unstructured":"B. Gorda and R. Wolski, \u201cTime sharing massively parallel machines\u201d. In Intl. Conf. Parallel Processing, Aug 1995."},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"A. Gupta, A. Tucker, and S. Urushibara, \u201cThe impact of operating system scheduling policies and synchronization methods on the performance of parallel applications\u201d. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 120\u2013132, May 1991.","DOI":"10.1145\/107971.107985"},{"key":"1_CR24","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 Vol. 949.","DOI":"10.1007\/3-540-60153-8_34"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"A. Hori et al., \u201cTime space sharing scheduling and architectural support\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 92\u2013105, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_24"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"A. Hori, H. Tezuka, Y. Ishikawa, N. Soda, H. Konaka, and M. Maeda, \u201cImplementation of gang-scheduling on workstation cluster\u201d. In Job Scheduling Strategies for Parallel Processing II, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1996. Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0022291"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"S. Hotovy, \u201cWorkload evolution on the Cornell Theory Center IBM SP2\u201d. In Job Scheduling Strategies for Parallel Processing II, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1996. Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0022285"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"N. Islam, A. Prodromidis, and M. Squillante, \u201cDynamic partitioning in different distributed-memory environments\u201d. In Job Scheduling Strategies for Parallel Processing II, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1996. Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0022297"},{"key":"1_CR29","unstructured":"Y. A. Khalidi, J. Bernabeu, V. Matena, K. Shirriff, and M. Thadani, \u201cSolaris MC: a Multi Computer OS\u201d. In Proc. USENIX Conf., Jan 1996."},{"issue":"6","key":"1_CR30","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/2.214439","volume":"26","author":"A. A. Khokhar","year":"1993","unstructured":"A. A. Khokhar, V. K. Prasanna, M. E. Shaaban, and C-L. Wang, \u201cHeterogeneous computing: challenges and opportunities\u201d. Computer 26(6), pp. 18\u201327, Jun 1993.","journal-title":"Computer"},{"issue":"5","key":"1_CR31","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1109\/71.282559","volume":"5","author":"P. Krueger","year":"1994","unstructured":"P. Krueger, T-H. Lai, and V. A. Dixit-Radiya, \u201cJob scheduling is more important than processor allocation for hypercube computers\u201d. IEEE Trans. Parallel & Distributed Syst. 5(5), pp. 488\u2013497, May 1994.","journal-title":"IEEE Trans. Parallel & Distributed Syst."},{"key":"1_CR32","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"},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"W. Liu, V. Lo, K. Windisch, and B. Nitzberg, \u201cNon-contiguous processor allocation algorithms for distributed memory multicomputers\u201d. In Supercomputing '94, pp. 227\u2013236, Nov 1994.","DOI":"10.1145\/602770.602811"},{"issue":"2","key":"1_CR34","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":"1_CR35","doi-asserted-by":"crossref","unstructured":"C. McCann and J. Zahorjan, \u201cProcessor allocation policies for message passing parallel computers\u201d. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 19\u201332, May 1994.","DOI":"10.1145\/183018.183022"},{"key":"1_CR36","doi-asserted-by":"crossref","unstructured":"T. D. Nguyen, R. Vaswani, and J. Zahorjan, \u201cParallel application characterization for multiprocessor scheduling policy design\u201d. In Job Scheduling Strategies for Parallel Processing II, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1996. Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0022294"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"T. D. Nguyen, R. Vaswani, and J. Zahorjan, \u201cUsing runtime measured workload characteristics in parallel processor scheduling\u201d. In Job Scheduling Strategies for Parallel Processing II, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1996. Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0022293"},{"key":"1_CR38","unstructured":"J. K. Ousterhout, \u201cScheduling techniques for concurrent systems\u201d. In 3rd Intl. Conf. Distributed Comput. Syst., pp. 22\u201330, Oct 1982."},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"J. D. Padhye and L. W. Dowdy, \u201cPreemptive versus non-preemptive processor allocation policies for message passing parallel computers: an empirical comparison\u201d. In Job Scheduling Strategies for Parallel Processing II, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1996. Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0022296"},{"key":"1_CR40","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"},{"key":"1_CR41","unstructured":"J. Peterson and A. Silberschatz, Operating System Concepts. Addison-Wesley, 1983."},{"key":"1_CR42","doi-asserted-by":"crossref","unstructured":"J. Pruyne and M. Livny, \u201cManaging checkpoints for parallel programs\u201d. In Job Scheduling Strategies for Parallel Processing II, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1996. Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0022292"},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"J. Pruyne and M. Livny, \u201cParallel processing on dynamic resources with CARMI\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), pp. 259\u2013278, Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_33"},{"issue":"2\u20133","key":"1_CR44","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\u20133), pp. 141\u2013165, Mar 1994.","journal-title":"Performance Evaluation"},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"E. Rosti, E. Smirni, G. Serazzi, and L. W. Dowdy, \u201cAnalysis of non-workconserving 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"},{"issue":"2\u20133","key":"1_CR46","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\u20133), pp. 107\u2013140, Mar 1994.","journal-title":"Performance Evaluation"},{"key":"1_CR47","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\/75108.75391"},{"key":"1_CR48","doi-asserted-by":"crossref","unstructured":"J. Skovira, W. Chan, H. Zhou, and D. Lifka, \u201cThe EASY \u2014 LoadLeveler API project\u201d. In Job Scheduling Strategies for Parallel Processing II, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1996. Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0022286"},{"issue":"2","key":"1_CR49","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1109\/71.207589","volume":"4","author":"M. S. Squillante","year":"1993","unstructured":"M. S. Squillante and E. D. Lazowska, \u201cUsing processor-cache affinity information in shared-memory multiprocessor scheduling\u201d. IEEE Trans. Parallel & Distributed Syst. 4(2), pp. 131\u2013143, Feb 1993.","journal-title":"IEEE Trans. Parallel & Distributed Syst."},{"key":"1_CR50","first-page":"93","volume":"I","author":"S. Thakkar","year":"1987","unstructured":"S. Thakkar, P. Gifford, and G. Fielland, \u201cBalance: a shared memory multiprocessor system\u201d. In 2nd Intl. Conf. Supercomputing, vol. I, pp. 93\u2013101, 1987.","journal-title":"Intl. Conf. Supercomputing"},{"issue":"2","key":"1_CR51","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1006\/jpdc.1995.1014","volume":"24","author":"J. Torrellas","year":"1995","unstructured":"J. Torrellas, A. Tucker, and A. Gupta, \u201cEvaluating the performance of cacheaffinity scheduling in shared-memory multiprocessors\u201d. J. Parallel & Distributed Comput. 24(2), pp. 139\u2013151, Feb 1995.","journal-title":"J. Parallel & Distributed Comput."},{"key":"1_CR52","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":"1_CR53","doi-asserted-by":"crossref","unstructured":"M. Wan, R. Moore, G. Kremenek, and K. Steube, \u201cA batch scheduler for the Intel Paragon MPP system with a non-contiguous node allocation algorithm\u201d. In Job Scheduling Strategies for Parallel Processing II, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1996. Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0022287"},{"key":"1_CR54","doi-asserted-by":"crossref","unstructured":"F. Wang, M. Papaefthymiou, M. Squillante, L. Rudolph, P. Pattnaik, and H. Franke, \u201cA gang scheduling design for multiprogrammed parallel computing environments\u201d. In Job Scheduling Strategies for Parallel Processing II, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1996. Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0022290"},{"key":"1_CR55","doi-asserted-by":"crossref","unstructured":"J. Zahorjan and C. McCann, \u201cProcessor scheduling in shared memory multiprocessors\u201d. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 214\u2013225, May 1990.","DOI":"10.1145\/98457.98760"}],"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\/BFb0022284","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:52:27Z","timestamp":1586551947000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022284"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540618645","9783540707103"],"references-count":55,"URL":"https:\/\/doi.org\/10.1007\/bfb0022284","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}