Toni Cortes
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Toni Cortes has a total of 124 co-authors. Here are the top co-authors by number of shared publications:
- Jesus Labarta
Barcelona Supercomputing Center
13 shared publications - Ramon Nou
Barcelona Supercomputing Center
12 shared publications - Alberto Miranda
Barcelona Supercomputing Center, Barcelona, Spain
8 shared publications - Jonathan Marti
Barcelona Supercomputing Center
8 shared publications - André Brinkmann
Saarland University, Saarbrücken, Germany
7 shared publications - Juan José Costa
Universitat Politecnica de Catalunya
5 shared publications
Latest Publications
- 1 October 2020
- Published by Elsevier in Future Generation Computer Systems
- Vol. 111, 491-506
CAPre: Code-Analysis based Prefetching for Persistent Object Stores
- 1 October 2020
- Published by Elsevier in Future Generation Computer Systems
- Vol. 111, 491-506
CAPre: Code-Analysis based Prefetching for Persistent Object Stores
- Open Access
- 26 February 2020
- Published by Springer Nature in CCF Transactions on High Performance Computing
- Vol. 2 (1) , 3-15
Freezing time emulating new and faster devices with virtual machines
- 26 February 2020
- Published by Springer Nature in CCF Transactions on High Performance Computing
- Vol. 2 (1) , 3-15
Open AccessFreezing time emulating new and faster devices with virtual machines
- 17 January 2020
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 35 (1) , 72-91
GekkoFS — A Temporary Burst Buffer File System for HPC Applications
- 17 January 2020
- Published by Springer Nature in Journal of Computer Science and Technology
- Vol. 35 (1) , 72-91
GekkoFS — A Temporary Burst Buffer File System for HPC Applications
- Open Access
Adaptive Request Scheduling for the I/O Forwarding Layer using Reinforcement Learning
I/O optimization techniques such as request scheduling can improve performance mainly for the access patterns they target, or they depend on the precise tune of parameters. In this paper, we propose an approach to adapt the I/O forwarding layer of HPC systems to the application access patterns by tuning a request scheduler. Our case study is the TWINS scheduling algorithm, where performance improvements depend on the timewindow parameter, which depends on the current workload. Our approach uses a reinforcement learning technique – contextual bandits – to make the system capable of learning the best parameter value to each access pattern during its execution, without a previous training phase. We evaluate our proposal and demonstrate it can achieve a precision of 88% on the parameter selection in the first hundreds of observations of an access pattern. After having observed an access pattern for a few minutes (not necessarily contiguously), we demonstrate that the system will be able to optimize its performance for the rest of the life of the system (years).
Open AccessAdaptive Request Scheduling for the I/O Forwarding Layer using Reinforcement Learning
I/O optimization techniques such as request scheduling can improve performance mainly for the access patterns they target, or they depend on the precise tune of parameters. In this paper, we propose an approach to adapt the I/O forwarding layer of HPC systems to the application access patterns by tuning a request scheduler. Our case study is the TWINS scheduling algorithm, where performance improvements depend on the timewindow parameter, which depends on the current workload. Our approach uses a reinforcement learning technique – contextual bandits – to make the system capable of learning the best parameter value to each access pattern during its execution, without a previous training phase. We evaluate our proposal and demonstrate it can achieve a precision of 88% on the parameter selection in the first hundreds of observations of an access pattern. After having observed an access pattern for a few minutes (not necessarily contiguously), we demonstrate that the system will be able to optimize its performance for the rest of the life of the system (years).
- 1 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 319-324
GekkoFS - A Temporary Distributed File System for HPC Applications
We present GekkoFS, a temporary, highly-scalable burst buffer file system which has been specifically optimized for new access patterns of data-intensive High-Performance Computing (HPC) applications. The file system provides relaxed POSIX semantics, only offering features which are actually required by most (not all) applications. It is able to provide scalable I/O performance and reaches millions of metadata operations already for a small number of nodes, significantly outperforming the capabilities of general-purpose parallel file systems.
- 1 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 319-324
GekkoFS - A Temporary Distributed File System for HPC Applications
We present GekkoFS, a temporary, highly-scalable burst buffer file system which has been specifically optimized for new access patterns of data-intensive High-Performance Computing (HPC) applications. The file system provides relaxed POSIX semantics, only offering features which are actually required by most (not all) applications. It is able to provide scalable I/O performance and reaches millions of metadata operations already for a small number of nodes, significantly outperforming the capabilities of general-purpose parallel file systems.
- 1 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 16-24
Freezing Time: A New Approach for Emulating Fast Storage Devices Using VM
Recently we are seeing a considerable effort from both academy and industry in proposing new technologies for storage devices. Often these devices are not readily available for evaluation and methods to allow performing their tests just from their performance parameters are an important tool for system administrators. Simulators are a traditional approach for carrying out such evaluations, however, they are more suitable for evaluating the storage device as an isolate component, mostly due to time constraints. In this paper, we propose an approach based on virtual machine technology that is capable of emulate storage devices transparently for the operating system allowing evaluation of simulating devices within a real system using any synthetic or real workload. To emulate devices in real environments it is necessary to use the currently available devices as a storage medium which creates a difficulty when the device to be emulated is faster than this storage medium. To circumvent this limitation we introduce a new technique called Freezing Time, which takes advantage of virtual machine pausing mechanism to manipulate the virtual machine clock and hide the real I/O completion time. Our approach can be implemented just requiring the hypervisor to be modified, providing a high degree of compatibility and flexibility since it is not necessary to modify neither the operating system nor the application. We evaluate our tool under a real system using old magnetic disks to emulate faster storage devices. Experiments using our technique presented an average latency error of 6.08% for read operations and 6.78% for write operations when comparing a real to device.
- 1 September 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 16-24
Freezing Time: A New Approach for Emulating Fast Storage Devices Using VM
Recently we are seeing a considerable effort from both academy and industry in proposing new technologies for storage devices. Often these devices are not readily available for evaluation and methods to allow performing their tests just from their performance parameters are an important tool for system administrators. Simulators are a traditional approach for carrying out such evaluations, however, they are more suitable for evaluating the storage device as an isolate component, mostly due to time constraints. In this paper, we propose an approach based on virtual machine technology that is capable of emulate storage devices transparently for the operating system allowing evaluation of simulating devices within a real system using any synthetic or real workload. To emulate devices in real environments it is necessary to use the currently available devices as a storage medium which creates a difficulty when the device to be emulated is faster than this storage medium. To circumvent this limitation we introduce a new technique called Freezing Time, which takes advantage of virtual machine pausing mechanism to manipulate the virtual machine clock and hide the real I/O completion time. Our approach can be implemented just requiring the hypervisor to be modified, providing a high degree of compatibility and flexibility since it is not necessary to modify neither the operating system nor the application. We evaluate our tool under a real system using old magnetic disks to emulate faster storage devices. Experiments using our technique presented an average latency error of 6.08% for read operations and 6.78% for write operations when comparing a real to device.
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 63-70
Improving OpenStack Swift interaction with the I/O Stack to Enable Software Defined Storage
This paper analyses how OpenStack Swift, a distributed object storage service for a globally used middleware, interacts with the I/O subsystem through the Operating System. This interaction, which seems organised and clean on the middleware side, becomes disordered on the device side when using mechanical disk drives, due to the way threads are used internally to request data. We will show that only modifying the Swift threading model we achieve an 18% mean improvement in performance with objects larger than 512 KiB and obtain a similar performance with smaller objects. Compared to the original scenario, the performance obtained on both scenarios is obtained in a fair way: the bandwidth is shared equally between concurrently accessed objects. Moreover, this threading model allows us to apply techniques for Software Defined Storage (SDS). We show an implementation of a Bandwidth Differentiation technique that can control each data stream and that guarantees a high utilization of the device.
- 1 November 2017
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 63-70
Improving OpenStack Swift interaction with the I/O Stack to Enable Software Defined Storage
This paper analyses how OpenStack Swift, a distributed object storage service for a globally used middleware, interacts with the I/O subsystem through the Operating System. This interaction, which seems organised and clean on the middleware side, becomes disordered on the device side when using mechanical disk drives, due to the way threads are used internally to request data. We will show that only modifying the Swift threading model we achieve an 18% mean improvement in performance with objects larger than 512 KiB and obtain a similar performance with smaller objects. Compared to the original scenario, the performance obtained on both scenarios is obtained in a fair way: the bandwidth is shared equally between concurrently accessed objects. Moreover, this threading model allows us to apply techniques for Software Defined Storage (SDS). We show an implementation of a Bandwidth Differentiation technique that can control each data stream and that guarantees a high utilization of the device.
- 20 October 2017
- Published by Springer Nature
- p. 691-700
HetFS: A Heterogeneous File System for Everyone
- 20 October 2017
- Published by Springer Nature
- p. 691-700
HetFS: A Heterogeneous File System for Everyone
- Open Access
- 9 September 2017
- Published by Springer Nature
- p. 54-62
Predicting Access to Persistent Objects Through Static Code Analysis
- 9 September 2017
- Published by Springer Nature
- p. 54-62
Open AccessPredicting Access to Persistent Objects Through Static Code Analysis
- Open Access
- 1 September 2017
- Published by Elsevier in Journal of Systems and Software
- Vol. 131, 129-145
Dataclay: A distributed data store for effective inter-player data sharing
- 1 September 2017
- Published by Elsevier in Journal of Systems and Software
- Vol. 131, 129-145
Open AccessDataclay: A distributed data store for effective inter-player data sharing