G. H.

Raisoni College Of Engineering, Nagpur

Deptt. Of Computer Science & Engineering
8th Sem Computer Science & Engg.
Question Bank for El-III(Advance Comp. Architecture)
Session : 2004-05,2005-06
Name Of Teacher : Mrs. S. A. Raut(Dhote)
Unit I
Que. 1 Discuss various elements of modern computer system .
Que. 2 Write short note on Evolution of Comp. Architecture.
Que. 3 Give Flynns Classification.
Que. 4 Discuss various attributes that affect performance of CA.
Que. 5 Explain Concept of H/W & S/W parallism concept.
Que. 6 With suitable example explain Grain Packing & Scheduling.
Que. 7 Explian concept of node duplication.
Que. 8 Explain different I.N.
Que. 9 Explain Static I.N. . Why it is called as static I.N.?
Que. 10 Explain Dynamic I.N. . Why it is called as dynamic I.N.?
Que. 11 Explain various dependency exist in P.L..
Que. 12 What are Bernestens Condition ? Explain with suitable example.
Que. 13 Discuss various models for multiprocessors.
Que. 14 Differentiate between Mutiprocessors and Muticomputers.
Que. 15 Give Taxonomy of MIMD Computers.
Que. 16 Write short note on Vector Supercomputer.
Que. 17 Give architectural details ofr SIMD Computers.
Que. 18 Compare and discuss various Program flow mechanism.
Que. 19 Explain architecture and mechanism of working of Dataflow Computers.
Que. 20 Write various N/W properties and routing for I.N.
Unit II
Que. 21 Write short note on Speedup Laws.
Que. 22 What is Design space for Processors ? Explain Concept.
Que. 23 Give Evolution for Advanced Processor.
Que. 24 Explian ILP . What are different terms consider under ILP.
Que. 25 Compare and contrast between CISC and RISC.
Que. 26 Write what is VLIW ? Give its working.
Que. 27 Write short note Vector processor.
Que. 28 Write short note on Symbolic processor.
Que. 29 Explain Memory Hierarchy system.
Que. 30 Explain Concept of Virtual Memory.
Que. 31 Explain Why Memory Interleaving is important ? What are different types?
Que. 32 Explain Concept of Paging.

Que. 33 Explain Concept of Invert Paging.

Que. 34 Give the concept of Inclusion , Coherence and Locality.
Que. 35 Give the concept of Segmentaion.
Que. 36 Explain various Page replacement strategies.
Que. 37 Give architecture for cache memory organizations.
Que. 38 What are different types of mapping available ? Explain all in detail.
Que. 39 Explain shared memory models.
Que. 40 Give various parameters for memory performance.
Unit III
Que. 41 Differentiate between Linear Pipeline Processors and Dynamic PP.
Que. 42 Discuss various models of LPP.
Que. 43 Write short note on Asynchronous LPP.
Que. 44 Write short not on Synchronous LPP.
Que. 45 Explain concept of Reservation table and Latency analysis .
Que. 46 Explain how to draw state diagram from given reservation table.
Que. 47 Explain Greedy Cycles, Simple cycles .
Que. 48 What is MAL ? Why it is important to calculate MAL?
Que. 49 Discuss about Pipeline Throughput and Efficiency.
Que. 50 What are different phases of Instruction pipeline design.
Que. 51 Write short note on Prefetch Buffers.
Que. 52 How multiple functiong will improve performance of pipeline?
Que. 53 Explain Internal Forwarding with suitable example.
Que. 54 Explain Hazard Detection Mechanism in detail.
Que. 55 What are various techniques available for Dynamic Instruction scheduling.
Que. 56 Explain Tomasulos Algorithm.
Que. 57 Explain CDC Scoreboarding.
Que. 58 Discuss various Branch handling techniques.
Que. 59 Differentiate between CSA & CPA.
Que. 60 Design Fixed pointing multiplication with 8 bit.
Que. 61 Discuss convergence division.
Que. 62 Give architecture for IBM 360 Model 91.
Que. 63 Explain concept of multifunctional pipeline.
QUe. 64 Give and explain arch. Of TI ASC.
Que. 65 What is difference between Superscalr and Superpipeline processors .
Que. 66 What is In-Order Issue and Out-Order issue.
Unit IV
Que. 67 Give generized multiprocessor system.
Que. 68 What is IPCN , PION and IPMN ?
Que. 69 Give Hierarchical bus system.
Que. 70 Draw and explain Ultramax multiprocessor architecture.
Que. 71 Differentiate between Mutlistage and single stage N/W
Que. 72 Differentiate bet. Blocking & Nonblocking N/W.
Que. 73 Design Omega N/W for function = (1,5,3,7) (2,4,6).

