PPT-Caching and Demand-Paged Virtual Memory

Definitions Cache Copy of data that is faster to access than the original Hit if cache has copy Miss if cache does not have copy Cache block Unit of cache storage multiple memory locations. Main Points. Address Translation Concept. How do we convert a virtual address to a physical address?. Flexible Address Translation. Base and bound. Segmentation. Paging. Multilevel translation. Efficient Address Translation. Justin DeBrabant. Brown University . debrabant@cs.brown.edu. A bit of history…. 1974 – System R. query optimization . recovery . transaction serialization. lots of locks. Application. Primary Storage. Main Points. Cache concept. Hardware vs. software caches. When caches work and when they don’t. Spatial/temporal locality vs. . Zipf. workloads. Cache Replacement Policies. FIFO, MIN, LRU, LFU, Clock. U . Wisc. and HP Labs. ISCA’13. Architecture Reading Club Summer'13. 1. Key points. Big memory workloads . Memcached. , databases, graph analysis . Analysis shows. TLB misses can account for . upto. Up to this point…We assume that a process needs to load all of its address space before runninge.g., 0x0 to 0xFFFFFFFFObservation: 90% of time is spent on 10% of Demand PagingDemand paging: al INDIA . │ . 9-11 February 2011. Caching Enhancement in ASP.NET 4.0. Abhijit Jana . │ . Consultant, Microsoft. http://. abhijitjana.net. ASP.NET Caching Quick Tour. Data / Object . Caching. Output Caching. Mark Russinovich. Technical Fellow. Microsoft . Corporation. Session Code: . CLI402. *. Portions derived from David Solomon’s Windows Internals Seminar. About Me. Technical Fellow, Microsoft. Co-founder and Chief Software . Definitions. Cache. Copy of data that is faster to access than the original. Hit: if cache has copy. Miss: if cache does not have copy. Cache block. Unit of cache storage (multiple memory locations). Victor Zakhary, . Divyakant. Agrawal, Amr El . Abbadi. 1. The old problem of Caching. Disk. RAM. L. 2. L. 1. Larger. Slower. Cheaper. Smaller. Faster. Expensive. 2. The old problem of Caching. Smaller. Part . 4. Chapter 2: The Linux System. Linux History . Design Principles. Kernel Modules. Process Management. Scheduling. . Memory Management . File Systems. Input and Output . Interprocess. Communication. Chapter 7. Memory Management Techniques. ©Copyright 2008 Umakishore Ramachandran and William D. Leahy Jr.. Review. Hardware. Designing a processor.. Processor instruction-set. Interrupts. Software. Using processor as resource. Dr. Abeer Mahmoud. . Princess Nora University. Faculty of Computer & Information Systems. Computer science Department . . (Chapter-9). Virtual. . Memory. Chapter . 9: Virtual Memory. Background. Main Points. Cache concept. Hardware vs. software caches. When caches work and when they don’t. Spatial/temporal locality vs. . Zipf. workloads. Cache Replacement Policies. FIFO, MIN, LRU, LFU, Clock. &. Caching. Noah Mendelsohn. Tufts University. Email: . noah@cs.tufts.edu. Web: http://www.cs.tufts.edu/~noah. COMP 150-IDS: Internet Scale Distributed Systems . (Spring 2015). 2. Goals. Explore some general principles of performance,...