Results 1 - 10
of
13
Tracefs: a file system to trace them all
- In Proceedings of the Third USENIX Conference on File and Storage Technologies (FAST 2004
, 2004
"... Permission is granted for noncommercial reproduction of the work for educational or research purposes. ..."
Abstract
-
Cited by 50 (15 self)
- Add to MetaCart
(Show Context)
Permission is granted for noncommercial reproduction of the work for educational or research purposes.
New NFS Tracing Tools and Techniques for System Analysis
- In Proceedings of the Annual USENIX Conference on Large Installation Systems Administration
, 2003
"... Passive NFS traces provide an easy and unobtrusive way to measure, analyze, and gain an understanding of an NFS workload. Historically, such traces have been used primarily by file system researchers in an attempt to understand, categorize, and generalize file system workloads. However, because such ..."
Abstract
-
Cited by 42 (4 self)
- Add to MetaCart
(Show Context)
Passive NFS traces provide an easy and unobtrusive way to measure, analyze, and gain an understanding of an NFS workload. Historically, such traces have been used primarily by file system researchers in an attempt to understand, categorize, and generalize file system workloads. However, because such traces provide a wealth of detailed information about how a specific system is actually used, they should also be of interest to system administrators. We introduce a new open-source toolkit for passively gathering and summarizing NFS traces and show how to use this toolkit to perform analyses that are difficult or impossible with existing tools.
Attribute-based prediction of file properties
, 2003
"... K j k m ^ 4; \ D 3 4 2 D 4 S; K m k p 0; r 0; = s 2 3 r 4; I 3 ^ V ..."
Abstract
-
Cited by 9 (4 self)
- Add to MetaCart
(Show Context)
K j k m ^ 4; \ D 3 4 2 D 4 S; K m k p 0; r 0; = s 2 3 r 4; I 3 ^ V
Improving small file performance in object-based storage
, 2006
"... This paper proposes architectural refinements, server-driven metadata prefetching and namespace flattening, for improving the efficiency of small file workloads in object-based storage systems. Server-driven metadata prefetching consists of having the metadata server provide information and capabili ..."
Abstract
-
Cited by 7 (4 self)
- Add to MetaCart
(Show Context)
This paper proposes architectural refinements, server-driven metadata prefetching and namespace flattening, for improving the efficiency of small file workloads in object-based storage systems. Server-driven metadata prefetching consists of having the metadata server provide information and capabilities for multiple objects, rather than just one, in response to each lookup. Doing so allows clients to access the contents of many small files for each metadata server interaction, reducing access latency and metadata server load. Namespace flattening encodes the directory hierarchy into object IDs such that namespace locality translates to object ID similarity. Doing so exposes namespace relationships among objects (e.g., as hints to storage devices), improves locality in metadata indices, and enables use of ranges for exploiting them. Trace-driven simulations and experiments with a prototype implementation show significant performance benefits for small file workloads. Acknowledgements: We thank the members and companies of the PDL Consortium (including APC, EMC, Equallogic, Hewlett-Packard,
Automatic Performance Tuning in the Zettabyte File System
, 2003
"... As storage system s becom e ever larger andm orecom plex, file system s and other storage software needs tom ove away from static configuration and m nual perform nce tuning and towards dynam c configuration and autom tic run-tim perform nce tuning. The Zettabyte File System (ZFS) i ..."
Abstract
-
Cited by 7 (0 self)
- Add to MetaCart
As storage system s becom e ever larger andm orecom plex, file system s and other storage software needs tom ove away from static configuration and m nual perform nce tuning and towards dynam c configuration and autom tic run-tim perform nce tuning. The Zettabyte File System (ZFS) includesm any self-tuning and self- m naging algorithm . In this paper we present three of those algorithm : dynam c striping, autom atic block size selection, and autom tic filenam based perform nce tuning.
An NFS Trace Player for File System Evaluation
, 2003
"... File access traces have been used to drive simulations of storage management algorithms such as file caching, for workload characterization and modeling, and to identify interesting access patterns for performance optimization. Surprisingly they are rarely used to test the correctness and evaluate t ..."
Abstract
-
Cited by 6 (1 self)
- Add to MetaCart
File access traces have been used to drive simulations of storage management algorithms such as file caching, for workload characterization and modeling, and to identify interesting access patterns for performance optimization. Surprisingly they are rarely used to test the correctness and evaluate the performance of an actual file system or server. The main reason is that up until now there did not exist a flexible and easy-to-use player for file access traces. This paper describes the design, implementation, and evaluation of an NFS trace play-back tool called TBBT (Trace-Based file system Benchmarking Tool) that can automatically derive the file system hierarchy from an NFS trace, initialize the file system image with controllable aging effects, and speed up or slow down the trace play-back speed using temporal or spatial scaling without violating dependencies among trace entries. Experiments using a large NFS trace set show that TBBT can indeed produce different throughput and latency measurements than synthetic benchmarks such as SPECsfs. Moreover, TBBT's trace player is actually more efficient than SPECsfs's workload generator despite the fact that the former requires more CPU computation and disk I/O accesses.
Trace-Based Analyses and Optimizations for Network Storage Servers
, 2004
"... In this thesis, I show how network storage servers can infer useful information about the requests they are likely to see in the future by analyzing the history of requests they have observed in the past. I also show that this information can be used to improve future decisions about disk block allo ..."
Abstract
-
Cited by 4 (0 self)
- Add to MetaCart
In this thesis, I show how network storage servers can infer useful information about the requests they are likely to see in the future by analyzing the history of requests they have observed in the past. I also show that this information can be used to improve future decisions about disk block allocation and read-ahead and thereby increase network storage server performance without any change to its clients or the applications running on its clients.
Eliminating cross-server operations in scalable file systems
, 2006
"... Distributed file systems that scale by partitioning files and directories among a collection of servers inevitably encounter crossserver operations. A common example is a RENAME that moves a file from a directory managed by one server to a directory managed by another. Systems that provide the same ..."
Abstract
- Add to MetaCart
(Show Context)
Distributed file systems that scale by partitioning files and directories among a collection of servers inevitably encounter crossserver operations. A common example is a RENAME that moves a file from a directory managed by one server to a directory managed by another. Systems that provide the same semantics for cross-server operations as for those that do not span servers traditionally implement dedicated protocols for these rare operations. This paper suggests an alternate approach that exploits the existence of dynamic redistribution functionality (e.g., for load balancing, incorporation of new servers, and so on). When a client request would involve files on multiple servers, the system can redistribute those files onto one server and have it service the request. Although such redistribution is more expensive than a dedicated cross-server protocol, the rareness of such operations makes the overall performance impact minimal. Analysis of NFS traces indicates that cross-server operations make up fewer than 0.001 % of client requests, and experiments with a prototype implementation show that the performance impact is negligible when such operations make up as much as 0.01 % of operations. Thus, when dynamic redistribution functionality exists in the system, cross-server operations can be handled with little additional implementation complexity. Acknowledgements: We thank the members and companies of the PDL Consortium (including APC, EMC, Equallogic, Hewlett-Packard,
Abstract Attribute-Based Prediction of File Properties
"... We present evidence that attributes that are known to the file system when a file is created, such as its name, permission mode, and owner, are often strongly related to future properties of the file such as its ultimate size, lifespan, and access pattern. More importantly, we show that we can explo ..."
Abstract
- Add to MetaCart
(Show Context)
We present evidence that attributes that are known to the file system when a file is created, such as its name, permission mode, and owner, are often strongly related to future properties of the file such as its ultimate size, lifespan, and access pattern. More importantly, we show that we can exploit these relationships to automatically generate predictive models for these properties, and that these predictions are sufficiently accurate to enable optimizations. 1
