Channabasaveshwara Institute of Technology

(Affiliated to VTU, Belgaum & Approved by AICTE, New Delhi)

(NAAC Accredited & ISO 9001:2015 Certified Institution)
NH 206 (B.H. Road), Gubbi, Tumakuru – 572 216.Karnataka.

Assignment-I

Course Title: ADVANCED COMPUTER ARCHITECTURES Course Code: 15CS72

Que.
Questions
No.
Briefly explain the elements of modern computer in the context of parallel processing with a neat diagram
1.
Explain the bernstein’s condition for parallelism. detect the parallelism in the following code
2. using bernstein’s condition.(assume no pipeline)
P1:C=D*E; P2:M=G+C; P3:A=B%C; P4:C=L+M; P5:G%E.
Define the following terms for various system interconnect architecture. i). Node degree ii).Node
3. diameter iii). Broadcast & Multicast iv). Mesh & Torus.
Give the Flynn’s classification of computer architectures based on notions of instruction and data streams.
4. Explain with neat diagrams.

5. A 400MHz processor was used to execute a bench mark program with the following instruction
mix and clock cycle counts:
Instruction type Instruction count Clock cycle count
Integer
4,50,000 1
Arithmetic
Data Transfer 3,20,000 2
Floating Point 1,50,000 2
Control transfer 80,000 2
Determine the i).Effective CPI ii).MIPS rate and iii).Execution time for this program.

6. List the performance factors and system attributes .explain how performance factors are
7. influenced
Explain by NUMA
UMA, system and
attributes.
COMA models for multiprocessor systems.
8. Consider the execution of an object code with 2 * 10 6 instructions on a 400-MHz processor. The
program consists of 4 major type of instructions. Instruction mix and CPI for each instruction
type are given below:

Instruction type CPI Instruction Mix

ALU 1 60%
Load & Store 2 18%
Branch 4 12%
Memory
8 10%
Reference

i). Calculate the average CPI when the program is executed on a uniprocessor.
ii). Calculate the corresponding MIPS rate based on CPI obtained
in part (i).

9. What are the metrics affecting scalability of a computer system ? What are the important characteristics
of parallel algorithms?
10. Explain with diagram the operational model of SIMD super computer
11. Consider the following code fragment of four instructions:
S1: Load R1, A
S2: Add R2,R1
S3: Move R1, R3
S4: Store B, R1
Draw a dependence graph to show all the dependences.
12. What are the condition of parallelism .Explain different types of data dependences.

13. Briefly explain the architecture of vector super computer

14. Consider the following instructions:
Var a,b,c,d,e,f,g,h,I,j,k,l,m,n,o,p,q
Begin
1. a := 1 10. j := e × f
2. b := 2 11. k := d × f
3. c := 3 12. l := j × k
4. d := 4 13. m := 4 × l
5. e := 5 14. n := 3 × m
6. f := 6 15. o := n × i
7. g := a × b 16. p := o × h
8. h := c × d 17. q := p × g
9. i := d × e
End
Show the fine grain program graph before packing and convert it to coarse grain program
graph after packing.

15. With a diagram explain the operation of tagged token data flow computer