{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T20:25:37Z","timestamp":1790799937435,"version":"4.1.0"},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2021,5,29]],"date-time":"2021-05-29T00:00:00Z","timestamp":1622246400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,5,29]],"date-time":"2021-05-29T00:00:00Z","timestamp":1622246400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100001665","name":"Agence Nationale de la Recherche","doi-asserted-by":"publisher","award":["ANR-17-CE25- 0004"],"award-info":[{"award-number":["ANR-17-CE25- 0004"]}],"id":[{"id":"10.13039\/501100001665","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009468","name":"Conseil R\u00e9gional Aquitaine","doi-asserted-by":"publisher","award":["2018-1R50119"],"award-info":[{"award-number":["2018-1R50119"]}],"id":[{"id":"10.13039\/501100009468","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Sched"],"published-print":{"date-parts":[[2021,10]]},"DOI":"10.1007\/s10951-021-00685-8","type":"journal-article","created":{"date-parts":[[2021,7,6]],"date-time":"2021-07-06T09:03:10Z","timestamp":1625562190000},"page":"469-481","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":12,"title":["Scheduling periodic I\/O access with bi-colored chains: models and algorithms"],"prefix":"10.1007","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3956-2997","authenticated-orcid":false,"given":"Emmanuel","family":"Jeannot","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Guillaume","family":"Pallez","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nicolas","family":"Vidal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2021,5,29]]},"reference":[{"key":"685_CR1","doi-asserted-by":"crossref","unstructured":"Aupy, G., Beaumont, O., & Eyraud-Dubois, L. (2019). Sizing and partitioning strategies for burst-buffers to reduce io contention. In 2019 IEEE international parallel and distributed processing symposium (IPDPS). IEEE.","DOI":"10.1109\/IPDPS.2019.00072"},{"key":"685_CR2","unstructured":"Aupy, G., Gainaru, A., & Le\u00a0F\u00e8vre, V. (2017). Periodic i\/o scheduling for super-computers. In International workshop on performance modeling, benchmarking and simulation of high performance computer systems (pp. 44\u201366). Springer."},{"key":"685_CR3","doi-asserted-by":"crossref","unstructured":"Behzad, B., Luu, H. V. T., Huchette, J., Byna, S., Aydt, R., Koziol, Q., & Snir, M. (2013). Taming parallel i\/o complexity with auto-tuning. In Proceedings of the international conference on high performance computing, networking, storage and analysis (p.\u00a068). ACM.","DOI":"10.1145\/2503210.2503278"},{"key":"685_CR4","volume-title":"Scheduling algorithms","author":"P Brucker","year":"2007","unstructured":"Brucker, P., & Brucker, P. (2007). Scheduling algorithms (Vol. 3). Berlin: Springer."},{"key":"685_CR5","doi-asserted-by":"crossref","unstructured":"Carns, P., Latham, R., Ross, R., Iskra, K., Lang, S., & Riley, K. (2009). 24\/7 characterization of petascale i\/o workloads. In IEEE international conference on cluster computing and workshops, 2009. CLUSTER\u201909 (pp. 1\u201310). IEEE.","DOI":"10.1109\/CLUSTR.2009.5289150"},{"issue":"3","key":"685_CR6","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1016\/j.future.2004.11.016","volume":"22","author":"JT Daly","year":"2006","unstructured":"Daly, J. T. (2006). A higher order estimate of the optimum checkpoint interval for restart dumps. FGCS, 22(3), 303\u2013312.","journal-title":"FGCS"},{"key":"685_CR7","doi-asserted-by":"crossref","unstructured":"Di, S., & Cappello, F. (2016). Fast error-bounded lossy hpc data compression with sz. In 2016 IEEE international parallel and distributed processing symposium (IPDPS) (pp. 730\u2013739). IEEE.","DOI":"10.1109\/IPDPS.2016.11"},{"key":"685_CR8","doi-asserted-by":"crossref","unstructured":"Dorier, M., Antoniu, G., Cappello, F., Snir, M., Orf, L. (2012). Damaris: How to efficiently leverage multicore parallelism to achieve scalable, jitter-free i\/o. In 2012 IEEE international conference on cluster computing (CLUSTER) (pp. 155\u2013163). IEEE.","DOI":"10.1109\/CLUSTER.2012.26"},{"key":"685_CR9","doi-asserted-by":"crossref","unstructured":"Dorier, M., Antoniu, G., Ross, R., Kimpe, D., & Ibrahim, S. (2014). Calciom: Mitigating i\/o interference in hpc systems through cross-application coordination. In 2014 IEEE 28th international parallel and distributed processing symposium (pp. 155\u2013164). IEEE.","DOI":"10.1109\/IPDPS.2014.27"},{"key":"685_CR10","unstructured":"Dorier, M., Ibrahim, S., Antoniu, G., & Ross, R. (2014). Omnisc\u2019io: A grammar-based approach to spatial and temporal i\/o patterns prediction. In SC14: International conference for high performance computing, networking, storage and analysis (pp. 623\u2013634). IEEE."},{"key":"685_CR11","doi-asserted-by":"crossref","unstructured":"Dreher, M., & Raffin, B. (2014). A flexible framework for asynchronous in situ and in transit analytics for scientific simulations. In 2014 14th IEEE\/ACM international symposium on cluster, cloud and grid computing (CCGrid) (pp. 277\u2013286). IEEE.","DOI":"10.1109\/CCGrid.2014.92"},{"key":"685_CR12","doi-asserted-by":"crossref","unstructured":"Gainaru, A., Aupy, G., Benoit, A., Cappello, F., Robert, Y., & Snir, M. (2015). Scheduling the i\/o of hpc applications under congestion. In 2015 IEEE international parallel and distributed processing symposium (IPDPS) (pp. 1013\u20131022). IEEE.","DOI":"10.1109\/IPDPS.2015.116"},{"key":"685_CR13","unstructured":"Hashimoto, Y., & Aida, K. (2012). Evaluation of performance degradation in hpc applications with vm consolidation. In: 2012 third international conference on networking and computing (ICNC) (pp. 273\u2013277). IEEE."},{"key":"685_CR14","doi-asserted-by":"crossref","unstructured":"Isaila, F., Carretero, J., & Ross, R. (2016). Clarisse: A middleware for data-staging coordination and control on large-scale hpc platforms. In 2016 16th IEEE\/ACM international symposium on cluster, cloud and grid computing (CCGrid) (pp. 346\u2013355). IEEE.","DOI":"10.1109\/CCGrid.2016.24"},{"key":"685_CR15","doi-asserted-by":"crossref","unstructured":"Kougkas, A., Dorier, M., Latham, R., Ross, R., & Sun, X. H. (2016). Leveraging burst buffer coordination to prevent i\/o interference. In 2016 IEEE 12th international conference on e-Science (e-Science) (pp. 371\u2013380). IEEE.","DOI":"10.1109\/eScience.2016.7870922"},{"key":"685_CR16","unstructured":"Kumar, S., Saha, A., Vishwanath, V., Carns, P., Schmidt, J. A., Scorzelli, G., Kolla, H., Grout, R., Latham, R., Ross, R., & Papkafa, M. E. (2016). Characterization and modeling of pidx parallel i\/o for performance optimization. In Proceedings of the international conference on high performance computing, networking, storage and analysis (p.\u00a067). ACM."},{"key":"685_CR17","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"J Lenstra","year":"1977","unstructured":"Lenstra, J., Rinnooy Kan, A., & Brucker, P. (1977). Complexity of machine scheduling problems. Ann. Discrete Math., 1, 343\u2013362.","journal-title":"Ann. Discrete Math."},{"key":"685_CR18","unstructured":"Leung, J., Kelly, L., & Anderson, J. H. (2004). Handbook of scheduling: Algorithms, models, and performance analysis. CRC Press Inc."},{"key":"685_CR19","doi-asserted-by":"crossref","unstructured":"Liu, N., Cope, J., Carns, P., Carothers, C., Ross, R., Grider, G., Crume, A., & Maltzahn, C. (2012). On the role of burst buffers in leadership-class storage systems. In 2012 IEEE 28th symposium on mass storage systems and technologies (MSST) (pp. 1\u201311). IEEE.","DOI":"10.1109\/MSST.2012.6232369"},{"key":"685_CR20","doi-asserted-by":"crossref","unstructured":"Lofstead, J., Zheng, F., Liu, Q., Klasky, S., Oldfield, R., Kordenbrock, T., Schwan, K., & Wolf, M. (2010). Managing variability in the io performance of petascale storage systems. In Proceedings of the 2010 ACM\/IEEE international conference for high performance computing, networking, storage and analysis (pp. 1\u201312). IEEE Computer Society.","DOI":"10.1109\/SC.2010.32"},{"key":"685_CR21","doi-asserted-by":"crossref","unstructured":"Madireddy, S., Balaprakash, P., Carns, P., Latham, R., Ross, R., Snyder, S., & Wild, S. (2018). Modeling i\/o performance variability using conditional variational autoencoders. In 2018 IEEE international conference on cluster computing (CLUSTER) (pp. 109\u2013113). IEEE.","DOI":"10.1109\/CLUSTER.2018.00022"},{"key":"685_CR22","doi-asserted-by":"crossref","unstructured":"Skinner, D., & Kramer, W. (2005). Understanding the causes of performance variability in hpc workloads. In Proceedings of the IEEE international workload characterization symposium, 2005 (pp. 137\u2013149). IEEE.","DOI":"10.1109\/IISWC.2005.1526010"},{"key":"685_CR23","unstructured":"Tanaev, V., Gordon, W., & Shafransky, Y. M. (2012). Scheduling theory. Single-stage systems (Vol. 284). Springer."},{"key":"685_CR24","doi-asserted-by":"crossref","unstructured":"Tessier, F., Malakar, P., Vishwanath, V., Jeannot, E., & Isaila, F. (2016). Topology-aware data aggregation for intensive i\/o on large-scale supercomputers. In Proceedings of the first workshop on optimization of communication in HPC (pp. 73\u201381). IEEE Press.","DOI":"10.1109\/COMHPC.2016.013"},{"key":"685_CR25","doi-asserted-by":"crossref","unstructured":"Uselton, A., Howison, M., Wright, N. J., Skinner, D., Keen, N., Shalf, J., Karavanic, K. L., & Oliker, L. (2010). Parallel i\/o performance: From events to ensembles. In 2010 IEEE international symposium on parallel & distributed processing (IPDPS) (pp. 1\u201311). IEEE.","DOI":"10.1109\/IPDPS.2010.5470424"},{"issue":"2","key":"685_CR26","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0167-6377(94)90064-7","volume":"16","author":"ED Wikum","year":"1994","unstructured":"Wikum, E. D., Llewellyn, D. C., & Nemhauser, G. L. (1994). One-machine generalized precedence constrained scheduling problems. Operations Research Letters, 16(2), 87\u201399.","journal-title":"Operations Research Letters"},{"key":"685_CR27","unstructured":"Wu, G., Chen, J., Wang, J. (2018). On scheduling two-stage jobs on multiple two-stage flowshops. arXiv:1801.09089"},{"key":"685_CR28","doi-asserted-by":"crossref","unstructured":"Xie, B., Chase, J., Dillow, D., Drokin, O., Klasky, S., Oral, S., & Podhorszki, N. (2012). Characterizing output bottlenecks in a supercomputer. In Proceedings of the international conference on high performance computing, networking, storage and analysis (p.\u00a08). IEEE Computer Society Press.","DOI":"10.1109\/SC.2012.28"},{"key":"685_CR29","doi-asserted-by":"crossref","unstructured":"Xu, L., Wang, Y., Lux, T., Chang, T., Bernard, J., Li, B., Hong, Y., Cameron, K., & Watson, L. (2020). Modeling i\/o performance variability in high-performance computing systems using mixture distributions. Journal of Parallel and Distributed Computing, 139, 87\u201398.","DOI":"10.1016\/j.jpdc.2020.01.005"},{"key":"685_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, X., Davis, K., & Jiang, S. (2012). Opportunistic data-driven execution of parallel programs for efficient i\/o services. In 2012 IEEE 26th international parallel & distributed processing symposium (IPDPS) (pp. 330\u2013341). IEEE.","DOI":"10.1109\/IPDPS.2012.39"},{"key":"685_CR31","doi-asserted-by":"crossref","unstructured":"Zhou, Z., Yang, X., Zhao, D., Rich, P., Tang, W., Wang, J., & Lan, Z. (2015). I\/o-aware batch scheduling for petascale computing systems. In 2015 IEEE international conference on cluster computing (CLUSTER) (pp. 254\u2013263). IEEE.","DOI":"10.1109\/CLUSTER.2015.45"}],"container-title":["Journal of Scheduling"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-021-00685-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10951-021-00685-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10951-021-00685-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,15]],"date-time":"2021-10-15T11:30:37Z","timestamp":1634297437000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10951-021-00685-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,5,29]]},"references-count":31,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2021,10]]}},"alternative-id":["685"],"URL":"https:\/\/doi.org\/10.1007\/s10951-021-00685-8","relation":{},"ISSN":["1094-6136","1099-1425"],"issn-type":[{"value":"1094-6136","type":"print"},{"value":"1099-1425","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021,5,29]]},"assertion":[{"value":"21 April 2021","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"29 May 2021","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}