Que. 74 Design Omega N/W which explains concept of Blocking of N/W.

Que. 75 How broadcasting done in Omega N/W?
Que. 76 Give schematic design for crosspoint switch in crossbar n/w.
Que. 77 Give concept of multiport memory.
Que. 78 Give and explain concept of Hot Spot problem.
Que. 79 Explain concept of Fetch&Add operation.
Que. 80 Discuss cache coherence problem.
Que. 81 Differntiate bet. Write-through and Write-back operation with suitable example.
Que. 82 Explain Snoopy bus protocols.
Que. 83 Explain Directory based protocol.
Que. 84 What are primary categories of DBP ? Explain in detail.
Que. 85 Give different generations of Multicomputer.
Que. 86 What are various message routing schemes available .
Que. 87 Differentiate bet. Physical & Virtual Channel.
Que. 88 Explain Multicast routing algorithm.
Que. 89 Explain concept of N/E partitioning.
Unit V
Que. 90 What are various Vector processing principle ?
Que. 91 Explain various types of Vector Instruction.
Que. 92 Discuss various Vector access memory scheme.
Que. 93 Differentiate between C Access and S Access scheme.
Que. 94 Define CVF.
Que. 95 Explain concept of Vector chaining and looping .
Que. 96 Write short note on Distributed Memory Model.
Que. 97 Write short note on Shared- Memory Model.
Que. 98 Discuss and differentiate between two models of SIMD supercomputers.
Que. 99 Explain Principles of multithreading.
Que. 100 Discuss various parameters for detecting performance of architecture.
Que. 101 What are two diff. problems caused by asynchrony and comm.. latency in PP.
Que. 102 Explain Concept of Dataflow Graphs .
Que. 103 Compare and Constrast bet. Static Vs Dynamic dataflow.
Que. 104 Write short note on pure dataflow m/c.
Unit VI
Que. 105 What is importance of Code Optimization and Scheduling?
Que. 106 What are Constraints for optimization and scheduling?
Que. 107 Write Short note on Local Optimizations .
Que. 108 Write short note on Global Optimization .
Que. 109 What are various methods for Parallelization of code.
Que. 110 What do u understand by Vectorization ? Explain in detail.
Que. 111 Explain construction of DAG for Bubble sort.
Que. 112 write Testing Algorithm . What is the purpose of same.
Que. 113 What are Distance and Direction Vectors?
Que. 114 What is Lexicographic Order ? Explain with proper example.

Que. 115 Explain various testing used for dependence testing.

Unit I
Que. 116 Draw Dependence graph for following program segment.
S1 : A = B + C
S2 : C = D + E
S3 : F = G + E
S4 : C = A + F
S5 : M = G + C
S6 : A = L + C
S7 : A = E + A
Que. 117 Answer following questions for the k-ary n-cube N/W
(a) How many nodes are there?
(b) What is N/w diameter?
(c) What is node degree?
(d) What is bisection width?
Que. 118 Define following terms related to parallelism and dependence relations
(a)Computational granularity
(b) Communication latency
(c) Flow dependence
(d) Berstens Condition
Que. 119 Explian Bernstens condition with suitable example.
Que. 120 Draw the dependence graph which will explain all dependencies for program
Unit II
Que. 121 Explain Different Performance metric.
Que. 122 Explain Amdahls law.
Que. 123 Explain Concept of Processor and co-processor.
Que. 124 Differentiate between Private and Virtual Memory.
Que. 125 Differentiate bet. Paging & Segmentation.
Que. 126 What is aliasing problem in caching ?
Unit III
Que. 127 Explain effect of clocking and timing control.
Que. 128 What is effect of delay insertion on reservation table.
Que. 129 Explain concept of stalling.
Unit IV
Que. 130 Explain Routing in Butterfly N/W
Que. 131 Explain with suitable dia Cache coherence prob in data sharing and in process
migration.
Que. 132 Mention different cache events and actions.

Unit V
Que. 133 Why C/S memory organization is more suitable.
Que. 134 Explain Systolic program graph
Que. 135 Explain architecture for Dataflow Computer .
Unit VI
Que. 136 What ZIV , SIV tests ? Explain concept in detail.
Que. 137 What is importance of Dependence Testing.?
Que. 138 Explain Optimization of compilers.