Jaypee Institute of Information Technology (JIIT) 2008 B.E Computer Science Test 1 : Paralell Processing CSE - Question Paper
JAYPEE UNIVERSITY OF INFORMATION TECHNOLOGY
WAKNAGHAT, SOLAN-173215. HP. INDIA
TEST-1 13- 15 February 2008
|
COURSE: PARALLEL PROCESSING COURSE CODE: CI414 COURSE CREDITS: 3 |
CLASS: B.TECH.8TH SEM (CSE AND IT) MAX. MARKS: 20 TIME: I HOUR |
Note: Attempt all the questions.
Question I [16 Marks). Given the following assembl) language code. Exploit the maximum degree of parallelism among the 16 instructions, assuming no resource conflicts and multiple functional units are available simultaneously. For simplicity, no pipelining is assumed. All instructions take one machine cycle to execute. Ignore all other overhead.
1. LOADRUA
2. LOADR2.B
3. MULR3.RI.R2
4. LOAD R4, D
5. MULR5.RI.R4
6. ADDR6.R3.R5
7. STORE X.R6
8. LOAD R7, C
9. MULR8, R7.R4
10. LOAD R9. E
11. ADD RIO, R8. R9
12. STORE Y. RIO
13. ADD Rl I. R6, RIO
14. STORE U, Rl I I5.SUBR12. R6, RIO 16. STORE V, R12
1. [5 Marks]. Draw a program graph with 16 nodes to show the flow relationship among the 16 instruction.
2. [5 Marks]. Then draw the coarsc-grain program graph after packing.
3. [6 Marks]. At the end draw and discuss the scheduling of the fine-grain and coarse-grain programs.
Qucstion2 [4 Marks). Explain with example the Node-duplkation scheduling to eliminate communication delays between processors.
|
Attachment: |
| Earning: Approval pending. |
