Part 5: I/O, File Systems, and Data ManagementInternational audienceThis paper presents a novel mechanism to dynamically re-size and re-distribute stripes on the storage servers in distributed file systems. To put this mechanism to work, the information about logical I/O access on the client side is piggybacked to physical I/O access on the storage server side, for building the relationship between the logical I/O access and physical I/O access. Moreover, this newly presented mechanism supports varying size of stripes on the storage servers to obtain finer concurrency granularity on accessing to data stripes. As a result, the mapping relationship can be utilized to direct stripe re-sizing and re-distributing on the storage servers dynamical...
In this paper, we describe techniques for determining the stripe unit size and the degree of stripin...
More and more parallel applications are running in a distributed environment to take advantage of ea...
Disk drives are the bottleneck in the processing of large amounts of data used in almost all common ...
Parallel systems leverage parallel file systems to efficiently perform I/O to shared files. These pa...
[[abstract]]© 2006 Springer Verlag-Using caching to enhance performance has been widely used in the ...
In this thesis, we propose a self-tuning approach for automatically selecting and refining the file ...
In this work, we have analyzed the input/output (I/O) activities of Cori, which is a high-performanc...
This paper presents the design of Zebra, a striped network file system. Zebra applies ideas from log...
[[abstract]]This paper presents the issues involved in selecting an appropriate file declustering me...
Large data stores are pushing the limits of modern technology. Parallel file systems provide high I/...
Data-set sizes are growing. New techniques are emerging to organize and analyze these data-sets. The...
International audienceThis paper proposes a new data placement policy to allocate data blocks across...
The allocation and management of physical storage structures in relational database systems is a tim...
This paper presents the design of Zebra, a striped network file system. Zebra applies ideas from log...
International audienceParallel file systems are at the core of HPC I/O infrastructures. Those system...
In this paper, we describe techniques for determining the stripe unit size and the degree of stripin...
More and more parallel applications are running in a distributed environment to take advantage of ea...
Disk drives are the bottleneck in the processing of large amounts of data used in almost all common ...
Parallel systems leverage parallel file systems to efficiently perform I/O to shared files. These pa...
[[abstract]]© 2006 Springer Verlag-Using caching to enhance performance has been widely used in the ...
In this thesis, we propose a self-tuning approach for automatically selecting and refining the file ...
In this work, we have analyzed the input/output (I/O) activities of Cori, which is a high-performanc...
This paper presents the design of Zebra, a striped network file system. Zebra applies ideas from log...
[[abstract]]This paper presents the issues involved in selecting an appropriate file declustering me...
Large data stores are pushing the limits of modern technology. Parallel file systems provide high I/...
Data-set sizes are growing. New techniques are emerging to organize and analyze these data-sets. The...
International audienceThis paper proposes a new data placement policy to allocate data blocks across...
The allocation and management of physical storage structures in relational database systems is a tim...
This paper presents the design of Zebra, a striped network file system. Zebra applies ideas from log...
International audienceParallel file systems are at the core of HPC I/O infrastructures. Those system...
In this paper, we describe techniques for determining the stripe unit size and the degree of stripin...
More and more parallel applications are running in a distributed environment to take advantage of ea...
Disk drives are the bottleneck in the processing of large amounts of data used in almost all common ...