Computers and Technology, 11.04.2020 03:23 mralxrdk12

A new company has proposed a number of different cache layouts for their system and you’ve
been asked to come in and calculate the overhead for each of the different caches. Their
system uses a cache with 512 B of data storage capable of addressing 4 GB of
byte-addressable memory. Stores will be handled by write-back and allocate-on-write policies.
Please be sure to show the work for your calculations.

A. The first design is a fully associative cache with a block size of 32 bytes, how many bytes of
overhead would the cache keep in total (including any necessary tag bits?, valid bits,? dirty
bits?, or LRU bits?)? [5]

B. Their next design utilizes a direct mapped cache with 16 different cache lines. How many
bytes of overhead would the cache keep in total (including any necessary tag bits?, valid
bits,? dirty bits?, or LRU bits?)? [5]

C. Finally, they’ve suggested a 2-way set associative cache with 4 different sets. How many
bytes of overhead would the cache keep in total (including any necessary tag bits?, valid
bits,? dirty bits?, or LRU bits?)? [5]

Answers: 1

Show answers

Other questions on the subject: Computers and Technology

Computers and Technology, 21.06.2019 21:30, Devan6264

You need to write some code that responds to a text change in a jtextfield. how can you do that? create a class that implements the interface actionlistener and override the method textfieldchanged create a class that extends the superclass actionlistener and override the method actionperformed create a class that implements the interface actionlistener and override the method actionperformed create a class that extends the superclass actionlistener and override the method textfieldchanged

Answers: 2

continue

Computers and Technology, 22.06.2019 20:00, Jana1517

What is the worst-case complexity of the maxrepeats function? assume that the longest string in the names array is at most 25 characters wide (i. e., string comparison can be treated as o( class namecounter { private: int* counts; int nc; string* names; int nn; public: namecounter (int ncounts, int nnames); int maxrepeats() const; }; int namecounter: : maxrepeats () { int maxcount = 0; for (int i = 0; i < nc; ++i) { int count = 1; for (int j = i+1; j < nc; ++j) { if (names[i] == names[j]) ++count; } maxcount = max(count, maxcount); } return maxcount; }

Answers: 3

continue

Computers and Technology, 23.06.2019 19:30, 123iamthe1

You can apply several different worksheet themes from which tab?

Answers: 1

continue

Computers and Technology, 24.06.2019 02:00, akatherine1738

What is a loop? a. a collection of function definitions at the top of a program b. a line of code that defines a variable and assigns it a value c. a program that opens the turtle graphics window d. a block of code that repeats a specific number of times

Answers: 1

continue

You know the right answer?

A new company has proposed a number of different cache layouts for their system and you’ve
be...