# References — Session 3: Storage, RAID and ZFS

1. Ghemawat, S., Gobioff, H., & Leung, S.-T. (2003). The Google file system. *Proceedings of SOSP '03*, 29–43. https://doi.org/10.1145/945445.945450
   - Chunked, replicated storage designed for large sequential files — the shape the 1 TB video archive takes, and the reason object storage, not a RAID array, carries the long tail. The open problem is that GFS assumes few large files and append-heavy access; a media catalogue with 6,000 small records and collaborative review changes that assumption. Redraw the architecture diagram; no third-party figure is reused.
2. Rodeh, O., Bacik, J., & Mason, C. (2013). BTRFS: The Linux B-tree filesystem. *ACM Transactions on Storage, 9*(3), 1–32. https://doi.org/10.1145/2501620.2501623
   - Makes checksums, copy-on-write and snapshots concrete — the mechanisms the ZFS half of the lab demonstrates and the reason a resilver walks allocated blocks rather than raw capacity. Snapshot cost and restore time for very large video files are rarely quantified. The B-tree figures can be rebuilt as a stacked slab.
3. DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P., & Vogels, W. (2007). Dynamo: Amazon's highly available key-value store. *Proceedings of SOSP '07*, 205–220. https://doi.org/10.1145/1294261.1294281
   - Frames availability as a design target rather than a property you buy — the frame the lab applies when it treats a finished rebuild, not a benchmark, as the availability promise. Durable, consistent review of the media catalogue during a repair remains open. The ring diagram is a redraw candidate.

**Teaching note.** Narrate Ghemawat et al. (2003) for 5–8 minutes and connect it to the capacity table: the archive is a sequence of large files and belongs in object storage, while the working set is a filesystem on block storage. Assign Rodeh et al. (2013)'s abstract before the ZFS steps, then restate the open problem as the weekly question: which mix of block and object storage, and which tiering and snapshot policy, keeps the archive both cheap and restorable? The references are third-party; redraw by default and publish no figure without a clear-rights sidecar.
