{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T17:59:27Z","timestamp":1775671167584,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":30,"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\/bfb0022289","type":"book-chapter","created":{"date-parts":[[2005,11,13]],"date-time":"2005-11-13T07:04:36Z","timestamp":1131865476000},"page":"89-110","source":"Crossref","is-referenced-by-count":121,"title":["Packing schemes for gang scheduling"],"prefix":"10.1007","author":[{"given":"Dror G.","family":"Feitelson","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,15]]},"reference":[{"issue":"9","key":"6_CR1","doi-asserted-by":"crossref","first-page":"901","DOI":"10.1002\/spe.4380150905","volume":"15","author":"A. Barak","year":"1985","unstructured":"A. Barak and A. Shiloh, \u201cA distributed load-balancing policy for a multicomputer\u201d. Software \u2014 Pract. & Exp. 15(9), pp. 901\u2013913, Sep 1985.","journal-title":"Software \u2014 Pract. & Exp."},{"key":"6_CR2","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":"6_CR3","doi-asserted-by":"crossref","unstructured":"S-H. Chiang, R. K. Mansharamani, and M. K. Vernon, \u201cUse of application characteristics and limited preemption for run-to-completion parallel processor scheduling policies\u201d. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 33\u201344, May 1994.","DOI":"10.1145\/183018.183023"},{"key":"6_CR4","doi-asserted-by":"crossref","unstructured":"E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson, \u201cApproximation algorithms for bin-packing \u2014 an updated survey\u201d. In Algorithm Design for Computer Systems Design, G. Ausiello, M. Lucertini, and P. Serafini (eds.), pp. 49\u2013106, Springer-Verlag, 1984.","DOI":"10.1007\/978-3-7091-4338-4_3"},{"issue":"4","key":"6_CR5","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1016\/0885-064X(87)90009-4","volume":"3","author":"E. G. Coffman Jr.","year":"1987","unstructured":"E. G. Coffman, Jr., M. R. Garey, and D. S. Johnson, \u201cBin packing with divisible item sizes\u201d. J. Complex. 3(4), pp. 406\u2013428, Dec 1987.","journal-title":"J. Complex."},{"key":"6_CR6","doi-asserted-by":"crossref","unstructured":"F. Douglis and J. Ousterhout, \u201cProcess migration in the Sprite operating system\u201d. In 7th Intl. Conf. Distributed Comput. Syst., pp. 18\u201325, Sep 1987.","DOI":"10.21236\/ADA619399"},{"key":"6_CR7","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":"6_CR8","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":"6_CR9","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":"6_CR10","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"},{"key":"6_CR11","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":"6_CR12","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"},{"key":"6_CR13","unstructured":"B. Gorda and R. Wolski, \u201cTime sharing massively parallel machines\u201d. In Intl. Conf. Parallel Processing, Aug 1995."},{"key":"6_CR14","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":"6_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 II, D. G. Feitelson and L. Rudolph (eds.), Springer-Verlag, 1996. Lecture Notes in Computer Science.","DOI":"10.1007\/BFb0022285"},{"key":"6_CR16","unstructured":"Intel Corp., iPSC\/860 Multi-User Accounting, Control, and Scheduling Utilities Manual. Order number 312261-002, May 1992."},{"key":"6_CR17","unstructured":"Intel Supercomputer Systems Division, Paragon User's Guide. Order number 312489-003, Jun 1994."},{"issue":"10","key":"6_CR18","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1145\/365628.365655","volume":"8","author":"K. C. Knowlton","year":"1965","unstructured":"K. C. Knowlton, \u201cA fast storage allocator\u201d. Comm. ACM 8(10), pp. 623\u2013625, Oct 1965.","journal-title":"Comm. ACM"},{"key":"6_CR19","doi-asserted-by":"crossref","unstructured":"P. Krueger, T-H. Lai, and V. A. Radiya, \u201cProcessor allocation vs. job scheduling on hypercube computers\u201d. In 11th Intl. Conf. Distributed Comput. Syst., pp. 394\u2013401, May 1991.","DOI":"10.1109\/ICDCS.1991.148700"},{"key":"6_CR20","doi-asserted-by":"crossref","unstructured":"S. T. Leutenegger and M. K. Vernon, \u201cThe performance of multiprogrammed multiprocessor scheduling policies\u201d. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 226\u2013236, May 1990.","DOI":"10.1145\/98460.98761"},{"key":"6_CR21","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":"6_CR22","unstructured":"M. H. MacDougall, Simulating Computer Systems: Techniques and Tools. MIT Press, 1987."},{"key":"6_CR23","doi-asserted-by":"crossref","unstructured":"S. Majumdar, D. L. Eager, and R. B. Bunt, \u201cScheduling in multiprogrammed parallel systems\u201d. In SIGMETRICS Conf. Measurement & Modeling of Comput. Syst., pp. 104\u2013113, May 1988.","DOI":"10.1145\/55595.55608"},{"key":"6_CR24","unstructured":"J. K. Ousterhout, \u201cScheduling techniques for concurrent systems\u201d. In 3rd Intl. Conf. Distributed Comput. Syst., pp. 22\u201330, Oct 1982."},{"issue":"6","key":"6_CR25","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1145\/359605.359626","volume":"20","author":"J. L. Peterson","year":"1977","unstructured":"J. L. Peterson and T. A. Norman, \u201cBuddy systems\u201d. Comm. ACM 20(6), pp. 421\u2013431, Jun 1977.","journal-title":"Comm. ACM"},{"issue":"4","key":"6_CR26","doi-asserted-by":"publisher","first-page":"607","DOI":"10.1137\/0206044","volume":"6","author":"D. L. Russell","year":"1977","unstructured":"D. L. Russell, \u201cInternal fragmentation in a class of buddy systems\u201d. SIAM J. Comput. 6(4), pp. 607\u2013621, Dec 1977.","journal-title":"SIAM J. Comput."},{"key":"6_CR27","unstructured":"T. Suzuoka, J. Subhlok, and T. Gross, Evaluating Job Scheduling Techniques for Highly Parallel Computers. Technical Report CMU-CS-95-149, School of Computer Science, Carnegie Mellon University, 1995."},{"key":"6_CR28","unstructured":"Thinking Machines Corp., Connection Machine CM-5 Technical Summary. Nov 1992."},{"key":"6_CR29","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":"6_CR30","unstructured":"G. K. Zipf, Human Behavior and the Principle of Least Effort. Addison-Wesley, 1949."}],"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\/BFb0022289","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T20:52:17Z","timestamp":1586551937000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0022289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996]]},"ISBN":["9783540618645","9783540707103"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/bfb0022289","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[1996]]}}}