CDA 3103 University of Central Florida Computer Organization Questions solving an easy assignment straight forward questionssolving an easy assignment stra

CDA 3103 University of Central Florida Computer Organization Questions solving an easy assignment straight forward questionssolving an easy assignment straight forward questions CDA 3103 Computer Organization Homework #6
Part I: Problems
1. [10 points] Suppose a computer has 232 bytes of byte-addressable main memory and a cache
size of 215 bytes, and each cache block contains 32 bytes.
a)
How many blocks of main memory are there? (
)
b)
How many blocks of cache memory are there? (
c)
If this cache is direct-mapped, what is the format of a memory address as seen by the cache;
)
that is, the size of the tag field
field
d)
, the size of block
, and the size of the offset field
If this cache is fully associative, what is the format of a memory address as seen by the cache;
that is, the size of the tag field
field
e)
.
, and the size of the offset
.
If this cache is 4-way set associative, what is the format of a memory address as seen by the
cache; that is, the size of the tag field
field
, the size of set
, and the size of the offset field
.
2. [18 points] Suppose we have a memory and a direct-mapped cache with the following
characteristics.
⚫ Memory is byte addressable
⚫ Memory addresses are 16 bits
⚫ The cache has 8 blocks
⚫ Each cache block holds 16 bytes of data
a) [3 points] In the spaces below, indicate how the 16 address bits are allocated to the offset,
index, and tag parts of the address used to reference the cache: ________ offset bits ________
tag bits ________ index bits.
b) [12 points] Below is a sequence of four binary memory addresses in the order they are used
to reference memory. Assume that the cache is initially empty. For each reference, write down
the tag and index bits and circle either hit or miss to indicate whether that reference is a hit or
a miss.
Memory address
Tag
Index
Hit / Miss (circle)
0010 1101 1011 0011
Hit
Miss
0000 0110 1111 1100
Hit
Miss
0010 1101 1011 1000
Hit
Miss
1010 1010 1010 1011
Hit
Miss
c) [3 points] Suppose the cache access time is 15ns, main memory access time is 220ns, and the
cache hit rate is 95%. Assuming parallel (overlapped) access (CPU starts the data request in
parallel to both cache and to main memory at the same, so if a cache missing occurs, we don’t
have to add this cache search time to the memory access), what is the average access time for
the processor to access an item?
3. [26 points] Suppose you have a byte-addressable virtual address memory system
with 8 virtual pages of 64 bytes each, and 4 page frames. Assuming the following
page table, answer the questions below:
a) [3 points] How many bits are in a virtual address?
b) [3 points] How many bits are in a physical address?
c) [20 points] What physical address corresponds to the following virtual addresses
(if the address causes a page fault, simply indicate this is the case)?
1) 0x00
2) 0x44
3) 0xC2
4) 0x80
4. [6 points] Suppose we have 210 bytes of virtual memory and 28 bytes of physical main
memory. Suppose the page size is 24 bytes.
a) [2 points] How many pages are there in virtual memory?
b) [2 points] How many page frames are there in main memory?
c) [2 points] How many entries are in the page table for a process that uses all of
virtual memory?
Part II: Submission Requirements
The following requirements are for electronic submission via Canvas.
⚫ Your solutions must be in a single file with a file name yourname-assignment6.
⚫ Upload the file by following the link where you download the homework description on
Canvas.
⚫ If scanned from hand-written copies, then the writing must be legible, or loss of credits
may occur.
⚫ Only submissions via the link on Canvas where this description is downloaded are graded.
Submissions to any other locations on Canvas will be ignored.

Purchase answer to see full
attachment