Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > An access sequence of cache block addresses i...
Start Learning for Free
An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by . What is the miss ratio if the access sequence is passed through a cache of associativity A ≥ Kexercising least-recently-used replacement policy?
- a)n/N
- b)1/N
- c)1/A
- d)k/n
Correct answer is option 'A'. Can you explain this answer?
Verified Answer
An access sequence of cache block addresses is of length N and contain...
There are N accesses to cache.
Out of these n are unique block addresses.
Now, we need to find the number of misses. (min. n misses are guaranteed whatever be the access sequence due to n unique block addresses)
We are given that between two consecutive accesses to the same block, there can be only k unique block addresses. So,
for a block to get replaced we can assume that all the next k block addresses goes to the same set (given cache is setassociative)
which will be the worst case scenario (they may also go to a different set but then there is lesser chance of a
replacement). Now, if associativity size is >= k, and if we use LRU (Least Recently Used) replacement policy, we can guarantee that these k accesses won't throw out our previously accessed cache entry (for that we need at least k
accesses). So, this means we are at the best-cache scenario for cache replacement -- out of N accesses we miss only n (which are unique and can not be helped from getting missed and there is no block replacement in cache). So, miss ratio is n/N.
PS: In question it is given "bounded above by k", which should mean k unique block accesses as k is an integer, but to ensure no replacement this must be 'k-1'. Guess, a mistake in question.
Out of these n are unique block addresses.
Now, we need to find the number of misses. (min. n misses are guaranteed whatever be the access sequence due to n unique block addresses)
We are given that between two consecutive accesses to the same block, there can be only k unique block addresses. So,
for a block to get replaced we can assume that all the next k block addresses goes to the same set (given cache is setassociative)
which will be the worst case scenario (they may also go to a different set but then there is lesser chance of a
replacement). Now, if associativity size is >= k, and if we use LRU (Least Recently Used) replacement policy, we can guarantee that these k accesses won't throw out our previously accessed cache entry (for that we need at least k
accesses). So, this means we are at the best-cache scenario for cache replacement -- out of N accesses we miss only n (which are unique and can not be helped from getting missed and there is no block replacement in cache). So, miss ratio is n/N.
PS: In question it is given "bounded above by k", which should mean k unique block accesses as k is an integer, but to ensure no replacement this must be 'k-1'. Guess, a mistake in question.
This question is part of UPSC exam. View all Computer Science Engineering (CSE) courses
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Top Courses for Computer Science Engineering (CSE)View all
An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by . What is the miss ratio if the access sequence is passed through a cache of associativity A ≥ Kexercising least-recently-used replacement policy?a)n/Nb)1/Nc)1/Ad)k/nCorrect answer is option 'A'. Can you explain this answer?
Question Description
An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by . What is the miss ratio if the access sequence is passed through a cache of associativity A ≥ Kexercising least-recently-used replacement policy?a)n/Nb)1/Nc)1/Ad)k/nCorrect answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by . What is the miss ratio if the access sequence is passed through a cache of associativity A ≥ Kexercising least-recently-used replacement policy?a)n/Nb)1/Nc)1/Ad)k/nCorrect answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by . What is the miss ratio if the access sequence is passed through a cache of associativity A ≥ Kexercising least-recently-used replacement policy?a)n/Nb)1/Nc)1/Ad)k/nCorrect answer is option 'A'. Can you explain this answer?.
An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by . What is the miss ratio if the access sequence is passed through a cache of associativity A ≥ Kexercising least-recently-used replacement policy?a)n/Nb)1/Nc)1/Ad)k/nCorrect answer is option 'A'. Can you explain this answer? for Computer Science Engineering (CSE) 2024 is part of Computer Science Engineering (CSE) preparation. The Question and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus. Information about An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by . What is the miss ratio if the access sequence is passed through a cache of associativity A ≥ Kexercising least-recently-used replacement policy?a)n/Nb)1/Nc)1/Ad)k/nCorrect answer is option 'A'. Can you explain this answer? covers all topics & solutions for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, meanings, examples, exercises and tests below for An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by . What is the miss ratio if the access sequence is passed through a cache of associativity A ≥ Kexercising least-recently-used replacement policy?a)n/Nb)1/Nc)1/Ad)k/nCorrect answer is option 'A'. Can you explain this answer?.
Solutions for An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by . What is the miss ratio if the access sequence is passed through a cache of associativity A ≥ Kexercising least-recently-used replacement policy?a)n/Nb)1/Nc)1/Ad)k/nCorrect answer is option 'A'. Can you explain this answer? in English & in Hindi are available as part of our courses for Computer Science Engineering (CSE).
Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free.
Here you can find the meaning of An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by . What is the miss ratio if the access sequence is passed through a cache of associativity A ≥ Kexercising least-recently-used replacement policy?a)n/Nb)1/Nc)1/Ad)k/nCorrect answer is option 'A'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by . What is the miss ratio if the access sequence is passed through a cache of associativity A ≥ Kexercising least-recently-used replacement policy?a)n/Nb)1/Nc)1/Ad)k/nCorrect answer is option 'A'. Can you explain this answer?, a detailed solution for An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by . What is the miss ratio if the access sequence is passed through a cache of associativity A ≥ Kexercising least-recently-used replacement policy?a)n/Nb)1/Nc)1/Ad)k/nCorrect answer is option 'A'. Can you explain this answer? has been provided alongside types of An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by . What is the miss ratio if the access sequence is passed through a cache of associativity A ≥ Kexercising least-recently-used replacement policy?a)n/Nb)1/Nc)1/Ad)k/nCorrect answer is option 'A'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice An access sequence of cache block addresses is of length N and contains n unique block addresses. The number of unique block addresses between two consecutive accesses to the same block address is bounded above by . What is the miss ratio if the access sequence is passed through a cache of associativity A ≥ Kexercising least-recently-used replacement policy?a)n/Nb)1/Nc)1/Ad)k/nCorrect answer is option 'A'. Can you explain this answer? tests, examples and also practice Computer Science Engineering (CSE) tests.
|
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Suggested Free Tests
Signup for Free!
Signup to see your scores go up within 7 days! Learn & Practice with 1000+ FREE Notes, Videos & Tests.
|
© EduRev
|
Education Revolution
|
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup