aIOLi: an input/output library for cluster of SMP

Lèbre, Adrien; Denneulin, Yves

doi:10.1109/ccgrid.2005.1558684

Cited by 2 publications

(2 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The first implementation of the aIOLi prototype [13] provided an efficient transparent management of parallel I/O for one application within a SMP node. All I/O requests, before being sent to a 6 remote server, were analyzed to find aggregation possibilities and reordered to favor sequentiality.…”

Section: System Overviewmentioning

confidence: 99%

“…The first prototype of aIOLi [13], was a library dedicated to the optimization of I/O in a single node. Since we were within a single node (only one operating system), coherency mechanisms were provided by the underlying file-system stack (single buffer cache) and we implemented a physical aggregation mechanism: small contiguous requests were merged into a larger one which was sent by the kernel to the remote file system.…”

Section: Aggregation and Virtual Aggregationmentioning

confidence: 99%

See 1 more Smart Citation

I/O Scheduling Service for Multi-Application Clusters

Lèbre

Huard

Denneulin

et al. 2006

2006 IEEE International Conference on Cluster Computing

View full text Add to dashboard Cite

Distributed applications, especially the ones being I/O intensive, often access the storage subsystem in a non-sequential way (stride requests). Since such behaviors lower the overall system performance, many applications use parallel I/O libraries such as ROMIO to gather and reorder requests. In the meantime, as cluster usage grows, several applications are often executed concurrently, competing for access to storage subsystems and, thus, potentially canceling optimizations brought by Parallel I/O libraries.The aIOLi project aims at optimizing the I/O accesses within the cluster and providing a simple POSIX API. This article presents an extension of aIOLi to address the issue of disjoint * This work has been done within the ID laboratory jointly supported by CNRS, INPG, INRIA, and UJF and the project LIPS between INRIA and BULL Lab. Computer resources are provided by the grid5000 french experimental grid (http://www.grid5000.fr/). 1 accesses generated by different concurrent applications in a cluster. In such a context, good trade-off has to be assessed between performance, fairness and response time. To achieve this, an I/O scheduling algorithm together with a «requests aggregator» that take into account both application access patterns and global system load, have been designed and merged into aIOLi. This improvement led to the implementation of a new generic framework pluggable into any I/O file system layer. A test composed of two concurrent IOR benchmarks showed improvements on read accesses by a factor ranging from 3.5 to 35 with POSIX calls and from 3.3 to 5 with ROMIO, both reference benchmarks executed on a traditional NFS server without any additional optimizations.

show abstract

Section: System Overviewmentioning

confidence: 99%

Section: Aggregation and Virtual Aggregationmentioning

confidence: 99%