Virtual University of Pakistan

Spring 2024

Total marks: 20
Deadline Date:
CS435 - Cloud Computing
April 29, 2024
Assignment # 01
Spring 2024

Please carefully read the following instructions before attempting assignment.

RULES FOR MARKING

It should be clear that your assignment would not get any credit if:

▪ The assignment is submitted after the due date.

▪ The submitted assignment does not open or corrupt.

▪ Strict action will be taken if the submitted solution is copied from any other student or from the internet.

UPLOADING INLINE ASSIGNMENT INSTRUCTION

Follow the given instructions to submit Inline assignments:
Microsoft Word (doc/docx) and Adobe Acrobat (pdf) file uploading options will not be available in inline assignment submission.

 You need to directly type your solution as Copy Past option will not be available.

 Students can submit HTML, Images (of equations and diagrams), and plain text only in this inline Mode. You may also insert table.

 Students can insert the images or snapshots in the following formats.

 Images and tables can be inserted using the following highlighted option in the interface.

NOTE
No assignment will be accepted after the due date via email in any case (whether it is the case of load shedding or internet malfunctioning etc.). Hence refrain from uploading

assignment in the last hour of deadline. It is recommended to upload solution file at least two days before its closing date.

If you find any mistake or confusion in assignment (Question statement), please consult with your instructor before the deadline. After the deadline, no queries will be

entertained in this regard.

For any query, feel free to email at:

CS435@vu.edu.pk

OBJECTIVE
The objective of this assignment is to:

Basic understanding of Virtual Machines (VM) and Computations (apps/tasks/jobs).

●
Learn and practice mapping of tasks to VM in cloud computing.
●
 Virtual University of Pakistan

Spring 2024

Problem Statement: Total Points (20)

Consider a cloud datacenter "cdc1" that comprise of a host machine with two Virtual Machines (VMs) VM1 and VM2 having computation capacity 20 and 30 Million
Instructions Per Second (MIPS) respectively. Suppose five tasks, T0, T1, T2, T3, and T4 having computation requirements of 20, 30, 40, 60 and 80 Million Instructions (MI),
respectively. Moreover, all these tasks are compute-intensive (CPU bound) and need to be allocated on space-shared (none-preemptive) basis.

Based on the above scenario, you are required to map (schedule) these tasks using Round Robin (RR) scheduler and calculate:

1. The expected maximum execution time (Makespan) of all tasks.

2. Throughput.

3. Average Resource Utilization Ratio (ARUR).

Note: For more detail, explore the link: https://ieeexplore.ieee.org/abstract/document/9408572

Best of Luck!!!