SampleTest II

SampleTest II - b(10 Suppose the cache in a is used with a...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
ECE 3055 Computer Architecture and Operating Systems Sample Exam II 1. Datapath. The following table shows four instruction classes and their corresponding distribu- tion and latency in each stage of operation (X: not needed.) Ins. Class Distribution IF ID EX MEM WB Load 25% 2ns 2ns 1ns Store 10% 2ns 1ns 2ns 2ns X Arithmetic 45% 1.5ns X 1ns Branch 20% 2ns X X a. (10) Considering a single-cycle datapath implementation, what is the throughput ( in “instructions per second”) for this workload? b. (10) Now, considering a multi-cycle datapath implementation, what is the throughput for this workload? Is the multi-cycle datapath faster than the single-cycle datapath in this case? c. (10) Finally, suppose the machine is pipelined with 5 stages. Now, what is the throughput? (Assume there are no pipeline stalls, and no pipeline overhead.) 2. Caches a. (10) Consider 1MB, 2-way set associative cache with write-back, and write-allocate and 8 word blocks. How many sets does this cache have?
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: b. (10) Suppose the cache in a. is used with a 32-bit byte addressed architecture. How many bits would the tag be? c. (10) Suppose you reduced the block size to two words. Keeping the size and associativity constant, how would the cache change? d. (10) Suppose you reduced the block size to two words. What impacts on the memory system and performance would you expect to see? 3. Virtual Memory a. (15) Suppose you have a physical memory with 4 page frames. Give the virtual page in each page frame and page fault rate after the last access assuming LRU replacement is used. The Page Number Trace is T = {1,2,4,9,3,2,9,4,1,2,9,3,9} b. (15) Consider a virtual memory system with 16 bit virtual addresses and 256B pages. Sup-pose the system has 16KB of physical memory. For a process requiring 64KB of virtual ad-dress space, compare page table memory requirements for ±at and hashed-inverted page table structures....
View Full Document

This note was uploaded on 07/30/2009 for the course ECE 3055 taught by Professor Staff during the Spring '08 term at Georgia Tech.

Page1 / 2

SampleTest II - b(10 Suppose the cache in a is used with a...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online