Direct lookup and hash-based metadata placement : impact on architecture, performance and scalability of local and distributed file systems
New challenges to file systems’ metadata performance are imposed by the continuously growing average number of files existing in file systems. The traditional component based lookup approach can become a performance bottleneck for many workloads. An alternative to component-based lookup is the direc...
| Autor: | |
|---|---|
| Tipo de recurso: | tesis doctoral |
| Estado: | Versión publicada |
| Fecha de publicación: | 2019 |
| País: | España |
| Institución: | CBUC, CESCA |
| Repositorio: | TDR. Tesis Doctorales en Red |
| OAI Identifier: | oai:www.tdx.cat:10803/666788 |
| Acceso en línea: | http://hdl.handle.net/10803/666788 https://dx.doi.org/10.5821/dissertation-2117-134746 |
| Access Level: | acceso abierto |
| Palabra clave: | Àrees temàtiques de la UPC::Informàtica 004 |
| Sumario: | New challenges to file systems’ metadata performance are imposed by the continuously growing average number of files existing in file systems. The traditional component based lookup approach can become a performance bottleneck for many workloads. An alternative to component-based lookup is the direct lookup approach. It uses hash-based metadata placement to enable direct computation of the metadata location and to completely skip component traversal. This thesis evaluates the implications of the direct lookup approach on file system architecture, performance and scalability. It includes an analysis of file system traces focusing on the frequency and characteristics of hierarchical operations. These properties had not been sufficiently explored in existing literature and are fundamental to the direct lookup design. Full direct lookup file systems are implemented and evaluated for both local and distributed scenarios. |
|---|