usenix conference policies
NFS Tricks and Benchmarking Traps
Abstract:
We describe two modifications 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.
BibTeX
@inproceedings {270252,
author = {Daniel Ellard and Margo Seltzer},
title = {{NFS} Tricks and Benchmarking Traps},
booktitle = {2003 USENIX Annual Technical Conference (USENIX ATC 03)},
year = {2003},
address = {San Antonio, TX},
url = {https://www.usenix.org/conference/2003-usenix-annual-technical-conference/nfs-tricks-and-benchmarking-traps},
publisher = {USENIX Association},
month = jun
}
author = {Daniel Ellard and Margo Seltzer},
title = {{NFS} Tricks and Benchmarking Traps},
booktitle = {2003 USENIX Annual Technical Conference (USENIX ATC 03)},
year = {2003},
address = {San Antonio, TX},
url = {https://www.usenix.org/conference/2003-usenix-annual-technical-conference/nfs-tricks-and-benchmarking-traps},
publisher = {USENIX Association},
month = jun
}
connect with us