Computers and Technology, 06.06.2021 22:10 markleal9484

Consider a processor with a direct-mapped write-through cache with 8 blocks each with a double word. Assume that the memory address is 48 bits wide and the memory is byte-addressable. (a) Show the layout of the cache, including the data, valid and tag bits, and any logic required to determine hit/miss and select the appropriate data item when reading from the cache. Also, indicate which bits in the 48-bit memory address are used as block offset (if applicable), byte offset, tag, and index, and show where each of these groups of bits are used in the cache architecture. Make sure to label the width of all fields and signals.
(b) What is the total amount of memory (in bytes) required to build this cache (including both data and other necessary bits)? (show calculations)
(c) What is the block offset (if applicable), byte offset, tag, and index for byte address 56? Give your answer in decimal notation.
(d) What is the block offset (if applicable), byte offset, tag, and index for double-word address 56? Give your answer in decimal notation. Note: A double address refers to the memory address without the byte offset (the most significant 45 bits of the address)
(e) Given the series of double-word addresses: 2, 5, 10, 7, 1, 5, 2, 9, 7, Complete the table below. Assume the cache is initially empty. Label each reference as a hit or a miss and show the final contents of the cache in the diagram you drew under (a). Address Index Tag Hit/Miss 2 5 10 7 1 5 2 9 7 (f) The following miss rate measurements have been made. Instruction miss rate is 6%; data miss rate is 8%. Assume that one-half of the instructions contain a data reference and that the cache miss penalty in no. of clock cycles is (6 + (Block size in double-words)). Calculate the average miss penalty per instruction.

Answers: 1

Show answers

Another question on Computers and Technology

Computers and Technology, 22.06.2019 19:20

Consider the following code snippet: #ifndef cashregister_h#define cashregister_hconst double max_balance = 6000000.0; class cashregister{public: cashregister(); cashregister(double new_balance); void set_balance(double new_balance); double get_balance() const; private: double balance[12]; }; double get_monthly_balance(cashregister bk, int month); #endifwhich of the following is correct? a)the header file is correct as given.b)the definition of max_balance should be removed since header files should not contain constants.c)the definition of cashregister should be removed since header files should not contain class definitions.d)the body of the get_monthly_balance function should be added to the header file.

Answers: 1

Answer

Computers and Technology, 23.06.2019 12:00

If you're using an existing powerpoint presentation that will receive new slides based on a word outline, select the a. slide that will appear after the new slides. b. first slide in the presentation. c. slide that will appear before the new slides. d. last slide in the presentation.

Answers: 2

Answer

Computers and Technology, 24.06.2019 10:00

Which feature of a blog to restore and retrieve older post

Answers: 3

Answer

Computers and Technology, 24.06.2019 15:30

The idea that, for each pair of devices v and w, there’s a strict dichotomy between being “in range” or “out of range” is a simplified abstraction. more accurately, there’s a power decay function f (·) that specifies, for a pair of devices at distance δ, the signal strength f(δ) that they’ll be able to achieve on their wireless connection. (we’ll assume that f (δ) decreases with increasing δ.) we might want to build this into our notion of back-up sets as follows: among the k devices in the back-up set of v, there should be at least one that can be reached with very high signal strength, at least one other that can be reached with moderately high signal strength, and so forth. more concretely, we have values p1 ≥ p2 ≥ . . ≥ pk, so that if the back-up set for v consists of devices at distances d1≤d2≤≤dk,thenweshouldhavef(dj)≥pj foreachj. give an algorithm that determines whether it is possible to choose a back-up set for each device subject to this more detailed condition, still requiring that no device should appear in the back-up set of more than b other devices. again, the algorithm should output the back-up sets themselves, provided they can be found.\

Answers: 2

Answer

You know the right answer?

Consider a processor with a direct-mapped write-through cache with 8 blocks each with a double word....

Questions