Computer Organization and Architecture - Practice Set 3 Solution

COMPUTER ORGANIZATION AND ARCHITECTURE (Instruction Pipelining, Cache & Main memory, Secondary Storage) PRACTICE SET 3 - SOLUTI...

(Instruction Pipelining, Cache & Main memory, Secondary Storage)


1. More than one word is put in one cache block to
(a) Exploit temporal locality references in a program
(b) Exploit spatial locality references in a program
(c) Reduce miss penalty
(d) All of these

Solution: Option (b)

2. A pipeline P is found to provide a speedup of 6.16 when operating at 100 MHz and an efficiency of 88 percent. How many stages does P have?

Solution: From 7.21 To 6.79

Explanation: Clock Time=10ns, 88100[p×1010]=6.16, p=7

3. How big is a four way set associative cache memory with a block size of 64 Bytes and containing 1024 sets?

Solution: From 263.68 To 248.32

1024 × 4 × 64 Bytes = 218 = 256 Kbytes

4. A five stage pipeline has a clock cycle time of 5ns. If the non-pipeline clock is also of the same duration than what is the speed up for 75% of pipeline efficiency?

Solution: From 3.863 To 3.638
Non-pipeline: 5 × 5 = 25
Pipeline – 5 For 100%−255=5 For 75%−75100×5=3.75

5. A tiny bootstrap loader program is situated in
(a) Hard disk (b) ROM
(c) BIOS (d) None of these
Solution: Option (b)

6. If a cache access requires one clock cycle and handling cache misses stalls the processor for an additional five cycles, which of the following cache hit rates comes closest to achieving an average memory access of 2 cycles (in %)?

Solution: From 82.4 To 77.6

2 cycle average access = (1 cycle for cache) + (1 – hit rate) (5 cycles stall) ⇒ hit rate = 80%

7. Cache and word addressable main memory system has the following specification
Cache block size = 16 words
Set size = 2 blocks
Number of sets = 128
Number of bits in a word = 32 bits
Cache access time (Tc) = 20ns
Memory access (Tm) = 120ns
Hit (H) = 0.8
Size of main memory address = 21bits

What is the total cache size needed?
(a) (16k + 140) bytes (b) (16k + 320) bytes
(c) (256k + 180) bytes (d) (60k + 300) bytes
Solution: Option (b)
Total size of cache=128×2×16×328 + 128×2×108
128 set, each set 2 block 128 set, each set 2 block
each block 16 word, each block 16 word,
each word 32 bit each word 32 bit

8. Consider a machine with 10ns clock and it takes 4 clock cycle per ALU instruction, 5 clock cycle per branch instruction, 6 clock cycle memory instruction. There exists 40% ALU instruction, 20% branch instruction and 40% memory instruction.

What is throughput of pipeline system if overhead is 2ns?
(a) 83MIPS (b) 84MIPS
(c) 85MIPS (d) 86MIPS

Solution: Option (a)
Average access time for non-pipeline system [4×.40+5×.20+.40×6]×10ns=[1.6+1+2.4]×10ns=5×10ns=50ns
For pipeline system in every clock cycle one instruction will get executed and overhead of 2 nano sec.
So, average time = (10 + 2) ns = 12 ns,
throughput of system 112ns=83 MIPS

9. A 5 stage pipeline has the stages IF, ID, OF, PO, WB (Assume that there are no separate data and instruction caches). For the program below, what is/are the hazard(s) possible? MOV R1,A; R1←μ[A]
MOV R2,A; R2←μ[B] ADD R1,R2; R1←R1+R2 MOV X,R1; μ[x]←R1
(a) Data Hazard (b) Structural Hazard
(c) Control Hazard (d) Both (a) & (b)

Solution: Option (b)

10. An instruction pipeline consists of 4 stages fetch(F), decode(D), execute(E) and write(W). Different instruction spent different number of clock cycles.
The value in the box represents clock cycles taken by instructions in different states.
At what clock cycle, instruction I3, will complete its decoding?
(a) 6th clock cycle (b) 7th clock cycle
(c) 12th clock cycle (d) 13th clock cycle
Solution: Option (b)

