Computer Science Engineering (CSE) Exam > Computer Science Engineering (CSE) Questions > Consider a fully-associative data cache with ...
Start Learning for Free
Consider a fully-associative data cache with 32 blocks of 64 bytes each. The cache uses LRU (Least Recently Used) replacement. Consider the following C code to sum together all of the elements of a 64 by 64 two-dimensional array of 64-bit double-precision floating point numbers.
double sum (double A [64] [64] ) {
int i, j ;
double sum = 0 ;
for (i = 0 ; i < 64; i++)
for (j = 0; j < 64; j++)
sum += A [i] [j] ;
return sum ;
}
int i, j ;
double sum = 0 ;
for (i = 0 ; i < 64; i++)
for (j = 0; j < 64; j++)
sum += A [i] [j] ;
return sum ;
}
Assume all blocks in the cache are initially invalid. How many cache misses will result from the code?
- a)256
- b)512
- c)128
- d)1024
Correct answer is option 'B'. Can you explain this answer?
| FREE This question is part of | Download PDF Attempt this Test |
Most Upvoted Answer
Consider a fully-associative data cache with 32 blocks of 64 bytes eac...
Least Recently Used (LRU) page replacement algorithm:
LRU policy follows the concept of locality of reference as the base for its page replacement decisions. LRU policy says that pages that have not been used for the longest period of time will probably not be used for a long time.
LRU policy follows the concept of locality of reference as the base for its page replacement decisions. LRU policy says that pages that have not been used for the longest period of time will probably not be used for a long time.
The given data,
Array size= 64 x64 x size of each element.
Array size=64 x64x 64-bit
Array size= 64 x64 x8 bytes
The data cache with 32 blocks of 64 bytes each.
Data cache= 64 bytes
Initially, the data cache loads blocks when i=0 and j=0 and one cache miss after that till i=0 and j=8 there is no cache misses because at one-time cache loads the 64 bytes of data.
So number for 64 bytes 1 miss then,
64 x64 x8 bytes=?
Number of miss= 64 x64 x8 bytes / 64
The number of miss= 512.
Hence the correct answer is 512.
Array size= 64 x64 x size of each element.
Array size=64 x64x 64-bit
Array size= 64 x64 x8 bytes
The data cache with 32 blocks of 64 bytes each.
Data cache= 64 bytes
Initially, the data cache loads blocks when i=0 and j=0 and one cache miss after that till i=0 and j=8 there is no cache misses because at one-time cache loads the 64 bytes of data.
So number for 64 bytes 1 miss then,
64 x64 x8 bytes=?
Number of miss= 64 x64 x8 bytes / 64
The number of miss= 512.
Hence the correct answer is 512.
Free Test
FREE
| Start Free Test |
Community Answer
Consider a fully-associative data cache with 32 blocks of 64 bytes eac...
Least Recently Used (LRU) page replacement algorithm:
LRU policy follows the concept of locality of reference as the base for its page replacement decisions. LRU policy says that pages that have not been used for the longest period of time will probably not be used for a long time.
LRU policy follows the concept of locality of reference as the base for its page replacement decisions. LRU policy says that pages that have not been used for the longest period of time will probably not be used for a long time.
The given data,
Array size= 64 x64 x size of each element.
Array size=64 x64x 64-bit
Array size= 64 x64 x8 bytes
The data cache with 32 blocks of 64 bytes each.
Data cache= 64 bytes
Initially, the data cache loads blocks when i=0 and j=0 and one cache miss after that till i=0 and j=8 there is no cache misses because at one-time cache loads the 64 bytes of data.
So number for 64 bytes 1 miss then,
64 x64 x8 bytes=?
Number of miss= 64 x64 x8 bytes / 64
The number of miss= 512.
Hence the correct answer is 512.
Array size= 64 x64 x size of each element.
Array size=64 x64x 64-bit
Array size= 64 x64 x8 bytes
The data cache with 32 blocks of 64 bytes each.
Data cache= 64 bytes
Initially, the data cache loads blocks when i=0 and j=0 and one cache miss after that till i=0 and j=8 there is no cache misses because at one-time cache loads the 64 bytes of data.
So number for 64 bytes 1 miss then,
64 x64 x8 bytes=?
Number of miss= 64 x64 x8 bytes / 64
The number of miss= 512.
Hence the correct answer is 512.
Attention Computer Science Engineering (CSE) Students!
To make sure you are not studying endlessly, EduRev has designed Computer Science Engineering (CSE) study material, with Structured Courses, Videos, & Test Series. Plus get personalized analysis, doubt solving and improvement plans to achieve a great score in Computer Science Engineering (CSE).
|
Explore Courses for Computer Science Engineering (CSE) exam
|
|
Similar Computer Science Engineering (CSE) Doubts
Top Courses for Computer Science Engineering (CSE)View all
Consider a fully-associative data cache with 32 blocks of 64 bytes each. The cache uses LRU (Least Recently Used) replacement. Consider the following C code to sum together all of the elements of a 64 by 64 two-dimensional array of 64-bit double-precision floating point numbers.double sum (double A [64] [64] ) {int i, j ;double sum = 0 ;for (i = 0 ; i < 64; i++)for (j = 0; j < 64; j++)sum += A [i] [j] ;return sum ;}Assume all blocks in the cache are initially invalid. How many cache misses will result from the code?a)256b)512c)128d)1024Correct answer is option 'B'. Can you explain this answer?
Question Description
Consider a fully-associative data cache with 32 blocks of 64 bytes each. The cache uses LRU (Least Recently Used) replacement. Consider the following C code to sum together all of the elements of a 64 by 64 two-dimensional array of 64-bit double-precision floating point numbers.double sum (double A [64] [64] ) {int i, j ;double sum = 0 ;for (i = 0 ; i < 64; i++)for (j = 0; j < 64; j++)sum += A [i] [j] ;return sum ;}Assume all blocks in the cache are initially invalid. How many cache misses will result from the code?a)256b)512c)128d)1024Correct answer is option 'B'. 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 Consider a fully-associative data cache with 32 blocks of 64 bytes each. The cache uses LRU (Least Recently Used) replacement. Consider the following C code to sum together all of the elements of a 64 by 64 two-dimensional array of 64-bit double-precision floating point numbers.double sum (double A [64] [64] ) {int i, j ;double sum = 0 ;for (i = 0 ; i < 64; i++)for (j = 0; j < 64; j++)sum += A [i] [j] ;return sum ;}Assume all blocks in the cache are initially invalid. How many cache misses will result from the code?a)256b)512c)128d)1024Correct answer is option 'B'. 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 Consider a fully-associative data cache with 32 blocks of 64 bytes each. The cache uses LRU (Least Recently Used) replacement. Consider the following C code to sum together all of the elements of a 64 by 64 two-dimensional array of 64-bit double-precision floating point numbers.double sum (double A [64] [64] ) {int i, j ;double sum = 0 ;for (i = 0 ; i < 64; i++)for (j = 0; j < 64; j++)sum += A [i] [j] ;return sum ;}Assume all blocks in the cache are initially invalid. How many cache misses will result from the code?a)256b)512c)128d)1024Correct answer is option 'B'. Can you explain this answer?.
Consider a fully-associative data cache with 32 blocks of 64 bytes each. The cache uses LRU (Least Recently Used) replacement. Consider the following C code to sum together all of the elements of a 64 by 64 two-dimensional array of 64-bit double-precision floating point numbers.double sum (double A [64] [64] ) {int i, j ;double sum = 0 ;for (i = 0 ; i < 64; i++)for (j = 0; j < 64; j++)sum += A [i] [j] ;return sum ;}Assume all blocks in the cache are initially invalid. How many cache misses will result from the code?a)256b)512c)128d)1024Correct answer is option 'B'. 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 Consider a fully-associative data cache with 32 blocks of 64 bytes each. The cache uses LRU (Least Recently Used) replacement. Consider the following C code to sum together all of the elements of a 64 by 64 two-dimensional array of 64-bit double-precision floating point numbers.double sum (double A [64] [64] ) {int i, j ;double sum = 0 ;for (i = 0 ; i < 64; i++)for (j = 0; j < 64; j++)sum += A [i] [j] ;return sum ;}Assume all blocks in the cache are initially invalid. How many cache misses will result from the code?a)256b)512c)128d)1024Correct answer is option 'B'. 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 Consider a fully-associative data cache with 32 blocks of 64 bytes each. The cache uses LRU (Least Recently Used) replacement. Consider the following C code to sum together all of the elements of a 64 by 64 two-dimensional array of 64-bit double-precision floating point numbers.double sum (double A [64] [64] ) {int i, j ;double sum = 0 ;for (i = 0 ; i < 64; i++)for (j = 0; j < 64; j++)sum += A [i] [j] ;return sum ;}Assume all blocks in the cache are initially invalid. How many cache misses will result from the code?a)256b)512c)128d)1024Correct answer is option 'B'. Can you explain this answer?.
Solutions for Consider a fully-associative data cache with 32 blocks of 64 bytes each. The cache uses LRU (Least Recently Used) replacement. Consider the following C code to sum together all of the elements of a 64 by 64 two-dimensional array of 64-bit double-precision floating point numbers.double sum (double A [64] [64] ) {int i, j ;double sum = 0 ;for (i = 0 ; i < 64; i++)for (j = 0; j < 64; j++)sum += A [i] [j] ;return sum ;}Assume all blocks in the cache are initially invalid. How many cache misses will result from the code?a)256b)512c)128d)1024Correct answer is option 'B'. 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 Consider a fully-associative data cache with 32 blocks of 64 bytes each. The cache uses LRU (Least Recently Used) replacement. Consider the following C code to sum together all of the elements of a 64 by 64 two-dimensional array of 64-bit double-precision floating point numbers.double sum (double A [64] [64] ) {int i, j ;double sum = 0 ;for (i = 0 ; i < 64; i++)for (j = 0; j < 64; j++)sum += A [i] [j] ;return sum ;}Assume all blocks in the cache are initially invalid. How many cache misses will result from the code?a)256b)512c)128d)1024Correct answer is option 'B'. Can you explain this answer? defined & explained in the simplest way possible. Besides giving the explanation of
Consider a fully-associative data cache with 32 blocks of 64 bytes each. The cache uses LRU (Least Recently Used) replacement. Consider the following C code to sum together all of the elements of a 64 by 64 two-dimensional array of 64-bit double-precision floating point numbers.double sum (double A [64] [64] ) {int i, j ;double sum = 0 ;for (i = 0 ; i < 64; i++)for (j = 0; j < 64; j++)sum += A [i] [j] ;return sum ;}Assume all blocks in the cache are initially invalid. How many cache misses will result from the code?a)256b)512c)128d)1024Correct answer is option 'B'. Can you explain this answer?, a detailed solution for Consider a fully-associative data cache with 32 blocks of 64 bytes each. The cache uses LRU (Least Recently Used) replacement. Consider the following C code to sum together all of the elements of a 64 by 64 two-dimensional array of 64-bit double-precision floating point numbers.double sum (double A [64] [64] ) {int i, j ;double sum = 0 ;for (i = 0 ; i < 64; i++)for (j = 0; j < 64; j++)sum += A [i] [j] ;return sum ;}Assume all blocks in the cache are initially invalid. How many cache misses will result from the code?a)256b)512c)128d)1024Correct answer is option 'B'. Can you explain this answer? has been provided alongside types of Consider a fully-associative data cache with 32 blocks of 64 bytes each. The cache uses LRU (Least Recently Used) replacement. Consider the following C code to sum together all of the elements of a 64 by 64 two-dimensional array of 64-bit double-precision floating point numbers.double sum (double A [64] [64] ) {int i, j ;double sum = 0 ;for (i = 0 ; i < 64; i++)for (j = 0; j < 64; j++)sum += A [i] [j] ;return sum ;}Assume all blocks in the cache are initially invalid. How many cache misses will result from the code?a)256b)512c)128d)1024Correct answer is option 'B'. Can you explain this answer? theory, EduRev gives you an
ample number of questions to practice Consider a fully-associative data cache with 32 blocks of 64 bytes each. The cache uses LRU (Least Recently Used) replacement. Consider the following C code to sum together all of the elements of a 64 by 64 two-dimensional array of 64-bit double-precision floating point numbers.double sum (double A [64] [64] ) {int i, j ;double sum = 0 ;for (i = 0 ; i < 64; i++)for (j = 0; j < 64; j++)sum += A [i] [j] ;return sum ;}Assume all blocks in the cache are initially invalid. How many cache misses will result from the code?a)256b)512c)128d)1024Correct answer is option 'B'. 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
|
Follow Us
|
Signup to see your scores
go up within 7 days!
Access 1000+ FREE Docs, Videos and Tests
Takes less than 10 seconds to signup