Scribd
Upload
45 views

Assignment 3

This document outlines an assignment for a parallel processing course. It provides instructions for the assignment, which asks students to select an algorithm and parallelize it. Students must submit both the sequential and parallel versions of the code, along with a 1-2 page report discussing relevant performance parameters like speedup in execution time. The report and code must be submitted as a zip file named according to the outlined format. The document also provides an example of parallelizing a vector addition algorithm to reduce the runtime from O(n) to O(1).

Uploaded by

wardabibi69
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
45 views

Assignment 3

This document outlines an assignment for a parallel processing course. It provides instructions for the assignment, which asks students to select an algorithm and parallelize it. Students must submit both the sequential and parallel versions of the code, along with a 1-2 page report discussing relevant performance parameters like speedup in execution time. The report and code must be submitted as a zip file named according to the outlined format. The document also provides an example of parallelizing a vector addition algorithm to reduce the runtime from O(n) to O(1).

Uploaded by

wardabibi69
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

FACULTY OF COMPUTER SCIENCE AND ENGINEERING

Ghulam Ishaq Khan Institute of Engineering Sciences and Technology, Topi

Deadline: 22/11/2023. CS417 Parallel Processing Marks: 15

Assignment 3 Instructor: Nazia Shahzadi Dated: 18/11/2023

Note: Assignment policy is as follows:


• This is an individual assignment.
• Students must not share the actual program code with other students.
• Students must be prepared to explain any program code they submit.
• If any student will submit the assignment late. Then half marks must be detected and no
excuse will be accepted.

1 Introduction
Traditionally, computers have only one processor and algorithms were designed to be
sequential. But, today’s computers have more than one processing element (either multiple
CPU cores or GPU) means “heterogeneous computing” like we are discussing now a days in
CUDA programming. So, sequential programs are slow as they need to process the
instructions one by one. Performance of some sequential programs (not all) can be
improved by exploiting the parallel architectures. Let us consider a vector addition
example. Two vectors of length n can be added in parallel using at most n processors, as
shown in Figure 11. Here, pi denotes ith processor. If we have n processors, then
asymptotic run time of a vector addition program can be reduced from O(n) to O(1)
upon parallelizing.
In general, if you have p processors and execution time is ts seconds for a sequential
p
version of an application, then you should see a speed-up (theoretically) of O( ts ) upon
parallelizing the application. Please note that all sequential algorithms can’t be
converted to parallel algorithms and you have to be cautious while taking these
design decisions.

1
Figure 1: Vector addition: Sequential to Parallel
example

2 Assignment
In this assignment, you are asked to select an algorithm of your choice like from
course of “Algorithm Analysis” and parallelize it. You can use any programming
language (C/C++, FORTAN etc.) with which you are familiar. You are required to
submit a report of about 1-2 pages (In this part, you should discuss the
performance of the application in terms of different parameters which you feel are
relevant for analysis. Speed-up in execution time could be one of the parameters.
That what’s the speed up of sequential and parallel program) along with the code
(both sequential version and parallel version) in a zip file. You should name your zip
file as: Nazia_ R o l l n u m b e r _ a3.

You might also like