{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:35:17Z","timestamp":1743003317175,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":36,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642358661"},{"type":"electronic","value":"9783642358678"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-35867-8_4","type":"book-chapter","created":{"date-parts":[[2013,1,11]],"date-time":"2013-01-11T02:24:52Z","timestamp":1357871092000},"page":"56-75","source":"Crossref","is-referenced-by-count":0,"title":["Multi-objective Processor-Set Selection for Computational Cluster-Systems"],"prefix":"10.1007","author":[{"given":"N. Peter","family":"Drakenberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2\/3","key":"4_CR1","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1147\/rd.492.0265","volume":"49","author":"N.R. Adiga","year":"2005","unstructured":"Adiga, N.R., et al.: Blue Gene\/ L torus interconnection network. IBM J. Res. Develop.\u00a049(2\/3), 265\u2013276 (2005)","journal-title":"IBM J. Res. Develop."},{"issue":"2\/3","key":"4_CR2","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1147\/rd.492.0425","volume":"49","author":"Y. Aridor","year":"2005","unstructured":"Aridor, Y., et al.: Resource allocation and utilization in the Blue Gene\/ L supercomputer. IBM J. Res. Develop.\u00a049(2\/3), 425\u2013436 (2005)","journal-title":"IBM J. Res. Develop."},{"issue":"5","key":"4_CR3","doi-asserted-by":"publisher","first-page":"439","DOI":"10.1016\/0743-7315(87)90018-9","volume":"4","author":"F. Berman","year":"1987","unstructured":"Berman, F., Snyder, L.: On mapping parallel algorithms onto parallel architectures. J. Parall. Distr. Comput.\u00a04(5), 439\u2013458 (1987)","journal-title":"J. Parall. Distr. Comput."},{"issue":"2\/3","key":"4_CR4","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1147\/rd.492.0489","volume":"49","author":"G. Bhanot","year":"2005","unstructured":"Bhanot, G., et al.: Optimizing task layout on the Blue Gene\/L supercomputer. IBM J. Res. Develop.\u00a049(2\/3), 489\u2013500 (2005)","journal-title":"IBM J. Res. Develop."},{"issue":"2","key":"4_CR5","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1002\/cpe.1637","volume":"23","author":"A. Bhatel\u00e9","year":"2011","unstructured":"Bhatel\u00e9, A., Bohm, E., Kal\u00e9, L.V.: Optimizing communication for Charm++ applications by reducing network contention. Concur. Pract. Exp.\u00a023(2), 211\u2013222 (2011)","journal-title":"Concur. Pract. Exp."},{"key":"4_CR6","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-2003-6","volume-title":"Assignment Problems in Parallel and Distributed Computing","author":"S.H. Bokhari","year":"1987","unstructured":"Bokhari, S.H.: Assignment Problems in Parallel and Distributed Computing. Kluwer Academic Publishers, Norwell (1987)"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1109\/12.76410","volume":"C-40","author":"S.W. Bollinger","year":"1991","unstructured":"Bollinger, S.W., Midkiff, S.F.: Heuristic technique for processor and link assignment in multicomputers. IEEE Trans. Comput.\u00a0C-40(3), 325\u2013333 (1991)","journal-title":"IEEE Trans. Comput."},{"issue":"1","key":"4_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0305-0548(94)P2435-7","volume":"22","author":"T. Chokalingam","year":"1995","unstructured":"Chokalingam, T., Arunkumar, S.: Genetic algorithm based heuristics for the mapping problem. Comput. Oper. Res.\u00a022(1), 55\u201364 (1995)","journal-title":"Comput. Oper. Res."},{"issue":"2","key":"4_CR9","doi-asserted-by":"crossref","first-page":"406","DOI":"10.1002\/j.1538-7305.1953.tb01433.x","volume":"32","author":"C. Clos","year":"1953","unstructured":"Clos, C.: A study of non-blocking switching networks. Bell Sys. Tech. J.\u00a032(2), 406\u2013424 (1953)","journal-title":"Bell Sys. Tech. J."},{"key":"4_CR10","unstructured":"Cray Inc., Seattle, WA 98104, U.S.A.: Cray XT System Overview (2009), publication No. S\u20132423\u201322"},{"issue":"5","key":"4_CR11","doi-asserted-by":"publisher","first-page":"679","DOI":"10.1016\/0167-8191(94)90001-9","volume":"20","author":"A. Darte","year":"1994","unstructured":"Darte, A., Robert, Y.: Mapping uniform loop nests onto distributed memory architectures. Parallel Computing\u00a020(5), 679\u2013710 (1994)","journal-title":"Parallel Computing"},{"key":"4_CR12","volume-title":"Dynamic Programming: models and applications","author":"E.V. Denardo","year":"2003","unstructured":"Denardo, E.V.: Dynamic Programming: models and applications. Dover Publications, Mineola (2003)"},{"issue":"1","key":"4_CR13","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1016\/0743-7315(90)90004-9","volume":"10","author":"F. Ercal","year":"1990","unstructured":"Ercal, F., Ramanujam, J., Saddayappan, P.: Task allocation onto a hypercube by recursive mincut bipartitioning. J. Parallel Distrib. Comput.\u00a010(1), 35\u201344 (1990)","journal-title":"J. Parallel Distrib. Comput."},{"key":"4_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-60153-8_20","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D.G. Feitelson","year":"1995","unstructured":"Feitelson, D.G., Rudolph, L.: Parallel Job Scheduling: Issues and Approaches. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol.\u00a0949, pp. 1\u201318. Springer, Heidelberg (1995)"},{"issue":"6","key":"4_CR15","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1002\/1520-6750(199410)41:6<833::AID-NAV3220410611>3.0.CO;2-Q","volume":"41","author":"O. Goldschmidt","year":"1994","unstructured":"Goldschmidt, O., Nehme, D., Yu, G.: Note: On the set-union knapsack problem. Nav. Res. Logist.\u00a041(6), 833\u2013842 (1994)","journal-title":"Nav. Res. Logist."},{"key":"4_CR16","volume-title":"Concrete Mathematics","author":"R.L. Graham","year":"1994","unstructured":"Graham, R.L., Knuth, D.E., Patashnik, O.: Concrete Mathematics, 2nd edn. Addison-Wesley, Reading (1994)","edition":"2"},{"key":"4_CR17","doi-asserted-by":"crossref","unstructured":"IBM Blue Gene Team: Overview of the IBM Blue Gene\/ P project. IBM J. Res. Develop.\u00a052(1\/2), 199\u2013220 (January\/March 2008)","DOI":"10.1147\/rd.521.0199"},{"key":"4_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/3-540-47954-6_1","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"J.P. Jones","year":"1999","unstructured":"Jones, J.P., Nitzberg, B.: Scheduling for Parallel Supercomputing: A Historical Perspective of Achievable Utilization. In: Feitelson, D.G., Rudolph, L. (eds.) JSSPP 1999. LNCS, vol.\u00a01659, pp. 1\u201316. Springer, Heidelberg (1999)"},{"issue":"4","key":"4_CR19","first-page":"267","volume":"3","author":"P. Kermani","year":"1979","unstructured":"Kermani, P., Kleinrock, L.: Virtual cut-through: A new computer communication switching technique. Computer Networks\u00a03(4), 267\u2013286 (1979)","journal-title":"Computer Networks"},{"key":"4_CR20","volume-title":"The C Programming Language","author":"B.W. Kernighan","year":"1988","unstructured":"Kernighan, B.W., Richie, D.M.: The C Programming Language, 2nd edn. Prentice-Hall, Englewood Cliffs (1988)","edition":"2"},{"issue":"4","key":"4_CR21","doi-asserted-by":"publisher","first-page":"433","DOI":"10.1109\/TC.1987.1676925","volume":"36","author":"S.Y. Lee","year":"1987","unstructured":"Lee, S.Y., Aggarwal, J.K.: A mapping strategy for parallel processing. IEEE Trans. Comput. C\u00a036(4), 433\u2013442 (1987)","journal-title":"IEEE Trans. Comput. C"},{"issue":"10","key":"4_CR22","doi-asserted-by":"publisher","first-page":"892","DOI":"10.1109\/TC.1985.6312192","volume":"C-34","author":"C.E. Leiserson","year":"1985","unstructured":"Leiserson, C.E.: Fat-Trees: Universal networks for hardware-efficient supercomputing. IEEE Trans. Comput.\u00a0C-34(10), 892\u2013901 (1985)","journal-title":"IEEE Trans. Comput."},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-60153-8_35","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"D. Lifka","year":"1995","unstructured":"Lifka, D.: The ANL\/IBM SP Scheduling System. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1995 and JSSPP 1995. LNCS, vol.\u00a0949, pp. 295\u2013303. Springer, Heidelberg (1995)"},{"key":"4_CR24","unstructured":"MacLachlan, R.A.: CMUCL User\u2019s Manual. Carnegie-Mellon University (November 2006), release 19d"},{"issue":"6","key":"4_CR25","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1109\/71.932708","volume":"12","author":"A.W. Mu\u2019alem","year":"2001","unstructured":"Mu\u2019alem, A.W., Feitelson, D.G.: Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling. IEEE Trans. Parall. Distr. Sys.\u00a012(6), 529\u2013543 (2001)","journal-title":"IEEE Trans. Parall. Distr. Sys."},{"key":"4_CR26","doi-asserted-by":"crossref","unstructured":"Navaridas, J., et al.: Effects of job and task placement on parallel scientific applications performance. In: Proc. 17th Euromicro Int\u2019l Conf. on Parallel, Distributed and Network-based Processing, pp. 55\u201361 (February 2009)","DOI":"10.1109\/PDP.2009.53"},{"issue":"2","key":"4_CR27","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1109\/2.191995","volume":"26","author":"L.M. Ni","year":"1993","unstructured":"Ni, L.M., McKinley, P.K.: A survey of wormhole routing techniques in direct networks. Computer\u00a026(2), 62\u201376 (1993)","journal-title":"Computer"},{"key":"4_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/978-3-642-04633-9_8","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"J.A. Pascual","year":"2009","unstructured":"Pascual, J.A., Navaridas, J., Miguel-Alonso, J.: Effects of Topology-Aware Allocation Policies on Scheduling Performance. In: Frachtenberg, E., Schwiegelshohn, U. (eds.) JSSPP 2009. LNCS, vol.\u00a05798, pp. 138\u2013156. Springer, Heidelberg (2009)"},{"issue":"2","key":"4_CR29","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF02477176","volume":"1","author":"P. Quinton","year":"1989","unstructured":"Quinton, P., van Dongen, V.: The mapping of linear recurrence relations on regular arrays. J. VLSI Signal Process.\u00a01(2), 95\u2013113 (1989)","journal-title":"J. VLSI Signal Process."},{"key":"4_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/BFb0022286","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"J. Skovira","year":"1996","unstructured":"Skovira, J., Chan, W., Zhou, H.: The EASY \u2013 LoadLeveler API Project. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1996 and JSSPP 1996. LNCS, vol.\u00a01162, pp. 41\u201347. Springer, Heidelberg (1996)"},{"key":"4_CR31","volume-title":"Common Lisp: the Language","author":"J..G.L. Steele","year":"1990","unstructured":"Steele, J. G.L.: Common Lisp: the Language, 2nd edn. Digital Press, Burlington (1990)","edition":"2"},{"key":"4_CR32","unstructured":"Voltaire Ltd., Herzliya, Israel: Voltaire GridVision Integrated Grid Directors User Manual (May 2007), part Number: 399Z00038"},{"key":"4_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/BFb0022287","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"M. Wan","year":"1996","unstructured":"Wan, M., Moore, R., Kremenek, G., Steube, K.: A Batch Scheduler for the Intel Paragon MPP System with a Non-Contiguous Node Allocation Algorithm. In: Feitelson, D.G., Rudolph, L. (eds.) IPPS-WS 1996 and JSSPP 1996. LNCS, vol.\u00a01162, pp. 48\u201364. Springer, Heidelberg (1996)"},{"key":"4_CR34","unstructured":"Weisser, D., et al.: Optimizing job placement on the Cray XT3. In: Proceedings of Cray User Group 2006, Lugano, Switzerland (2006)"},{"key":"4_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1007\/10968987_3","volume-title":"Job Scheduling Strategies for Parallel Processing","author":"A.B. Yoo","year":"2003","unstructured":"Yoo, A.B., Jette, M.A., Grondona, M.: SLURM: Simple Linux Utility for Resource Management. In: Feitelson, D.G., Rudolph, L., Schwiegelshohn, U. (eds.) JSSPP 2003. LNCS, vol.\u00a02862, pp. 44\u201360. Springer, Heidelberg (2003)"},{"key":"4_CR36","doi-asserted-by":"crossref","unstructured":"Yu, H., Chung, I.H., Moreira, J.: Topology mapping for Blue Gene\/L supercomputer. In: Proc. of 2006 ACM\/IEEE Conf. on Supercomputing, SC 2006. ACM, New York (2006)","DOI":"10.1145\/1188455.1188576"}],"container-title":["Lecture Notes in Computer Science","Job Scheduling Strategies for Parallel Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35867-8_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,13]],"date-time":"2023-02-13T12:46:44Z","timestamp":1676292404000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-35867-8_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642358661","9783642358678"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35867-8_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}