Project File System Design – Dropbox Paper
Project File System Design Paper Docs ML MW SZ JC Share Project File System Design Group 98 Name Autograder Login Email Jay Chou student430 jaychou@berkeley.edu Michelle Wang student292 michellew@berkeley.edu Melody Lai student323 melody_lai@berkeley.edu Selena Zhao student473 selenazhao@berkeley.edu Buffer Cache Data Structures and Functions Creating a new file for implementing the buffer cache cache.h, we add the following structs: static const size_t MAX_CAPACITY = 64; struct cache_entry { bool dirty; bool valid; char data[BLOCK_SECTOR_SIZE]; struct lock lock; struct block *block; struct list_elem elem; }; struct list cache_list; struct lock cache_lock; // for synchronizing list operations // all methods in cache.c so that they can be accessed by other files void cache_init(void); void cache_read(struct block *block, block_sector_t sector, void *buffer); void
Dropbox
saved by
related reading
- Buffer cache | CS 162 Project 3cs162.org
- Disk Cachechromium.org
- Assessment 1 Practiceweb.stanford.edu
- Circular buffer - Wikipediaen.wikipedia.org
- abseil / Performance Hintsabseil.io
- A very concrete explanation of how a cache worksparksb.github.io
- Cache Lines - Algorithmicaen.algorithmica.org
- FFS-annotated.pdfdsf.berkeley.edu
- Build Your Own Databasenan.fyi
- LRU Cache: How It Works (Data Structure & Code) | Interview Cakeinterviewcake.com
- Prolly Trees | DoltHub Blogdolthub.com
- How Does a Database Work?cstack.github.io