{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,26]],"date-time":"2025-09-26T13:28:32Z","timestamp":1758893312584,"version":"3.37.3"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2015,8,30]],"date-time":"2015-08-30T00:00:00Z","timestamp":1440892800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2015,8,30]],"date-time":"2015-08-30T00:00:00Z","timestamp":1440892800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF 0963839"],"award-info":[{"award-number":["CCF 0963839"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF 1018881"],"award-info":[{"award-number":["CCF 1018881"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF 1319448"],"award-info":[{"award-number":["CCF 1319448"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["RESCUE"],"award-info":[{"award-number":["RESCUE"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2016,12]]},"DOI":"10.1007\/s10951-015-0445-x","type":"journal-article","created":{"date-parts":[[2015,8,29]],"date-time":"2015-08-29T04:45:49Z","timestamp":1440823549000},"page":"627-640","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Co-scheduling algorithms for high-throughput workload execution"],"prefix":"10.1007","volume":"19","author":[{"given":"Guillaume","family":"Aupy","sequence":"first","affiliation":[]},{"given":"Manu","family":"Shantharam","sequence":"additional","affiliation":[]},{"given":"Anne","family":"Benoit","sequence":"additional","affiliation":[]},{"given":"Yves","family":"Robert","sequence":"additional","affiliation":[]},{"given":"Padma","family":"Raghavan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,30]]},"reference":[{"key":"445_CR1","unstructured":"Balay, S., Brown, J., Buschelman, K., Gropp, W. D., Kaushik, D., Knepley, M. G., McInnes, L. C., Smith, B. F., & Zhang, H. (2012). PETSc Web page. \n                    http:\/\/www.mcs.anl.gov\/petsc\n                    \n                  ."},{"key":"445_CR2","unstructured":"Balay, S., Abhyankar, S., Adams, M. F., Brown, J., Brune, P., Buschelman, K., Eijkhout, V., Gropp, W. D., Kaushik, D., Knepley, M. G., McInnes, L. C., Rupp, K., Smith, B. F., & Zhang, H. (2014). PETSc Web page. \n                    http:\/\/www.mcs.anl.gov\/petsc\n                    \n                  , \n                    http:\/\/www.mcs.anl.gov\/petsc\n                    \n                  ."},{"key":"445_CR3","unstructured":"Bhadauria, M., & McKee, S. A. (2010). An approach to resource-aware co-scheduling for CMPs. In: Proceedings of 24th ACM International Conference on Supercomputing ICS \u201910, ACM."},{"key":"445_CR4","unstructured":"Blackford, L. S., Choi, J., Cleary, A., D\u2019Azeuedo, E., Demmel, J., Dhillon, I., Hammarling, S., Henry, G., Petitet, A., Stanley, K., Walker, D., & Whaley R. C. (1997). ScaLAPACK User\u2019s Guide. SIAM. Philadelphia, PA, USA."},{"key":"445_CR5","unstructured":"Borgesson, L. (1996). Abaqus. In: Coupled thermo-hydro-mechanical processes of fractured media\u2014mathematical and experimental studies, vol. 79. Amsterdam, Elsevier (pp. 565\u2013570)."},{"key":"445_CR6","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1002\/(SICI)1099-1425(199806)1:1<31::AID-JOS4>3.0.CO;2-R","volume":"1","author":"P Brucker","year":"1998","unstructured":"Brucker, P., Gladky, A., Hoogeveen, H., Kovalyov, M. Y., Potts, C., Tautenhahn, T., et al. (1998). Scheduling a batching machine. Journal of Scheduling, 1, 31\u201354.","journal-title":"Journal of Scheduling"},{"key":"445_CR7","doi-asserted-by":"publisher","unstructured":"Chandra, D., Guo, F., Kim, S., & Solihin, Y. (2005). Predicting inter-thread cache contention on a chip multi-processor architecture. In: HPCA 11, IEEE, (pp. 340\u2013351). doi:\n                    10.1109\/HPCA.2005.27\n                    \n                  .","DOI":"10.1109\/HPCA.2005.27"},{"issue":"4","key":"445_CR8","doi-asserted-by":"publisher","first-page":"808","DOI":"10.1137\/0209062","volume":"9","author":"EG Coffman Jr","year":"1980","unstructured":"Coffman, E. G, Jr, Garey, M. R., Johnson, D. S., & Tarjan, R. E. (1980). Performance bounds for level-oriented two-dimensional packing algorithms. SIAM Journal on Computing, 9(4), 808\u2013826.","journal-title":"SIAM Journal on Computing"},{"key":"445_CR9","volume-title":"Introduction to algorithms","author":"T\u00a0H Cormen","year":"2009","unstructured":"Cormen, T\u00a0. H., Leiserson, C\u00a0. E., Rivest, R\u00a0. L., & Stein, C. (2009). Introduction to algorithms. Cambridge: The MIT Press."},{"key":"445_CR10","doi-asserted-by":"crossref","unstructured":"Deb, R. K., & Serfozo, R. F. (1973). Optimal control of batch service queues. Advances in Applied Probability, 340\u2013361.","DOI":"10.2307\/1426040"},{"key":"445_CR11","volume-title":"Handbook of scheduling: Algorithms, models, and performance analysis","author":"M Drozdowski","year":"2003","unstructured":"Drozdowski, M. (2003). Scheduling parallel tasks: Algorithms and complexity, Chapter 26. In J. Y. T. Leung (Ed.), Handbook of scheduling: Algorithms, models, and performance analysis. Boca Raton: Chapman\/CRC."},{"key":"445_CR12","volume-title":"Handbook of scheduling: Algorithms, models, and performance analysis","author":"PF Dutot","year":"2003","unstructured":"Dutot, P. F. (2003). Scheduling parallel tasks: Approximation algorithms, Chapter 26. In J. Y. T. Leung (Ed.), Handbook of scheduling: Algorithms, models, and performance analysis. Boca Rato: Chapman\/CRC."},{"issue":"11","key":"445_CR13","doi-asserted-by":"publisher","first-page":"1066","DOI":"10.1109\/TPDS.2005.130","volume":"16","author":"E Frachtenberg","year":"2005","unstructured":"Frachtenberg, E., Feitelson, D., Petrini, F., & Fernandez, J. (2005). Adaptive parallel job scheduling with flexible coscheduling. IEEE Transactions on Parallel and Distributed Systems, 16(11), 1066\u20131077. doi:\n                    10.1109\/TPDS.2005.130\n                    \n                  .","journal-title":"IEEE Transactions on Parallel and Distributed Systems"},{"key":"445_CR14","volume-title":"Computers and intractability. A guide to the theory of NP-completeness.","author":"MR Garey","year":"1979","unstructured":"Garey, M. R., & Johnson, D. S. (1979). Computers and intractability. A guide to the theory of NP-completeness. New York: W.H, Freeman and Co."},{"key":"445_CR15","unstructured":"Gordon. (2011). Gordon user guide: Technical summary. \n                    http:\/\/www.sdsc.edu\/us\/resources\/gordon\/"},{"key":"445_CR16","doi-asserted-by":"publisher","unstructured":"Hankendi, C., & Coskun, A. (2012). Reducing the energy cost of computing through efficient co-scheduling of parallel workloads. In: Design, Automation Test in Europe Conference Exhibition (DATE), 2012, (pp. 994\u2013999). doi:\n                    10.1109\/DATE.2012.6176641\n                    \n                  .","DOI":"10.1109\/DATE.2012.6176641"},{"key":"445_CR17","unstructured":"Heroux, M. A., Doerfler, D. W., Crozier, P. S., Willenbring, J. M., Edwards, H. C., Williams, A., Rajan, M., Keiter, E. R., Thornquist, H. K., & Numrich, R. W. (2009). Improving performance via mini-applications. Research Report 5574, Sandia National Laboratories, USA."},{"issue":"2","key":"445_CR18","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/0167-6377(86)90104-5","volume":"5","author":"Y Ikura","year":"1986","unstructured":"Ikura, Y., & Gimple, M. (1986). Efficient scheduling algorithms for a single batch processing machine. Operations Research Letters, 5(2), 61\u201365.","journal-title":"Operations Research Letters"},{"key":"445_CR19","unstructured":"Kamil, S., Shalf, J., & Strohmaier, E. (2008). Power efficiency in high performance computing. In: IPDPS, IEEE."},{"key":"445_CR20","unstructured":"Koehler, F., & Khuller, S. (2013). Optimal batch schedules for parallel machines. In: Proceedings of the 13th Annual Algorithms and Data Structures Symposium."},{"issue":"04","key":"445_CR21","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1017\/S0269964801154033","volume":"15","author":"G Koole","year":"2001","unstructured":"Koole, G., & Righter, R. (2001). A stochastic batching and scheduling problem. Probability in the Engineering and Informational Sciences, 15(04), 465\u2013479.","journal-title":"Probability in the Engineering and Informational Sciences"},{"issue":"1","key":"445_CR22","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1103\/PhysRevB.47.558","volume":"47","author":"G Kresse","year":"1993","unstructured":"Kresse, G., & Hafner, J. (1993). Ab initio molecular dynamics for liquid metals. Physical Review B, 47(1), 558\u2013561.","journal-title":"Physical Review B"},{"key":"445_CR23","first-page":"1","volume":"10","author":"D Li","year":"2010","unstructured":"Li, D., Nikolopoulos, D. S., Cameron, K., de Supinski, B. R., & Schulz, M. (2010). Power-aware MPI task aggregation prediction for high-end computing systems. IPDPS, 10, 1\u201312.","journal-title":"IPDPS"},{"issue":"2","key":"445_CR24","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0377-2217(02)00123-6","volume":"141","author":"A Lodi","year":"2002","unstructured":"Lodi, A., Martello, S., & Monaci, M. (2002). Two-dimensional packing problems: A survey. European Journal of Operational Research, 141(2), 241\u2013252.","journal-title":"European Journal of Operational Research"},{"issue":"2","key":"445_CR25","doi-asserted-by":"publisher","first-page":"299","DOI":"10.3745\/JIPS.2011.7.2.299","volume":"7","author":"N Muthuvelu","year":"2011","unstructured":"Muthuvelu, N., Chai, I., Chikkannan, E., & Buyya, R. (2011). Batch resizing policies and techniques for fine-grain grid tasks: The nuts and bolts. Journal of Information Processing Systems, 7(2), 299\u2013320.","journal-title":"Journal of Information Processing Systems"},{"key":"445_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/jcph.1995.1039","volume":"117","author":"S Plimpton","year":"1995","unstructured":"Plimpton, S. (1995). Fast parallel algorithms for short-range molecular dynamics. Journal of Computational Physics, 117, 1\u201319.","journal-title":"Journal of Computational Physics"},{"key":"445_CR27","doi-asserted-by":"crossref","unstructured":"Potts, C. N., & Kovalyov, M. Y. (2000). Scheduling with batching: A review. European Journal of Operational Research, 120(2), 228\u2013249.","DOI":"10.1016\/S0377-2217(99)00153-8"},{"key":"445_CR28","first-page":"460","volume":"09","author":"B Rountree","year":"2009","unstructured":"Rountree, B., Lownenthal, D. K., de Supinski, B. R., Schulz, M., Freeh, V. W., & Bletsch, T. (2009). Adagio: Making DVS practical for complex HPC applications. ICS, 09, 460\u2013469.","journal-title":"ICS"},{"key":"445_CR29","doi-asserted-by":"crossref","unstructured":"Scogland, T., Subramaniam, B., & Feng, W. -C. (2011), Emerging trends on the evolving green500: Year three. In: 7th Workshop on High-Performance, Power-Aware Computing, Anchorage, Alaska, USA.","DOI":"10.1109\/IPDPS.2011.229"},{"issue":"2","key":"445_CR30","doi-asserted-by":"publisher","first-page":"1340001","DOI":"10.1142\/S012962641340001X","volume":"23","author":"M Shantharam","year":"2013","unstructured":"Shantharam, M., Youn, Y., & Raghavan, P. (2013). Speedup-aware co-schedules for efficient workload management. Parallel Processing Letters, 23(2), 1340001.","journal-title":"Parallel Processing Letters"},{"key":"445_CR31","unstructured":"Turek, J., Schwiegelshohn, U., Wolf, J. L., & Yu, P. S. (1994). Scheduling parallel tasks to minimize average response time. In: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms, Society for Industrial and Applied Mathematics (pp. 112\u2013121)."}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0445-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10951-015-0445-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0445-x","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-015-0445-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,17]],"date-time":"2020-05-17T15:45:21Z","timestamp":1589730321000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10951-015-0445-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,30]]},"references-count":31,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["445"],"URL":"https:\/\/doi.org\/10.1007\/s10951-015-0445-x","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"type":"print","value":"1094-6136"},{"type":"electronic","value":"1099-1425"}],"subject":[],"published":{"date-parts":[[2015,8,30]]},"assertion":[{"value":"30 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}