Scribd
Upload
36 views1 page

Fall 2024 - CS435 - 1

hjhjh

Uploaded by

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

Fall 2024 - CS435 - 1

hjhjh

Uploaded by

Zubair Ahmed
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Virtual University of Pakistan

Fall 2024

Total marks: 20
Deadline Date:
CS435 - Cloud Computing
November 07, 2024
Assignment # 01
Fall 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.

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:

[email protected]

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.

Problem Statement: Total Points (20)

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

The tasks arrival order is: T1, T2, T0, T4, and T3.

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!!!

You might also like