One Stop GATE Forum: Pipeline Questions

Message

    1. Consider the case of a computer system employing both a cache and a paged 
virtual memory . One can analyze this system 
through identifying FIVE combinations of accesses. What are these combinations? 

Determine the probability and the access time in each case assuming 
the following information. Compute also the overall average access time. 

TLB address translation and search 25 ns 
Cache search time to determine whether address in cache 25 ns 
Cache access time 25 ns 
Main memory access time 250 ns 
Hard disk access time 100 ms 
TLB hit ratio 0.9 
Cache hit ratio 0.95 
Main memory hit ratio 0.8 

2. Consider the execution of 500 instructions on a ﬁve-stage pipeline machine. 
Compute the speed-up due to the use of pipelining given that the probability 
of an instruction being a branch is p = 0.3? What must be the value of p and 
the expected number of branch instructions such that a speed-up of at least 4 is 
possible? What must be the value of p such that a speed-up of at least 5 is possible? 
Assume that each stage takes one cycle to perform its task. 

Plz try to solve this questions ???  

Author	Message
manju Senior Member Joined: 20Feb2007 Online Status: Offline Posts: 221	Topic: Pipeline Questions Posted: 22Feb2007 at 2:25pm
	1. Consider the case of a computer system employing both a cache and a paged virtual memory . One can analyze this system through identifying FIVE combinations of accesses. What are these combinations? Determine the probability and the access time in each case assuming the following information. Compute also the overall average access time. TLB address translation and search 25 ns Cache search time to determine whether address in cache 25 ns Cache access time 25 ns Main memory access time 250 ns Hard disk access time 100 ms TLB hit ratio 0.9 Cache hit ratio 0.95 Main memory hit ratio 0.8 2. Consider the execution of 500 instructions on a ﬁve-stage pipeline machine. Compute the speed-up due to the use of pipelining given that the probability of an instruction being a branch is p = 0.3? What must be the value of p and the expected number of branch instructions such that a speed-up of at least 4 is possible? What must be the value of p such that a speed-up of at least 5 is possible? Assume that each stage takes one cycle to perform its task. Plz try to solve this questions ??? Post Resume: Click here to Upload your Resume & Apply for Jobs

	IP Logged

balu Senior Member Joined: 20Feb2007 Online Status: Offline Posts: 236	Posted: 22Feb2007 at 2:27pm
	I can proceed wth few steps as folows: In pipeline, 500 instructions, w/o any branch, they will take 500 clock cycles Now, 5000.3 are branch instr, assuming branch instr stalls the pipeline for remaining stages till its execution is complete (coz no behaviour regarding ths is given ) so they will take 5000.3(1 : for fetch + 4 : delayed) = 500 0.3 * 5 Remaining will execute normally i.e. 5000.7 will take same amnt.. so avg = 500 0.7 + 500 * 0.3 * 5 = 750 as opposed to 500 when no branch.. (i doubt abt ths.. ) so speed up = 1.5 plz chk n correct.. i guess m mising some details..
	IP Logged


One Stop GATE Forum : GATE Technical Discussions : GATE CS