The Zebra striped network file system (1995)
Cached
Download Links
- [oslab.snu.ac.kr]
- [www.cs.berkeley.edu]
- [cs.ucsb.edu]
- [www.eecs.berkeley.edu]
- [www.cs.swarthmore.edu]
- [www.cs.swarthmore.edu]
- [calab.kaist.ac.kr]
- [www.cs.arizona.edu]
- [www.cse.ucsc.edu]
- [www.ssrc.ucsc.edu]
- [www.cse.ucsc.edu]
- [www.cs.berkeley.edu]
- [www.cs.arizona.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM Transactions on Computer Systems |
| Citations: | 256 - 5 self |
BibTeX
@INPROCEEDINGS{Hartman95thezebra,
author = {John H. Hartman and John K. Ousterhout},
title = {The Zebra striped network file system},
booktitle = {ACM Transactions on Computer Systems},
year = {1995},
pages = {29--43}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Zebra is a network file system that increases throughput by striping file data across multiple servers. Rather than striping each file separately, Zebra forms all the new data from each client into a single stream, which it then stripes using an approach similar to a log-structured file system. This provides high performance for writes of small files as well as for reads and writes of large files. Zebra also writes parity information in each stripe in the style of RAID disk arrays; this increases storage costs slightly but allows the system to continue operation even while a single storage server is unavailable. A prototype implementation of Zebra, built in the Sprite operating system, provides 4-5 times the throughput of the standard Sprite file system or NFS for large files and a 15 % to 300 % improvement for writing small files. 1
