Cochin University of Science and Techology (CUST) 2006-8th Sem B.Tech Computer Science and Engineering (Supplementary) , tember , CS 801 Advanced Architecture And Parallel Processing - Questio
B. Tech Degree VIII Semester (Supplementary)
Examination, September 2006
BTS (C) - VIII - (S) - 06 - 039 (X)
CS801 ADVANCED ARCHITECTURE AND PARALLEL PROCESSING (Prior io 2002 Adnuuiora)
Time: 3 Hours Maximum Maria: 100
1. |
(*) |
With neat block digrams explain Flynn's classification of computer architecture. |
(10) |
(b) |
Explain any thret staifc multiprocessor interconnect networks. OR Explain about the three shared memory multiprocessor models |
00) | |
11. |
() |
(15) | |
(b) |
Write notes on parallel random access machine (PRAM) raodeb aad its variants |
<3> | |
III. |
() |
Explain about synchronous and asynchronous linear pipeline processors. |
(10) |
(b) |
Write notes oo pipeline throughput and pipeline efficiency. OR |
(10) | |
IV. |
() |
Explain about the following instruction ppeline mechanisms: (I) Prefetch buffers (II) Multiple functional units (iii) Internal data forwarding. |
(15) |
(b) |
Explain about branch prediction in instruction pipelining. |
(5) | |
V. |
() |
What is parallel programming model? Explain different parallel programming models. |
(12) |
0>) |
What b meant by data dependence? Explain various types of data dependencies. OR |
(*) | |
VI. |
() |
Explain subscript separability and subscript partitioning. |
(10) |
<b) |
Explain different classification of operating systems for parallel processing. |
(10) | |
VIL |
() |
Explain different methods for the implementation of threads in Java. |
(10) |
(b) |
Explain the wired Barrier Synchronization mechanism OR |
(10> | |
VIII. |
() |
Explain the woricing of multithreaded processor model with a neat block diagram. |
(12) |
(b) |
Explain the architecture of PVM. |
(*) | |
IX. |
<*) |
Write notes on: (i) Distributed Operating Systems (ii) Distributed DBMS. |
(10) |
(b) |
Explain various debugging techniques used in parallel programming. OR |
(10) | |
X. |
() |
Explain the parallel reduction algorithm and its time and space complexity analysis. |
(12) |
(b) |
Explain the concept of distributed shared memory in distributed operating systems. |
(*) |
Attachment: |
Earning: Approval pending. |