Go Back   Computer Forums > General Computing > Hardware
Join Computer forums Today

Thread Tools Search this Thread Display Modes
Old 08-30-2005, 04:04 AM   #1
Beta Member
Join Date: Aug 2005
Posts: 1
Question computer architecture problem


This is the scenario of my problem:

The instruction set for your architecture has 44-bit addresses, with
addressable item being a byte. You elect to design a four-way set
cache with each of the four lines in a set containing 64 bytes. Assume
you have 256 sets in the cache.

a) Show how the 44-bit physical address is treated in performing a

b) Consider the following sequence of addresses in hexadecimal.

0E1B01AA050 0E1B01AA073 0E1B2FE3057 0E1B4FFD85F 0E1B01AA04E

In your cache, what will the tags be in the set(s) that contain
these references at the end of the sequence? Assume some initial
state. Show the initial and final states.

c) The cache is four-way set associative. What is the fewest number
of bits required to keep track of which line to replace when
replacement is
LRU? Show your solution.

d) We can construct a cache with the identical number of data bytes
by doubling the line size and by reducing set associativity to 2. How
does this change the cost of the cache as measured in total bits?


hoping for help....
ailachristine is offline   Reply With Quote

Thread Tools Search this Thread
Search this Thread:

Advanced Search
Display Modes

Posting Rules
You may not post new threads
You may not post replies
You may not post attachments
You may not edit your posts

BB code is On
Smilies are On
[IMG] code is On
HTML code is Off
Trackbacks are On
Pingbacks are On
Refbacks are Off

All times are GMT -5. The time now is 02:03 PM.

Powered by vBulletin® Version 3.8.8 Beta 4
Copyright ©2000 - 2016, vBulletin Solutions, Inc.
Search Engine Friendly URLs by vBSEO 3.6.0