BPUT
- Biju Patnaik University of Technology ,BPUT, Rourkela Is a well-known and famous university in India.
- Biju Patnaik University of Technology , BPUT , Rourkela has been established by an Act of the Assembly, Government of Odisha in June 2002. Engineering, Pharmacy, Architecture, M.Tech, Fashion designing and MCA and MBA degree etc. are the courses provided under this university.
- You Can Download all previous year Semester question papers Of BPUT Here For Free.
[caption id="attachment_945" align="aligncenter" width="150"]
Biju Patnaik University of Technology ( BPUT ), Rourkela[/caption]
B.Tech :
- In B.Tech, Following Disciplines are under Biju Patnaik University of Technology, BPUT
- Applied Electronics & Instrumentation Engineering (AE&I),
- Electronics & Telecommunication Engineering (ELE&TC)
- Biomedical Engineering (BIOMED)
- ENV-Environmental Engineering
- BIOTECH - Biotechnology
- I&E - Instrumentation & Electronics Engineering.
- CHEM - Chemical Engineering.
- IT - Information Technology
- COMP.Sc.-Computer Science. Engineering.
- MECH - Mechanical Engineering.
- ELECT - Electrical Engineering.
- MET- Metallurgy & Material Science
- E&EE - Electrical & Electronics Engineering.
- MANU - Manufacturing Sc. & Engineering.
- There are 8 semester during 4year of B.Tech Coarse.
- Here we give you all Semester Question papers of all Discipline of BPUT
Previous year question papers Of PARALLEL AND DISTRIBUTED SYSTEMS Of BPUT,Eighth Semester 2011 Image Format
[gallery]
PDF file of previous year question papers Of PARALLEL AND DISTRIBUTED SYSTEMS Of BPUT,Eighth Semester 2011
2011_pds_bput.click here to get the pdf First
subscribe us OR
Like us on
Facebook to get all the Question, Job, exam, Career related updates.
After
subscribe us click below to get the pdf file
previous year question papers Of PARALLEL AND DISTRIBUTED SYSTEMS Of BPUT,Eighth Semester
For more Question Visit
http://www.careerodisha.in/ Eighth Semester Examination — 2011
PARALLEL AND DISTRIBUTED SYSTEMS
Full Marks—70
Time: 3 Hours
Answer Question No. I which ¡s compulsory and any five from the rest.
The figures in the right-hand margin indicate marks.
1. Answer the following questions: 2 x10
a) What are the major performance metrics for characterizing an interconnection network?
b) Define and differentiate between static and dynamic interconnection Network.
c) What is Data-Parallel algorithm model?
d) What is Cut-Through Routing? How the total communication time is calculated for a cut-Through routing?
e) What is data parallel model for parallel algorithm?
f) Define and differentiate between adaptive routing and deterministic routing.
g) Define the metric “scaled speedup”? How this metric used for parallel Program? ‘
h) Define latency and bandwidth of memory?
i) Define and differentiate between Non-blocking no-buffered send and Receive operations? ‘
j) What do you mean by speculative decomposition of parallel program?
For More Question Visit http://www.careerodisha.in/2.
a) Explain the different mechanism for dynamic mapping of tasks. 2.5
b) Briefly compare “Shared memory programming” and “message passing” Paradigms on the basis of data sharing and synchronization. 2.5
c) Explain different architectures for shared memory multiprocessing along with its advantages and disadvantages. 2.5
d) Bitonic sequence is the basis of Bitonic merge sort. Justify. 2.5
3.
a) What are the major performance metrics for characterizing an inter connection network? 5
b) What are the different parallel algorithm models? Explain producer-Consumer model? 5
4.
a) Define and differentiate between “minimum execution time “and minimum cost-optimal execution time? 5
b) Explain “Butterfly network” with its permutation. Give examples of some networks that can be categorized as butterfly network. 5
5.
a) What is scalability of parallel programs? Explain how one can evaluate the scalability using analytical tools. 5
b) Explain the different mechanism to reduce the interaction among concurrent task in parallel computing system. 5
6.
a) Define Granularity. How it is useful in parallel computing. What is coarse grained and fine grained parallelism? Which one is the best? 5
b) What are the various issues to be addressed on realization of parallel sorting algorithm? 5
7.
a) Explain quick sort using hypercube and discuss its efficiency. 5
b) Describe a parallel formulation of matrix-vector multiplication algorithm using 2-D block partitioning.
8. Write short notes of the following: 2.5 x 4
a) Sorting Networks
b) Performance Metrics for Parallel systems
c) Asymptotic Analysis of parallel Programs ‘
d) Routing in interconnection network.
BPUT
- Biju Patnaik University of Technology ,BPUT, Rourkela Is a well-known and famous university in India.
- Biju Patnaik University of Technology , BPUT , Rourkela has been established by an Act of the Assembly, Government of Odisha in June 2002. Engineering, Pharmacy, Architecture, M.Tech, Fashion designing and MCA and MBA degree etc. are the courses provided under this university.
- You Can Download all previous year Semester question papers Of BPUT Here For Free.
[caption id="attachment_945" align="aligncenter" width="150"]
Biju Patnaik University of Technology ( BPUT ), Rourkela[/caption]
B.Tech :
- In B.Tech, Following Disciplines are under Biju Patnaik University of Technology, BPUT
- Applied Electronics & Instrumentation Engineering (AE&I),
- Electronics & Telecommunication Engineering (ELE&TC)
- Biomedical Engineering (BIOMED)
- ENV-Environmental Engineering
- BIOTECH - Biotechnology
- I&E - Instrumentation & Electronics Engineering.
- CHEM - Chemical Engineering.
- IT - Information Technology
- COMP.Sc.-Computer Science. Engineering.
- MECH - Mechanical Engineering.
- ELECT - Electrical Engineering.
- MET- Metallurgy & Material Science
- E&EE - Electrical & Electronics Engineering.
- MANU - Manufacturing Sc. & Engineering.
- There are 8 semester during 4year of B.Tech Coarse.
- Here we give you all Semester Question papers of all Discipline of BPUT
Previous year question papers Of PARALLEL AND DISTRIBUTED SYSTEMS Of BPUT,Eighth Semester 2011 Image Format
[gallery]
PDF file of previous year question papers Of PARALLEL AND DISTRIBUTED SYSTEMS Of BPUT,Eighth Semester 2011
2011_pds_bput.click here to get the pdf First
subscribe us OR
Like us on
Facebook to get all the Question, Job, exam, Career related updates.
After
subscribe us click below to get the pdf file
previous year question papers Of PARALLEL AND DISTRIBUTED SYSTEMS Of BPUT,Eighth Semester
For more Question Visit
http://www.careerodisha.in/ Eighth Semester Examination — 2011
PARALLEL AND DISTRIBUTED SYSTEMS
Full Marks—70
Time: 3 Hours
Answer Question No. I which ¡s compulsory and any five from the rest.
The figures in the right-hand margin indicate marks.
1. Answer the following questions: 2 x10
a) What are the major performance metrics for characterizing an interconnection network?
b) Define and differentiate between static and dynamic interconnection Network.
c) What is Data-Parallel algorithm model?
d) What is Cut-Through Routing? How the total communication time is calculated for a cut-Through routing?
e) What is data parallel model for parallel algorithm?
f) Define and differentiate between adaptive routing and deterministic routing.
g) Define the metric “scaled speedup”? How this metric used for parallel Program? ‘
h) Define latency and bandwidth of memory?
i) Define and differentiate between Non-blocking no-buffered send and Receive operations? ‘
j) What do you mean by speculative decomposition of parallel program?
For More Question Visit http://www.careerodisha.in/2.
a) Explain the different mechanism for dynamic mapping of tasks. 2.5
b) Briefly compare “Shared memory programming” and “message passing” Paradigms on the basis of data sharing and synchronization. 2.5
c) Explain different architectures for shared memory multiprocessing along with its advantages and disadvantages. 2.5
d) Bitonic sequence is the basis of Bitonic merge sort. Justify. 2.5
3.
a) What are the major performance metrics for characterizing an inter connection network? 5
b) What are the different parallel algorithm models? Explain producer-Consumer model? 5
4.
a) Define and differentiate between “minimum execution time “and minimum cost-optimal execution time? 5
b) Explain “Butterfly network” with its permutation. Give examples of some networks that can be categorized as butterfly network. 5
5.
a) What is scalability of parallel programs? Explain how one can evaluate the scalability using analytical tools. 5
b) Explain the different mechanism to reduce the interaction among concurrent task in parallel computing system. 5
6.
a) Define Granularity. How it is useful in parallel computing. What is coarse grained and fine grained parallelism? Which one is the best? 5
b) What are the various issues to be addressed on realization of parallel sorting algorithm? 5
7.
a) Explain quick sort using hypercube and discuss its efficiency. 5
b) Describe a parallel formulation of matrix-vector multiplication algorithm using 2-D block partitioning.
8. Write short notes of the following: 2.5 x 4
a) Sorting Networks
b) Performance Metrics for Parallel systems
c) Asymptotic Analysis of parallel Programs ‘
d) Routing in interconnection network.
Posted at 09:50 | by
Unknown