At 7th clock cycle I3 will complete its decoding.



addressing modes types,1,advance-java,2,aktu entrance exam,1,aktu exam schedule,1,ASP,1,bare machine,1,base register and limit register,1,C Programming,12,C Plus Plus,1,C Programming,5,C Programming Questions,1,C programming study material for gate exam,7,Cache Memory,1,CBNST Program,1,Childcare,1,CJ,1,Cloud Computing,1,CN,3,Computer Architecture,2,Computer architecture based questions for gate exam,11,Computer Network,8,Computer Network Study Material,2,Computer network study material for gate,1,Computer Networks,8,Computer networks GATE Questions,2,Computer Science Study Material for Gate,14,computer science study material for gate exam,28,conditional statements in c,1,contiguous memory allocation,2,Core Java,3,cyber crime report,1,Cyber crime status,1,cybercrime and security,1,cybercrime examples,1,Data Structure,2,Data Structure Questions,1,Data Transmission Architecture,1,Data Transmission in wsn,1,database normalization,1,DBMS,6,dbms question paper,1,DE,1,Digital Electronics,1,DS,4,Dynamic memory allocation in c,1,Electroencephalogram,1,file management in operating system notes,1,Gate 2017,3,Gate 2017 Admit card,1,gate cse study material,1,gate practice set,7,gate study material for computer science,12,Gate study material for computer science 2017,1,General,3,HCL Aptitude Test,1,HR Interview Questions,1,HTML,4,Important Date of Gate 2017 Exam,1,Information Security Policy,1,internal and external fragmentation,1,JDBC,2,JS,1,lagrange's interpolation formula,1,lagrange's interpolation formula examples,1,memory fragmentation,1,memory management,1,memory management questions and answer in os,1,Motivational,4,NCER,1,Numerical Techniques Lab,1,OOT,1,Operating System,10,Operating System Gate Questions,1,Operating System Objective Questions,4,Operating System Questions Bank,1,Operating system questions for gate,1,Operating System Study material,2,operating system study material for gate exam,13,Operating system tutorial,2,page swapping,1,paged memory allocation,1,paged memory allocation in operating system,1,Pointer in C,4,Process based question for gate,1,Regression testing,1,relocation in memory management,1,relocation registe,1,relocation register,1,resident monitor,1,resident monitor in operating system,1,routing table,1,Software Engineering,10,Software Engineering baes study material for gate,1,Software Quality Assurance,3,software verification methods,1,Stack,1,Structure in C,1,Study Material for gate Computer Science,7,swapping in memory management,1,swapping in operating system,1,TCS Code Vita,1,TCS Interview Questions,1,Technical Interview,1,Technical Questions from DBMS,1,Thrashing in Operating System,1,Threads concept in operating system,1,Tips to Learn Coding,1,Types of operating system,1,UML,1,Virtualization,1,What is process control block ?,1,what is software testing?,1,Wireless Sensor Network,3,worst fit algorithm for memory allocation,1,XML,2,
Computer Science Junction: Computer Organization and Architecture - Practice Set 3 Solution
Computer Organization and Architecture - Practice Set 3 Solution
Computer Science Junction
Loaded All Posts Not found any posts VIEW ALL Readmore Reply Cancel reply Delete By Home PAGES POSTS View All RECOMMENDED FOR YOU LABEL ARCHIVE SEARCH ALL POSTS Not found any post match with your request Back Home Sunday Monday Tuesday Wednesday Thursday Friday Saturday Sun Mon Tue Wed Thu Fri Sat January February March April May June July August September October November December Jan Feb Mar Apr May Jun Jul Aug Sep Oct Nov Dec just now 1 minute ago $$1$$ minutes ago 1 hour ago $$1$$ hours ago Yesterday $$1$$ days ago $$1$$ weeks ago more than 5 weeks ago Followers Follow THIS PREMIUM CONTENT IS LOCKED STEP 1: Share. STEP 2: Click the link you shared to unlock Copy All Code Select All Code All codes were copied to your clipboard Can not copy the codes / texts, please press [CTRL]+[C] (or CMD+C with Mac) to copy