Automatic I/O scheduling algorithm selection for parallel file systems

Abstract : This article presents our approach to provide input/output (I/O) scheduling with double adaptivity: to applications and devices. In high-performance computing environments, parallel file systems provide a shared storage infrastructure to applications. In the situation where multiple applications access this shared infrastructure concurrently, their performance can be impaired because of interference. Our work focuses on I/O scheduling as a tool to improve performance by alleviating interference effects. The role of the I/O scheduler is to decide the order in which applications' requests must be processed by the parallel file system's servers, applying optimizations to adjust the resulting access pattern for improved performance. Our approach to improve I/O scheduling results is based on using information from applications' access patterns and storage devices' sensitivity to access sequentiality. We have applied machine learning to provide the ability to automatically select the best scheduling algorithm for each situation. Our approach improves performance by up to 75% over an approach that uses the same scheduling algorithm to all situations, without adaptability. Our results evidence that both aspects – applications and storage devices – are essential to make good scheduling decisions.
Liste complète des métadonnées
Contributor : Arnaud Legrand <>
Submitted on : Thursday, January 17, 2019 - 12:11:35 PM
Last modification on : Thursday, February 7, 2019 - 5:14:41 PM


Files produced by the author(s)




Francieli Zanon Boito, Rodrigo Kassick, Philippe Olivier Alexandre Navaux, Yves Denneulin. Automatic I/O scheduling algorithm selection for parallel file systems. Concurrency and Computation: Practice and Experience, Wiley, 2016, ⟨10.1002/cpe.3606⟩. ⟨hal-01247942⟩



Record views


Files downloads