BE5-R3 - BE5-R3: PARALLEL COMPUTING NOTE: 1. 2. Answer...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
BE5-R3: PARALLEL COMPUTING NOTE: Time: 3 Hours Total Marks: 100 1. a) Prove that a k-stage linear pipeline can be at most k times faster than that of a nonpipelined serial processor. b) Briefly compare “Shared memory programming” and “message passing” paradigms on the basis of data sharing and synchronization. c) What are the advantages and disadvantages of loop-splitting (statically dividing a loop among the processes) against self-seheduling? d) Explain different architectures for shared memory multiprocessing along with its advantages and disadvantages. e) Describe at least four characteristics of MIMD multiprocessors that distinguish them from multiple computer systems or computer networks. f) Bitonic sequence is the basis of Bitonic merge sort. Justify. g) A large multiprocessor usually allows a larger size of the problem to be undertaken in a reasonable execution time. Justify it using Gustafson’s law. (7x4)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/04/2012 for the course COMPUTER 101 taught by Professor Ahmed during the Spring '11 term at alamo.edu.

Page1 / 2

BE5-R3 - BE5-R3: PARALLEL COMPUTING NOTE: 1. 2. Answer...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online