5.1-5.3
Computer Science 370 with Gendreau at University of Wisconsin - LaCrosse
About this deck
By: Keagan Adams
Created: 2010-11-24
Size: 22 flashcards
Views: 8
Created: 2010-11-24
Size: 22 flashcards
Views: 8
About StudyBlue
STUDYBLUE makes things that make you better at school.
Things like online flashcards with photos and audio.
Things like personalized quizzes and friendly reminders about when (and what) to study next.
Think of it as a digital backpack™: access to all of your study materials online and on your phone.
STUDYBLUE exists to make studying efficient and effective for every student, for free. Join us.
“I have used this website for three exams, and I see a huge difference in my test results.”
Naj
Naj
Sign up (free) to study this.
temporal Locality
the principle stating that if a data location is referenced then it will tend to be referenced again
spatial locality
the locality principle stating that if a data location is referenced, data locations with nearby addresses will tend to be referenced soon
memory heirarchy
structure that uses multiple levels of memories. distance from processor, size and access times increase
block
the minimum unit of info that can be either present or not present in a cache (Line)
hit rate
the fraction of memory accesses found in a level of the memory hierarchy
miss rate
the fraction of memory accesses not found in a level of the memory heirarchy
hit time
the time required to access a level of the memory heirarchy including the time needed to determine whether the access is a hit or miss
miss penalty
the time required to fetch a block into a level of the memory hierarchy from the lower level, transmit it from one level to the other, insert it in the level that experienced the miss, and then pass the block to the requestor
direct mapped cache
a cache structure in which each memory location is mapped to exactly one location in the cache
tag
a field in a table used for a memory hierarchy that contains the address info required to identify whether the associated block in teh hierarchy corresponds to a requested word
valid bit
a field in the tables of memory hierarchy that indicates the associated block in the hierarchy contains valid data
cache miss
a request for data that cannot be filled because the data is not present in the cache
write through
a scheme in which writes always update both cache and next lower level of the mem. hier. ensuring that data is always consistent between the two
write buffer
a queue that holds data while the data is waiting to be written to memory
write back
a scheme that handles writes by updating values only to block in the cache then writing the modified block to the lower level of the hierarchy when the block is replaced
split cache
a scheme in which a level of the memory hierarchy is composed of two independent caches that operate in parallel withe each other with one handling instructions and one handling data
fully associative cache
cache structure in which a block can be placed in any location in the cache
set associative cache
a cache that has a fixed number of locations where each block can be placed
least recently used
LRU; a replacement scheme in which the block replaced is the one that has be unused for the longest time
multilevel cache
a memory hierarchy with multiple levels of caches, rather than just a cache and main mem.
global miss rate
the fraction of references that miss in all levels of multilevel cache
local miss rate
the fraction of references to one level of a cache that miss
About this deck
By: Keagan Adams
Created: 2010-11-24
Size: 22 flashcards
Views: 8
Created: 2010-11-24
Size: 22 flashcards
Views: 8
About StudyBlue
STUDYBLUE makes things that make you better at school.
Things like online flashcards with photos and audio.
Things like personalized quizzes and friendly reminders about when (and what) to study next.
Think of it as a digital backpack™: access to all of your study materials online and on your phone.
STUDYBLUE exists to make studying efficient and effective for every student, for free. Join us.
“I have used this website for three exams, and I see a huge difference in my test results.”
Naj
Naj