Scribd
Upload
18 views3 pages

Lab 4

Uploaded by

Nour Hassan Ibrahim
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
18 views3 pages

Lab 4

Uploaded by

Nour Hassan Ibrahim
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
You are on page 1/ 3

University Faculty of ‫جامعة االسكندرية‬

Engineering Comp. & Comm. ‫كلية الهندسة‬


Engineering CC373: ‫برنامج هندسة الحاسب واالتصاالت‬
Operating Systems ‫مادة نظم التشغيل‬

Lab4
Pthreads

Objectives
 Introducing threads concepts and POSIX threads library.
 Implementing popular algorithms as multi-threaded ones.

Part 1 Merge Sort (Assessment in the lab )


Merge sort is an O (n log n) comparison-based sorting algorithm. It is a
divide and conquers algorithm. Conceptually, a merge sort works as
follows:

If the list is of length 0 or 1, then it is already sorted. Otherwise:

 Divide the unsorted list into two sub-lists of about half the size.

 Sort each sub-list recursively by re-applying the merge sort.

 Merge the two sub-lists back into one sorted list

So you are required to implement it using pthreads. Each time the list is
divided; two threads are created to do merge-sort on each half
separately. This step is repeated recursively until each sub-list has only
one element.Given the code you will need to modify it to apply
multi threading merge sort in your lab.

How to run : make

The program should read two input lines from a file called input (create it in
your working directory where the .c file exist) in the following format:

[number of elements] 1
Array elements which are space separated.
example input
10
100 20 15 3 4 8 7 -1 0 33

When the program finishes, it should print out the sorted array.

Part 2 Matrix Multiplication


It is required to implement two variations of this algorithm:

1. The computation of each element of the output matrix happens in a thread.

2. The computation of each row of the output matrix happens in a thread.

For both variations, you have to compute the elapsed time for each of them, compare them
and justify your answer.

The program should read two input matrices from a file in the following format:

[number of rows of 1st matrix] [number of columns of 1st matrix]


1st matrix entries
[number of rows of 2nd matrix] [number of columns of 2nd matrix]
2nd matrix entries

example input:

35
1 -2 3 4 5

2
1 2 -3 4 5
-1 2 3 4 5
54
-1 2 3 4
1 -2 3 4
1 2 -3 4
1 2 3 -4
-1 -2 -3 -4

output format:

[result matrix entries]


END1 [elapsed time of procedure 1]
[result matrix entries]
END2 [elapsed time of procedure 2]

please note that [] is for clarity you shouldn't print it

Deliverables
Complete source code in for Part2 commented thoroughly and clearly.

1st filename is your ID-matrix (e.g., 5237-matrix.c, 5237-matrix.cpp, 5237-matrix.C, 5237-


matrix.cc, …)

You should complete Part1 in Lab

Submission Link : Link. Deadline Wednesday 13th November


Notes
Languages used: C/C++.

Students will work individually.

You may talk together on the algorithms or functions being used but are NOT
allowed to look at anybody’s code.

Revise the academic integrity note found on the class web page.

You might also like