PDF-cs372 Mike Dahlin Lecture#16: VM, thrashing, Replacement, Cache state

CPU Vaddr data vaddr Virt phys page page TLB Virtually addressed cache Paddr data Main memory If no match If no match Segment and page table lookup Page fault If. Message Passing Sharedmemory single copy of shared data in memory threads communicate by readingwriting to a shared location Messagepassing each thread has a copy of data in its own private memory that other threads cannot access threads communicate Replacement Using Re-Reference . Interval . Prediction (RRIP. ). Aamer Jaleel, Kevin B. Theobald. , . Simon C. Steely Jr. , Joel . Emer. Intel . Corporation. 1. / 20. The ACM IEEE International Symposium on Computer Architecture . Thrashing: exposing the lie of VM • Thrashing: processes on system require more memory than it has. – Each time one page is brought in, another page, whose contents will soon be refere Jan Reineke. j. oint work with Andreas Abel. . . Uppsala University. December 20, 2012 . The Timing Analysis Problem. Embedded Software. Timing Requirements. ?. Microarchitecture. +. What does the execution time of a program depend on?. Stefan . Podlipnig. , Laszlo . Boszormenyl. University Klagenfurt. ACM Computing Surveys, December 2003. Presenter: . Junghwan. Song. 2012.04.25. Outline. Introduction. Classification. Recency. -based. Justin Hsia. 7/22/2013. Summer 2013 -- Lecture #16. 1. CS 61C: Great Ideas in . Computer Architecture. Amdahl’s Law,. Thread Level Parallelism. 1. st. Half in Review. Write bigger, talk slower. Students afraid/too lost to . A Unified Mechanism to Address Both Cache Pollution and Thrashing. Vivek Seshadri Onur Mutlu. Michael A. . Kozuch. . Todd C. Mowry. 1. Executive Summary. Two problems degrade cache performance. Samira Khan . March 23, 2017. Agenda. Review from last lecture. Data flow model. Memory hierarchy. More Caches. The Dataflow Model (of a Computer). Von Neumann model: An instruction is fetched and executed in . Defending . Against Cache-Based Side Channel . Attacks. Mengjia. Yan, . Bhargava. . Gopireddy. , Thomas Shull, . Josep Torrellas. University of Illinois at Urbana-Champaign. http://. iacoma.cs.uiuc.edu. 2015. NATIONAL INTERAGENCY SUPPORT CACHE . PRESENTATION. The National Interagency Support Cache System is made up of 15 caches in strategic locations throughout the United States. Ft. Wainwright, AK; Boise, ID; Missoula, MT; Redmond, OR; Redding, CA; Ontario, CA; Denver, CO; Prescott, AZ; Silver City, NM; London, KY; Grand Rapids, MN; LaGrande, OR; Wenatchee, WA; Billings, MT & Coeur d’ Alene, ID. The caches are operated under the direction of federal and state agencies, including the US Forest Service; Bureau of Land Management and various states including Alaska, Minnesota and Idaho.. March 28, 2017. Agenda. Review from last lecture. Cache access. Associativity. Replacement. Cache Performance. Cache Abstraction and Metrics. Cache hit rate = (# hits) / (# hits # misses) = (# hits) / (# accesses). TLC: A Tag-less Cache for reducing dynamic first level Cache Energy Presented by Rohit Reddy Takkala Introduction First level caches are performance critical and are therefore optimized for speed. Modern processors reduce the miss ratio by using set-associative caches and optimize latency by reading all ways in parallel with the TLB(Translation Lookaside Buffer) and tag lookup. 1
 \n \n\n\r  !" # MESI protocol
Dragon update-based protocol
Impact of protocol optimizations
 \n \n\n\r Final exam details:. Monday 12/13, 1pm – 3pm. 80%+ on post-midterm material. A couple unseen problems, a few “short-response” questions. Questions ordered easy to difficult. 3+3 reference sheets (double sided).