Publication:

An NFS Trace Player for File System Evaluation

Loading...
Thumbnail Image

Date

2003

Published Version

Published Version

Journal Title

Journal ISSN

Volume Title

Publisher

The Harvard community has made this article openly available. Please share how this access benefits you.

Research Projects

Organizational Units

Journal Issue

Citation

Zhu, Ningning, Jiawu Chen, Tzi-cker Chiueh, and Daniel Ellard. 2003. An NFS Trace Player for File System Evaluation. Harvard Computer Science Group Technical Report TR-16-03.

Abstract

File system traces have been used in simulation of specific design techniques such as disk scheduling, in workload characterization and modeling, and in identifying interesting file access patterns for performance optimization. Surprisingly they are rarely used to test the correctness and to evaluate the performance of an actual file system or server. The main reason is that up until now there does not exist a flexible and easy-to-use trace player that, given an input trace, can properly initialize the test file system and feed the trace to the test file system in such a way that respects the dependency constraint among file access requests in the trace. This paper describes the design, implementation, and evaluation of an NFS trace play-back tool called FEUT (File system Evaluation Using Traces), which can automatically derive the initial file system image from a trace, can speed up or slow down a trace play-back using temporal or spatial scaling, and features a highly efficient implementation that minimizes the CPU and disk I/O overhead during trace play-back. Experiments using a large NFS trace set show that trace-driven file system evaluation can indeed produce substantially different throughput and latency measurements than synthetic benchmarks such as SPECsfs, and FEUT’s trace player is actually more efficient that SPECsfs’s workload generator despite the fact that the former requires more CPU computation and disk I/O accesses.

Description

Other Available Sources

Research Data

Keywords

Terms of Use

This article is made available under the terms and conditions applicable to Other Posted Material (LAA), as set forth at Terms of Service

Endorsement

Review

Supplemented By

Related Stories