{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,29]],"date-time":"2025-09-29T08:25:37Z","timestamp":1759134337674},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,3,11]],"date-time":"2014-03-11T00:00:00Z","timestamp":1394496000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2014,6]]},"DOI":"10.1007\/s11227-014-1142-9","type":"journal-article","created":{"date-parts":[[2014,3,10]],"date-time":"2014-03-10T18:20:47Z","timestamp":1394475647000},"page":"1113-1140","source":"Crossref","is-referenced-by-count":8,"title":["Scheduling parallel jobs on multicore clusters using CPU oversubscription"],"prefix":"10.1007","volume":"68","author":[{"given":"Gladys","family":"Utrera","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Julita","family":"Corbalan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jes\u00fas","family":"Labarta","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,3,11]]},"reference":[{"key":"1142_CR1","unstructured":"Top500 supercomputers sites (2013) http:\/\/www.top500.org\/ . Accessed 7 Mar 2014"},{"key":"1142_CR2","doi-asserted-by":"crossref","unstructured":"Feitelson DG, Rudolph L, Schwiegelshohn U, Sevcik KC, Wong P (1997) Theory and practice in parallel job scheduling. Lect Notes Comput Sci 1291:1\u201334","DOI":"10.1007\/3-540-63574-2_14"},{"key":"1142_CR3","doi-asserted-by":"crossref","unstructured":"Feitelson DG, Rudolph L (1996) Toward convergence in job schedulers for parallel supercomputers. In: Job scheduling strategies for parallel processing. Springer-Verlag, New York, pp 1\u201326","DOI":"10.1007\/BFb0022284"},{"key":"1142_CR4","doi-asserted-by":"crossref","unstructured":"Utrera G, Corbal\u00e1n J, Labarta J (2004) Implementing malleability on MPI jobs. In: Proceedings of the 13th international conference on parallel architectures and compilation techniques, PACT \u201904. IEEE Computer Society, Washington, pp 215\u2013224","DOI":"10.1109\/PACT.2004.1342555"},{"key":"1142_CR5","doi-asserted-by":"crossref","unstructured":"Subotic V, Labarta J, Valero M (2010) Simulation environment for studying overlap of communication and computation. Performance analysis of systems and software (ISPASS). In: 2010 IEEE international symposium on White Plains, pp 115\u2013116","DOI":"10.1109\/ISPASS.2010.5452053"},{"key":"1142_CR6","unstructured":"Utrera G, Tabik S, Corbal\u00e1n J, Labarta J (2011) A job scheduling approach to reduce waiting times. In: Technical report, Technical University of Catalonia (UPC-DAC-RR-2012-1, October 2011) http:\/\/www.ac.upc.edu\/app\/research-reports\/html\/2012\/1\/tec_repor_092011 . Accessed 18 Feb 2012"},{"issue":"4","key":"1142_CR7","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1016\/0743-7315(92)90014-E","volume":"16","author":"DG Feitelson","year":"1992","unstructured":"Feitelson DG, Rudolph L (1992) Gang scheduling performance benefits for fine-grain synchronization. J Parallel Distrib Comput 16(4):306\u2013318","journal-title":"J Parallel Distrib Comput"},{"key":"1142_CR8","first-page":"133","volume-title":"Lecture notes in computer science","author":"Y Zhang","year":"2001","unstructured":"Zhang Y, Franke H, Moreira J, Sivasubramaniam A (2001) An integrated approach to parallel scheduling using gang-scheduling, backfilling, and migration. Job scheduling strategies for parallel processing. In: Feitelson D, Rudolph L (eds) Lecture notes in computer science, vol 2221. Springer, Berlin, Heidelberg, pp 133\u2013158"},{"key":"1142_CR9","unstructured":"Parallel workload archive (2013) http:\/\/www.cs.huji.ac.il\/labs\/parallel\/workload\/ . Accessed 7 Mar 2014"},{"key":"1142_CR10","doi-asserted-by":"crossref","unstructured":"Buisson J, Sonmez O, Mohamed H, Lammers W, Epema D (2007) Scheduling malleable applications in multicluster systems. In: Proceedings of the IEEE international conference on cluster computing 2007, pp 372\u2013381","DOI":"10.1109\/CLUSTR.2007.4629252"},{"key":"1142_CR11","unstructured":"Cera MC, Georgiou Y, Richard O, Maillard N, Navaux POA (2010) Supporting malleability in parallel architectures with dynamic cpusets mapping and dynamic MPI. In: Proceedings of the 11th international conference on distributed computing and networking, ICDCN\u201910. Springer-Verlag, Berlin, Heidelberg, pp 242\u2013257"},{"key":"1142_CR12","doi-asserted-by":"crossref","unstructured":"El Maghraoui K, Desell TJ, Szymanski BK, Varela CA (2007) Dynamic malleability in iterative MPI applications. In: Proceedings of the 7th IEEE international symposium on cluster computing and the grid, CCGRID \u201907. IEEE Computer Society, Washington, pp 591\u2013598","DOI":"10.1109\/CCGRID.2007.45"},{"key":"1142_CR13","doi-asserted-by":"crossref","unstructured":"Iancu C, Hofmeyr S, Zheng Y, Blagojevic F (2010) Oversubscription on multicore processors. In: 24th international parallel and distributed processing symposium (IPDPS), pp 1\u201311","DOI":"10.1109\/IPDPS.2010.5470434"},{"key":"1142_CR14","doi-asserted-by":"crossref","unstructured":"Padhye J, Dowdy LW (1996) Dynamic versus adaptive processor allocation policies for message passing parallel computers: an empirical comparison. In: Proceedings of the workshop on job scheduling strategies for parallel processing. Springer-Verlag, London, pp 224\u2013243","DOI":"10.1007\/BFb0022296"},{"key":"1142_CR15","doi-asserted-by":"crossref","first-page":"1571","DOI":"10.1016\/S0743-7315(02)91869-1","volume":"62","author":"W Cirne","year":"2002","unstructured":"Cirne W, Berman F (2002) Using moldability to improve the performance of supercomputer jobs. J Parallel Distrib Comput 62:1571\u20131601","journal-title":"J Parallel Distrib Comput"},{"key":"1142_CR16","doi-asserted-by":"crossref","unstructured":"Downey AB (1997) A model for speedup of parallel programs. In: Technical report, University of California, Berkerley","DOI":"10.21236\/ADA637068"},{"key":"1142_CR17","unstructured":"Sodan AC, Jin W (2010) Backfilling with fairness and slack for parallel job scheduling. J Phys Conf Ser 256(1):012\u2013023"},{"key":"1142_CR18","doi-asserted-by":"crossref","unstructured":"Sudarsan R, Ribbens CJ (2009) Scheduling resizable parallel applications. In: International parallel and distributed processing symposium, pp 1\u201310","DOI":"10.1109\/IPDPS.2009.5161077"},{"key":"1142_CR19","doi-asserted-by":"crossref","unstructured":"McCann C, Zahorjan J (1994) Processor allocation policies for message-passing parallel computers. In: Proceedings of the 1994 ACM SIGMETRICS conference on measurement and modeling of computer systems, SIGMETRICS \u201994. ACM, New York, pp 19\u201332","DOI":"10.1145\/183018.183022"},{"key":"1142_CR20","unstructured":"NAS Parallel Benchmarks (2013) http:\/\/www.nas.nasa.gov\/Resources\/Software\/npb.html . Accessed 7 Mar 2014"},{"issue":"6","key":"1142_CR21","doi-asserted-by":"crossref","first-page":"581","DOI":"10.1109\/TPDS.2003.1206505","volume":"14","author":"Y Wiseman","year":"2003","unstructured":"Wiseman Y, Feitelson DG (2003) Paired gang scheduling. IEEE Trans Parallel Distrib Syst 14(6):581\u2013592","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1142_CR22","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1145\/380749.380764","volume":"19","author":"AC Arpaci-Dusseau","year":"2001","unstructured":"Arpaci-Dusseau AC (2001) Implicit coscheduling: coordinated scheduling with implicit information in distributed systems. ACM Trans Comput Syst 19:283\u2013331","journal-title":"ACM Trans Comput Syst"},{"key":"1142_CR23","doi-asserted-by":"crossref","unstructured":"Zhang Y, Sivasubramaniam A, Moreira J, Franke H (2000) A simulation-based study of scheduling mechanisms for a dynamic cluster environment. In: Proceedings of the 14th international conference on supercomputing, ICS\u201900. ACM, New York, pp 100\u2013109","DOI":"10.1145\/335231.335241"},{"key":"1142_CR24","doi-asserted-by":"crossref","unstructured":"Utrera G, Corbal\u00e1n J, Labarta J (2004) Scheduling of MPI applications: self-co-scheduling. In: Proceedings of the Euro-Par 2004 conference, 31th August\u20133rd September 2004, Italy. Lecture notes in computer science, vol 3149, pp 238\u2013245. Springer, New York","DOI":"10.1007\/978-3-540-27866-5_31"},{"key":"1142_CR25","doi-asserted-by":"crossref","unstructured":"Utrera G, Tabik S, Corbal\u00e1n J, Labarta J (2012) A job scheduling approach for multi-core clusters based on virtual malleability. In: Euro-Par, pp 191\u2013203","DOI":"10.1007\/978-3-642-32820-6_20"},{"key":"1142_CR26","doi-asserted-by":"crossref","unstructured":"Lifka DA (1995) The ANL\/IBM SP scheduling system. In: Job scheduling strategies for parallel processing. Springer Berlin, Heidelberg, pp 295\u2013303 (1995)","DOI":"10.1007\/3-540-60153-8_35"},{"issue":"6","key":"1142_CR27","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1109\/71.932708","volume":"12","author":"AW Mu\u2019alem","year":"2001","unstructured":"Mu\u2019alem AW, Feitelson DG (2001) Utilization, predictability, workloads, and user runtime estimates in scheduling the IBM SP2 with backfilling. IEEE Trans Parallel Distrib Syst 12(6):529\u2013543","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"1142_CR28","unstructured":"MPI library (2013) http:\/\/www.mcs.anl.gov\/research\/projects\/mpi\/ . Accessed 7 Mar 2014"},{"key":"1142_CR29","volume-title":"Simulating computer systems: techniques and tools","author":"MH MacDougall","year":"1987","unstructured":"MacDougall MH (1987) Simulating computer systems: techniques and tools. MIT Press, Cambridge"},{"key":"1142_CR30","doi-asserted-by":"crossref","unstructured":"Subhlok J, Venkataramaiah S, Singh A (2002) Characterizing NAS benchmark performance on shared heterogeneous networks. In: Proceedings of the 16th international parallel and distributed processing symposium, IPDPS \u201902. IEEE Computer Society, Washington, pp 91","DOI":"10.1109\/IPDPS.2002.1015659"},{"key":"1142_CR31","unstructured":"Intel MPI Benchmarks (2011) http:\/\/software.intel.com\/en-us\/articles\/intel-mpi-benchmarks . Accessed 7 Mar 2014"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1142-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11227-014-1142-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-014-1142-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T09:12:02Z","timestamp":1565255522000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11227-014-1142-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,11]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,6]]}},"alternative-id":["1142"],"URL":"https:\/\/doi.org\/10.1007\/s11227-014-1142-9","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,11]]}}}