SRM UNIVERSITY

Ramapuram, Chennai.
Department of Computer Applications MCA!
"arallel Computin# $ MC%&&'
(uestion )an*
UNIT I
"ART A
1. What is Parallel Computing?
2. Why do we need Parallel Computers?
3. Specify few applications that require high speed computers?
4. !plain "ata #low Computers?
$. "efine Systolic %rchitecture?
&. "efine 'eural 'etwor(s model?
). What is Pipelined %rchitecture?
*. What is Processing lement +P,?
-. What is .a!imum "egree of Parallelism?
1/. "efine Speed up of a Parallel Computer?
11. What is fficiency of a Parallel Computer?
"ART )
1. la0orately write the 1arious architectural classification schemes.
2. !plain architectural classification schemes in detail.
3. 2ow will you measure the performance of parallel computer? !plain.
UNIT II
"ART A
12. What is pipeline processing?
13. What is 0asic operation of #i!ed Point multiplication Pipeline?
14. What are the steps in1ol1ed in #loating Point %ddition Pipeline?
1$. What are the steps in1ol1ed in floating point multiplication?
1&. What are the fi1e sections of the pipelined stage?
1). "efine 3 4nifunction Pipeline.
1*. What is .ultifunction Pipeline?
1-. "efine 3 ha5ard.
2/. What are the three (inds of ha5ards?
21. What is 6nterloc(?
22. !plain carry sa1e addition principle.
1
"ART )
1. !plain pipeline instruction processing
2. Write note on interloc(s.
3. Write note on fi!ed point and floating point addition pipeline with neat diagram.
4. Write note on fi!ed point and floating point multiplication pipeline with neat
diagram
UNIT III
"ART A
1. What are stages of architectural machine pipeline?
2. 7i1e the rules for 0us.
3. "efine 7reedy scheduler.
4. What is latency cycle?
$. What is perfect latency cycle?
&. What is C8%9: S%9 and 9%9?
). 7i1e the formula to calculate speedup of memory.
*. "ifferentiate static pipeline with dynamic pipeline.
-. What is reser1ation ta0le?
"ART )
1. !plain 1arious memory systems used in pipeline organi5ation
2. Write notes on "ata dri1en e!ecution through internal forwarding.
3. !plain 9ules for memory controller: arithemetic logic pipelines +*,
4. !plain Scheduling dynamic pipelines. +*,
$. Write notes scheduling of static pipelines.+1/,
&. Write notes on 2ardware implementation of scheduler. +&,
). Write note on rules for ;us.+*,
*. Write note on <atency cycle and reser1ation ta0le. +*,
UNIT IV
"ART A
23. What is permutation
24. "ifferentiate single sided networ( with dou0le sided networ(
2$. "ifferentiate circuit switching with pac(et switching?
2&. What is 9outing?
2). <ist out 1arious commonly used interconnection networ(s?
2*. <ist out 1arious commonly used criteria=s to classify the connection networ(.
2-. What is 0roadcasting?
2
3/. What are the 1arious routing operations?
31. 7i1e the ;enes networ( principle.
"ART A
1. Write notes on complete con 0loc(ing networ(.
2. !plain interconnection networ(s
3. !plain 1arious elementary permutations used in interconnection networ(s.
4. !plain a0out P.26 networ( in detail.
UNIT V
"ART A
1. "iscuss the operations of data flow graph.
2. !plain 1ector computers
3. !plain 89 parallelism and %'" parallelism
4. "efine 3 Prolog.
$. What are the two statements used for process creation?
"ART )
1. "iscuss a0out "ata flow computers in detail.
2. Write notes on logic programming.
3. With e!ample procedure: e!plain 1ector computers.
3. With e!ample procedure: e!plain a shared memory parallel computer programming.
3. With e!ample procedure: e!plain a message passing multicomputer.
3