Course Cloud Computing (Fall 2021-22)

Assignment Num. 01
Total Marks 50
Sections Y1
Start Date 30-Nov-2021
Due Date/Time 03-Dec-2021 (04:30 PM)
Submission Hard Copy (drop this in my cubicle, STD-502, Cubicle Number 5)
Authors Dr. Syed M. Irteza (mohammad.irteza@umt.edu.pk)

Submission - Assignments must be received before the deadline. Submissions after the
Guidelines deadline will face a 25% grade penalty (within 1 day) or a 50% grade
penalty (within 2 days).
- Late submissions should be submitted on LMS.
- Please do the work by yourself, this is an individual assignment.

1. These are the response times (in seconds) recorded for 20 users of our application. Please
calculate the following values:
a. 80th percentile response time
b. 90th percentile response time
c. Average response time
d. Median response time

1.10 0.58 2.13 6.14

5.72 2.01 8.54 5.02
8.11 4.28 6.40 8.75
5.28 9.87 9.58 1.54
1.37 1.18 8.95 4.05

You must show your working to get full credit.

(10 marks)

2. Assume we have a program that has 40% of its code that can be executed in parallel. Initially, we
run the whole program in a sequential manner. Our program manager says he wants a system
speedup of 4.1. Is this possible? Refer to Amdahl’s Law (see Lecture 05 - Slide 24).
(5 marks)

3. Assume a program takes 20 hours to run using a single processor. A specific part of the program,
that takes one hour to execute, cannot be run in parallel. The rest of the program can be
parallelized. If we now have 1000 processors available to use, what is the scaled speedup? Refer
to Gustafson’s Law (see Lecture 05 - Slide 24)
(5 marks)
4. Two of the four Coffman conditions for a deadlock are no-preemption and circular wait. Please
describe these two briefly in your own words (you may use a drawing to help).
(5 marks)

5. Imagine that a TCP sender is sending packets to a TCP receiver. Currently, the congestion
window size (known as cwnd) is 32 packets, i.e., in each RTT, the sender sends 32 packets. In the
next RTT, an event occurs within the network, that makes the sender reduce his congestion
window size (cwnd) to 1 packet. Do you think this is an example of congestion control or flow
control? Try to also explain the difference between the two forms of control?

(5 marks)

6. Using the following rules for logical clocks:

LC(e) = LC + 1  if e is a local event or a send(m) event

LC(e) = max(LC + 1, TS(m) + 1)  if e = receive(m)

Show the value of the logical clock on each of the three processes after every event. This
includes after each local event and message. Also show the value of the timestamp on each
message.

(10 marks)

7. How are vector clocks different from the concept of logical clocks that we have studied (and
used above), that were devised by Lamport? Can you describe how a vector clock works with an
example?
(5 + 5 = 10 marks)