The Improvement of LRU Liao Yansong 14302010016. The Weakness of LRU “Only Time, No Frequency”

Slides:



Advertisements
Similar presentations
How can you stay safe? At the bus stop At the bus stop Travelling on the bus Travelling on the bus How can you help the driver? How can you help the.
Advertisements

Trouble Shooting WC Flush Problems Recently we have had several cases where WC flush problems were not fixed properly, resulting in us going back to the.
361 Computer Architecture Lecture 15: Cache Memory
Page-replacement policies On some standard algorithms for the management of resident virtual memory pages.
x 4 = You were too slow………….. Click below to start again!
Cache Here we focus on cache improvements to support at least 1 instruction fetch and at least 1 data access per cycle – With a superscalar, we might need.
Oracle Touch Count Algorithm
2-4 Prime Factorization Course 2 Warm Up Warm Up Problem of the Day Problem of the Day Lesson Presentation Lesson Presentation.
Bricking the Mason 2x4 Evaporator
Numbers
CS 342 – Operating Systems Spring 2003 © Ibrahim Korpeoglu Bilkent University1 Memory Management – 4 Page Replacement Algorithms CS 342 – Operating Systems.
CS61C Midterm #2 Review Session
LRU Replacement Policy Counters Method Example
Distributed Parity Cache Table. Motivation Parity updating is a high cost operation  Especially for small write operations Read old data 、 Read Old Parity.
1  Caches load multiple bytes per block to take advantage of spatial locality  If cache block size = 2 n bytes, conceptually split memory into 2 n -byte.
ECE7995 Caching and Prefetching Techniques in Computer Systems Lecture 8: Buffer Cache in Main Memory (IV)
Redo Waits Kyle Hailey #.2 Copyright 2006 Kyle Hailey Redo REDO Lib Cache Buffer Cache Locks Network I/O.
2-6 Prime Factorization Warm Up Problem of the Day Lesson Presentation
By: Aidahani Binti Ahmad
Lecture Objectives: 1)Define set associative cache and fully associative cache. 2)Compare and contrast the performance of set associative caches, direct.
3-May-2006cse cache © DW Johnson and University of Washington1 Cache Memory CSE 410, Spring 2006 Computer Systems
Process Architecture Process Architecture - A portion of a program that can run independently of and concurrently with other portions of the program. Some.
CPS110: Page replacement Landon Cox. Replacement  Think of physical memory as a cache  What happens on a cache miss?  Page fault  Must decide what.
1 Logical I/O Julian Dyke Independent Consultant Web Version juliandyke.com © 2005 Julian Dyke.
File Systems 2. 2 File 1 File 2 Disk Blocks File-Allocation Table (FAT)
The American Flag By Dylan Hoang. Flags When you see a flag on the floor pick it up Clean the flag so it won’t be dirty Never put flags on the floor.
Memory Hierarchy and Caches. Who Cares about Memory Hierarchy? Processor Only Thus Far in Course CPU-DRAM Gap 1980: no cache in µproc; level cache,
CAM Content Addressable Memory
Visit:
Personal Independence Payment replaces Disability Living Allowance for people who were aged 16 to 64 on 8 April 2013 or reach age 16 after that date. Visit.
10-1 人生与责任 淮安工业园区实验学校 连芳芳 “ 自我介绍 ” “ 自我介绍 ” 儿童时期的我.
PAGE REPLACEMNT ALGORITHMS FUNDAMENTAL OF ALGORITHMS.
Warm Up Write each number as a product of two whole numbers in as many ways as possible · 6, 2 · 3 1 · 16, 2 · 8, 4 · 4 1 · 17.
Mixing to create a color wheel
Multiplying Decimals by Decimals
Basic Performance Parameters in Computer Architecture:
9 x 14 9 x 12 Calculate the value of the following: 1 4 × 8 =
Godrej Prakriti Sodepur | Godrej Prakriti Kolkata
Consider a Direct Mapped Cache with 4 word blocks
Business Management Courses Gives Competitive Edge.
Yahoo Mail Customer Support Number
TECHjOSH.COM TechJosh.com.
Most Effective Techniques to Park your Manual Transmission Car
How do Power Car Windows Ensure Occupants Safety
CIS 291 Education on your terms/tutorialrank.com.
Giftalove Best Cake Offers
Cache Coherence Protocols:
Cache Coherence Protocols:
Lecture 22: Cache Hierarchies, Memory
01 This is a sample text. You can replace this text. Enter your text here This is a sample text. You can replace this text. Enter your text here
Multiplying Decimals by Decimals
THANK YOU!.
CDA 5155 Caches.
Operations with Integers PowerPoint
Thank you.
Thank you.
Thank You!! For More Information Visit: m/ Call to :
Compare and Order Whole Numbers and Decimals
56% Enter your text here This is a sample text. Enter your text here
How to succeed in my course, part 1
Jazan University, Jazan KSA
½ of 6 = 3.
Multiplying Mixed Numbers
Lecture 13: Cache Basics Topics: terminology, cache organization (Sections )
Page Cache and Page Writeback
10/18: Lecture Topics Using spatial locality
Visit us:
10. If Two items are selected simultaneously a second time… Terminate the session, replace all items and begin a new presentation session If the client.
Dong Hyun Kang, Changwoo Min, Young Ik Eom
Presentation transcript:

The Improvement of LRU Liao Yansong

The Weakness of LRU “Only Time, No Frequency”

Oracle Present a New One

Crate a LRU List

‘V’ Replace ‘U’

‘V’ ‘L’

Set a Mark for each Block

When the value of last Mark is greater than two

‘S’ ‘A’

Insert a New ‘Y’

If ‘Y’ is Visited again

‘Y’ Won’t Be Put in Hot Edge until …… Decrease Operation Times

But Another Question Arises…… Dirty Block

Dirty Block Won’t Be Wrote Back until…… Decrease Operation Times

But If Dirty Blocks Are Too More, the Cost of Finding a Clean Block Is Too High

Create a Dirty LRU List

Of Course, the Size of Dirty LRU List is Limited When It Reaches 40% of the Whole Cache, DBWn Will Refresh It

The Improvement of LRU “Both Time And Frequency”

Thanks~