NFS Tricks and Benchmarking Traps

DSpace/Manakin Repository

NFS Tricks and Benchmarking Traps

Citable link to this page

. . . . . .

Title: NFS Tricks and Benchmarking Traps
Author: Seltzer, Margo; Ellard, Daniel

Note: Order does not necessarily reflect citation order of authors.

Citation: Ellard, Daniel and Margo Seltzer. 2003. NFS tricks and benchmarking traps. Proceedings of the FREENIX track, 2003 USENIX annual technical conference: June 9-14, 2003, San Antonio, Texas, ed. USENIX Annual Technical Conference, 101-114. Berkeley, California: USENIX Association.
Full Text & Related Files:
Abstract: We describe two modi cations to the FreeBSD 4.6 NFS server to increase read throughput by improving the read-ahead heuristic to deal with reordered requests and stride access patterns. We show that for some stride access patterns, our new heuristics improve end-to-end NFS throughput by nearly a factor of two. We also show that benchmarking and experimenting with changes to an NFS server can be a subtle and challenging task, and that it is often difficult to distinguish the impact of a new algorithm or heuristic from the quirks of the underlying software and hardware with which they interact. We discuss these quirks and their potential effects.
Other Sources: www.eecs.harvard.edu/~margo/papers/freenix03/
Terms of Use: This article is made available under the terms and conditions applicable to Other Posted Material, as set forth at http://nrs.harvard.edu/urn-3:HUL.InstRepos:dash.current.terms-of-use#LAA
Citable link to this page: http://nrs.harvard.edu/urn-3:HUL.InstRepos:2799040

Show full Dublin Core record

This item appears in the following Collection(s)

  • FAS Scholarly Articles [7374]
    Peer reviewed scholarly articles from the Faculty of Arts and Sciences of Harvard University
 
 

Search DASH


Advanced Search
 
 

Submitters