Scribd
Upload
4 views1 page

Parallel Algorithm Assignment 3

The document is an assignment for a course on Parallel Algorithms at the University of Lucknow, focusing on various aspects of parallel computing. It includes questions on the differences between parallel and sequential algorithms, parallel sorting networks, merging algorithms across different memory models, and the impact of memory access on performance. Additionally, it discusses the role of linear array architecture in enhancing sorting efficiency.

Uploaded by

darkside001912
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
4 views1 page

Parallel Algorithm Assignment 3

The document is an assignment for a course on Parallel Algorithms at the University of Lucknow, focusing on various aspects of parallel computing. It includes questions on the differences between parallel and sequential algorithms, parallel sorting networks, merging algorithms across different memory models, and the impact of memory access on performance. Additionally, it discusses the role of linear array architecture in enhancing sorting efficiency.

Uploaded by

darkside001912
Copyright
© All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

FACULTY OF ENGINEERING AND TECHNOLOGY, UNIVERSITY OF LUCKNOW

Department of Computer Science and Engineering


Parallel Algorithm (AI-8011)
CSE-AI (4th year/ 8th Sem)

Assignment#3

Q1. Explain the concept of parallel algorithms. How do they differ from sequential algorithms?
Discuss their advantages and limitations.

Q2. Describe parallel sorting networks. Explain their structure, working mechanism, and
importance in parallel computation.

Q3. Explain parallel merging algorithms on different models such as CREW, EREW, and MCC.
Highlight the differences between these models.

Q4. Discuss sorting networks under CREW, EREW, and MCC models. How does memory
access affect the performance of these networks?

Q5. Explain the concept of CREW, EREW, and MCC memory models in parallel computing.
Provide suitable examples for each.

Q6. Describe the role of linear array architecture in parallel sorting networks. How is it used to
improve efficiency in sorting operations?

You might also like