1

Code :R7411503

IV B.Tech I Semester(R07)Regular Examinations, November/December 2010

PERFORMANCE EVALUATION OF COMPUTER SYSTEMS
(Computer Science & Systems Engineering)
Time: 3 hours Max Marks: 60
Answer any FIVE questions
All questions carry equal marks
?????

1. Explain special Discrete distributions.

2. (a) Explain the linearity property of expectation theorem.
(b) Define Markov process. Explain.
(c) Show that the time that a discrete parameter homogeneous Markov chain speeds in a given state
has a geometric distribution.
3. (a) Write notes on Discrete -parameter Birth-death processes.
(b) Derive a closed form expression for average system throughout for a closed queuing network under
mono programming (i.e.n=1).
4. (a) Explain the following :
i. Barraler shifting functions.
ii. Adjacency search.
(b) Explain SIMD Fast Fourier Transform.
5. (a) Write notes on :-
i. Multi-array configurations of the iliac-IV.
ii. Concurrent I/O and arithmetic logic operations in the MPP array.
(b) Give brief account on performance analysis of array processors.
6. (a) Briefly explain the following :
i. Floating supervisor system
ii. Semaphores for synchronization.
(b) Write notes on loosely coupled multiprocessors.
7. (a) Describe the following :
i. Synchronized parallel algorithm
ii. Degree of decomposition of a parallel algorithm
(b) Define semaphore and explain the same with an example.
8. (a) Explain static data flow computer architecture with a neat diagram.
(b) Write notes on data flow design alternatives.

?????
 2
Code :R7411503

IV B.Tech I Semester(R07)Regular Examinations, November/December 2010

PERFORMANCE EVALUATION OF COMPUTER SYSTEMS
(Computer Science & Systems Engineering)
Time: 3 hours Max Marks: 60
Answer any FIVE questions
All questions carry equal marks
?????

1. (a) Show that if event B is contained in event A, then p (B) ≤ p (A)

(b) If a three digit decimal number is chosen at random, find the probability that exactly K digits are
≥ 5, for 0 ≤ k ≥ 3.
(c) Write short notes on order statistics.
2. (a) Explain convolution theorem.
(b) Define stochastic process. Explain the same.
(c) Show that the first- order interarrival time of the nonhomogeneous Bernoulli process is not memory
less.
3. (a) Explain M/G/I queuing system.
(b) Prove that for an irreducible continuous parameter Markov chain, the limits,
Pj = lim Pij (t) = lim Pj (t), ij ∈ I
t→∞ t→∞
Always exist and are independent of the initial state i.
4. (a) Explain the following :-
i. Masking of process elements
ii. Bit serial associative processor.
(b) Explain Mesh-connected Illiac network with a neat diagram.
5. (a) Write notes on :-
i. The bit slicer operations in MPP.
ii. The facilities in illac-IV and MPP.
(b) Explain BSP-IV system architecture with a neat diagram.
6. (a) Briefly explain the following terms :
i. Context switching.
ii. Explicit parallelism.
(b) Write notes on Interconnection networks.
7. (a) Describe the following :
i. Mutual exclusion
ii. The TEST and SET instruction.
(b) Write notes on Deterministic scheduling models.
8. (a) Write notes on :
i. Advantages of potential problems.
ii. Switch lattices.
(b) Explain Arvind data flow machine organization and instruction format with a neat diagram.

?????
 3
Code :R7411503

IV B.Tech I Semester(R07)Regular Examinations, November/December 2010

PERFORMANCE EVALUATION OF COMPUTER SYSTEMS
(Computer Science & Systems Engineering)
Time: 3 hours Max Marks: 60
Answer any FIVE questions
All questions carry equal marks
?????

1. (a) Describe a possible sample space for the following experiment. - A box of ten chips is known to
contain one defective and nine good chips. Three chips are chosen at random from the box and
tested.
(b) Use axioms of events to prove the relations :-
i. AUA = A
ii. AUS = S
(c) Show that the PGF of a geometric random variable with parameter p is given by pz(1-qz) where
q=1-p.
2. (a) Give a brief account on continuous uniform distribution.
(b) Describe a method of generating a random derivate of a two stage hyper exponential distribution.

3. (a) Explain the theorem for l ≤ i , j <n, E [Xij ] = mij , the (i, j)th element of the fundamental matrix
M.
(b) Write notes on Birth and Death process.
4. (a) Explain the following :
i. Lock-step operations
ii. Shuffle-exchange functions.
(b) Write notes on cube interconnection networks.
5. (a) Explain MPP architecture.
(b) Write notes on Image processing on the MPP.
6. (a) Briefly explain the following :
i. Cross bar switches
ii. Multiport memory.
(b) Write notes on multiprocessor operating systems.
7. (a) Describe the following :
i. The P and V operators.
ii. Conditional critical sections.
(b) Define Monitors.
(c) Give a brief account on dimension of multiple processor management.
8. (a) Write notes on :-
i. Data flow graph and languages.
ii. Pattern embedding.
(b) Explain systolic array architecture

?????
 4
Code :R7411503

IV B.Tech I Semester(R07)Regular Examinations, November/December 2010

PERFORMANCE EVALUATION OF COMPUTER SYSTEMS
(Computer Science & Systems Engineering)
Time: 3 hours Max Marks: 60
Answer any FIVE questions
All questions carry equal marks
?????

1. (a) Describe a possible sample space for the following experiment. An if . . .then . . .else . . . statement
is executed four times.
(b) Use axioms of events to prove the relation.
i. A ∪ φ = φ
ii. A ∩ (A ∪ B) = A
(c) Explicitly determine the pmf of random variable X3 , the number of exchanges in program MAX
with array size n=3.
2. (a) Give a brief account on
i. Discrete uniform distribution.
ii. Imperfect fault coverage and reliability.
(b) The failure rate for a certain type of component is λ (t) = at (t ≥ 0) where a >o and is constant.
Find the component reliability and its expected life.
3. (a) Prove that for an periodic Markov chain, the limits Vj = lim pj (n)exist.
n→∞
(b) Write notes on LFU stack model.
4. (a) Explain the following :
i. Recirculating networks.
ii. Cube routing functions.
(b) Explain Shuffle exchange and b Mega networks.
5. (a) Explain Illiac-IV system architecture.
(b) List out the various applications of Illiac-IV
6. (a) Briefly explain the following terms :
i. Multiprocessor system
ii. Delta networks.
(b) Explain parallel memory organizations.
7. (a) Describe the following :
i. Dead lock prevention
ii. Multiprocessor anomalies
(b) Write notes on stochastic scheduling models.
8. Write short notes on :
(a) Control flow and data flow computers
(b) What are the key attributes of VLSI computing structures? Explain.

?????