{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:36:44Z","timestamp":1761323804648},"publisher-location":"Berlin, Heidelberg","reference-count":50,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540601531"},{"type":"electronic","value":"9783540494591"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-60153-8_20","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T12:44:13Z","timestamp":1330260253000},"page":"1-18","source":"Crossref","is-referenced-by-count":69,"title":["Parallel job scheduling: Issues and approaches"],"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,2]]},"reference":[{"key":"1_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.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_21"},{"issue":"1","key":"1_CR2","doi-asserted-by":"crossref","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.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_22"},{"issue":"5","key":"1_CR4","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1109\/2.53353","volume":"23","author":"D. L. Black","year":"1990","unstructured":"D. L. Black, \u201cScheduling support for concurrency and parallelism in the Mach operating system\u201d. Computer 23(5), pp. 35\u201343, May 1990.","journal-title":"Computer"},{"issue":"3","key":"1_CR5","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1109\/TC.1981.1675756","volume":"C-30","author":"S. H. Bokhari","year":"1981","unstructured":"S. H. Bokhari, \u201cOn the mapping problem\u201d. IEEE Trans. Comput. C-30(3), pp. 207\u2013214, Mar 1981.","journal-title":"IEEE Trans. Comput."},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"F. P. Brooks, Jr., The Mythical Man-Month: Essays on Software Engineering. Addison-Wesley, 1975.","DOI":"10.1145\/800027.808439"},{"issue":"5\/6","key":"1_CR7","doi-asserted-by":"crossref","first-page":"617","DOI":"10.1147\/rd.355.0617","volume":"35","author":"R. M. Bryant","year":"1991","unstructured":"R. M. Bryant, H-Y. Chang, and B. S. Rosenburg, \u201cOperating system support for parallel programming on RP3\u201d. IBM J. Res. Dev. 35(5\/6), pp. 617\u2013634, Sep\/Nov 1991.","journal-title":"IBM J. Res. Dev."},{"issue":"1","key":"1_CR8","doi-asserted-by":"crossref","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"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"R. Chandra, S. Devine, B. Verghese, A. Gupta, and M. Rosenblum, \u201cScheduling and page migration for multiprocessor compute servers\u201d. In 6th Intl. Conf. Architect. Support for Prog. Lang. & Operating Syst., pp. 12\u201324, Nov 1994.","DOI":"10.1145\/381792.195485"},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"C. Connelly and C. S. Ellis, \u201cScheduling to reduce memory coherence overhead on coarse-grain multiprocessors\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_23"},{"key":"1_CR11","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_CR12","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.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_38"},{"issue":"5","key":"1_CR13","doi-asserted-by":"crossref","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_CR14","first-page":"1","volume":"I","author":"D. G. Feitelson","year":"1990","unstructured":"D. G. Feitelson and L. Rudolph, \u201cMapping and scheduling in a shared parallel environment using distributed hierarchical control\u201d. In Intl. Conf. Parallel Processing, vol. I, pp. 1\u20138, Aug 1990.","journal-title":"Intl. Conf. Parallel Processing"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"D. G. Feitelson and L. Rudolph, \u201cWasted resources in gang scheduling\u201d. In 5th Jerusalem Conf. Information Technology, pp. 127\u2013136, IEEE Computer Society Press, Oct 1990.","DOI":"10.1109\/JCIT.1990.128278"},{"issue":"4","key":"1_CR16","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."},{"issue":"2","key":"1_CR17","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1007\/BF02577787","volume":"23","author":"D. G. Feitelson","year":"1995","unstructured":"D. G. Feitelson and L. Rudolph, \u201cCoscheduling based on runtime identification of activity working sets\u201d. Intl. J. Parallel Programming 23(2), pp. 135\u2013160, Apr 1995.","journal-title":"Intl. J. Parallel Programming"},{"issue":"3","key":"1_CR18","doi-asserted-by":"crossref","first-page":"173","DOI":"10.1145\/356698.356700","volume":"9","author":"M. J. Gonzalez Jr.","year":"1977","unstructured":"M. J. Gonzalez, Jr., \u201cDeterministic processor scheduling\u201d. ACM Comput. Surv. 9(3), pp. 173\u2013204, Sep 1977.","journal-title":"ACM Comput. Surv."},{"key":"1_CR19","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":"1_CR20","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\/107972.107985"},{"key":"1_CR21","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.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_34"},{"key":"1_CR22","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.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949."},{"key":"1_CR23","unstructured":"Intel Supercomputer Systems Division, Paragon User's Guide. Order number 312489-003, Jun 1994."},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"O. Kipersztok and J. C. Patterson, \u201cIntelligent fuzzy control to augment the scheduling capabilities of network queueing systems\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_32"},{"issue":"5","key":"1_CR25","doi-asserted-by":"crossref","first-page":"434","DOI":"10.1109\/32.135776","volume":"18","author":"L. Kleinrock","year":"1992","unstructured":"L. Kleinrock and J-H. Huang, \u201cOn parallel processing systems: Amdahl's law generalized and some results on optimal design\u201d. IEEE Trans. Softw. Eng. 18(5), pp. 434\u2013447, May 1992.","journal-title":"IEEE Trans. Softw. Eng."},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"C. E. Leiserson, Z. S. Abuhamdeh, D. C. Douglas, C. R. Feynman, M. N. Ganmukhi, J. V. Hill, W. D. Hillis, B. C. Kuszmaul, M. A. St. Pierre, D. S. Wells, M. C. Wong, S-W. Yang, and R. Zak, \u201cThe network architecture of the Connection Machine CM-5\u201d. In 4th Symp. Parallel Algorithms & Architectures, pp. 272\u2013285, Jun 1992.","DOI":"10.1145\/140901.141883"},{"key":"1_CR27","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.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_35"},{"issue":"2","key":"1_CR28","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1109\/2.261915","volume":"27","author":"D. J. Lilja","year":"1994","unstructured":"D. J. Lilja, \u201cExploiting the parallelism available in loops\u201d. Computer 27(2), pp. 13\u201326, Feb 1994.","journal-title":"Computer"},{"issue":"11","key":"1_CR29","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1109\/12.8704","volume":"37","author":"V. M. Lo","year":"1988","unstructured":"V. M. Lo, \u201cHeuristic algorithms for task assignment in distributed systems\u201d. IEEE Trans. Comput. 37(11), pp. 1384\u20131397, Nov 1988.","journal-title":"IEEE Trans. Comput."},{"issue":"2","key":"1_CR30","doi-asserted-by":"crossref","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."},{"issue":"3","key":"1_CR31","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/158439.158908","volume":"25","author":"M. G. Norman","year":"1993","unstructured":"M. G. Norman and P. Thanisch, \u201cModels of machines and computation for mapping in multicomputers\u201d. ACM Comput. Surv. 25(3), pp. 263\u2013302, Sep 1993.","journal-title":"ACM Comput. Surv."},{"key":"1_CR32","unstructured":"J. K. Ousterhout, \u201cScheduling techniques for concurrent systems\u201d. In 3rd Intl. Conf. Distributed Comput. Syst., pp. 22\u201330, Oct 1982."},{"issue":"2","key":"1_CR33","doi-asserted-by":"crossref","first-page":"288","DOI":"10.1109\/5.214551","volume":"81","author":"C. M. Pancake","year":"1993","unstructured":"C. M. Pancake, \u201cMultithreaded languages for scientific and technical computing\u201d. Proc. IEEE 81(2), pp. 288\u2013304, Feb 1993.","journal-title":"Proc. IEEE"},{"issue":"2","key":"1_CR34","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1137\/0219021","volume":"19","author":"C. H. Papadimitriou","year":"1990","unstructured":"C. H. Papadimitriou and M. Yannakakis, \u201cTowards an architecture-independent analysis of parallel algorithms\u201d. SIAM J. Comput. 19(2), pp. 322\u2013328, Apr 1990.","journal-title":"SIAM J. Comput."},{"key":"1_CR35","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.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_26"},{"key":"1_CR36","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.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_33"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"M. E. Rosenkrantz, D. J. Schneider, R. Leibensperger, M. shore, and J. Zollweg, \u201cRequirements of the Cornell Theory Center for resource management and process scheduling\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_36"},{"key":"1_CR38","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.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_28"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"L. Rudolph, M. Slivkin-Allalouf, and E. Upfal, \u201cA simple load balancing scheme for task allocation in parallel machines\u201d. In 3rd Symp. Parallel Algorithms & Architectures, pp. 237\u2013245, Jul 1991.","DOI":"10.1145\/113379.113401"},{"key":"1_CR40","doi-asserted-by":"crossref","unstructured":"W. Saphir, L. A. Tanner, and B. Traversat, \u201cJob management requirements for NAS parallel systems and clusters\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_37"},{"key":"1_CR41","doi-asserted-by":"crossref","unstructured":"S. Setia, \u201cThe interaction between memory allocation and adaptive partitioning in message-passing multicomputers\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_27"},{"issue":"10","key":"1_CR42","doi-asserted-by":"crossref","first-page":"1202","DOI":"10.1145\/63039.63043","volume":"31","author":"J. E. Smith","year":"1988","unstructured":"J. E. Smith, \u201cCharacterizing computer performance with a single number\u201d. Comm. ACM 31(10), pp. 1202\u20131206, Oct 1988.","journal-title":"Comm. ACM"},{"key":"1_CR43","doi-asserted-by":"crossref","unstructured":"P. G. Sobalvarro and W. E. Weihl, \u201cDemand-based coscheduling of parallel jobs on multiprogrammed multiprocessors\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_25"},{"key":"1_CR44","doi-asserted-by":"crossref","unstructured":"M. S. Squillante, \u201cOn the benefits and limitations of dynamic partitioning in parallel computer systems\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_31"},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"I. Stoica, H. Abdel-Wahab, and A. Pothen, \u201cA microeconomic scheduler for parallel computers\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_30"},{"key":"1_CR46","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":"2nd Intl. Conf. Supercomputing"},{"issue":"2","key":"1_CR47","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_CR48","unstructured":"J. D. Ullman, \u201cComplexity of sequencing problems\u201d. In Computer and Job-Shop Scheduling Theory, E. G. Coffman, Jr. (ed.), chap. 4, John Wiley & Sons, 1976."},{"key":"1_CR49","first-page":"61","volume":"I","author":"K. Y. Wang","year":"1995","unstructured":"K. Y. Wang and D. C. Marinescu, \u201cCorrelation of the paging activity of individual node programs in the SPMD execution model\u201d. In 28th Hawaii Intl. Conf. System Sciences, vol. I, pp. 61\u201371, Jan 1995.","journal-title":"28th Hawaii Intl. Conf. System Sciences"},{"key":"1_CR50","doi-asserted-by":"crossref","unstructured":"K. K. Yue and D. J. Lilja, \u201cLoop-level process control: an effective processor allocation policy for multiprogrammed shared-memory multiprocessors\u201d. In Job Scheduling Strategies for Parallel Processing, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1995. Lecture Notes in Computer Science Vol. 949.","DOI":"10.1007\/3-540-60153-8_29"}],"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-60153-8_20.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T04:25:37Z","timestamp":1640924737000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-60153-8_20"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540601531","9783540494591"],"references-count":50,"URL":"https:\/\/doi.org\/10.1007\/3-540-60153-8_20","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}