Renting Servers in the Cloud: The Case of Equal Duration Jobs

08/27/2021
by   Mahtab Masoori, et al.
0

Renting servers in the cloud is a generalization of the bin packing problem, motivated by job allocation to servers in cloud computing applications. Jobs arrive in an online manner, and need to be assigned to servers; their duration and size are known at the time of arrival. There is an infinite supply of identical servers, each having one unit of computational capacity per unit of time. A server can be rented at any time and continues to be rented until all jobs assigned to it finish. The cost of an assignment is the sum of durations of rental periods of all servers. The goal is to assign jobs to servers to minimize the overall cost while satisfying server capacity constraints. We focus on analyzing two natural algorithms, NextFit and FirstFit, for the case of jobs of equal duration. It is known that the competitive ratio of NextFit and FirstFit are at most 3 and 4 respectively for this case. We prove a tight bound of 2 on the competitive ratio of NextFit. For FirstFit, we establish a lower bound of 2.519 on the competitive ratio, even when jobs have only two distinct arrival times. For the case when jobs have arrival times 0 and 1 and duration 2, we show a lower bound of 1.89 and an upper bound of 2 on the strict competitive ratio of FirstFit. Finally, using the weight function technique, we obtain stronger results for the case of uniform servers.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/17/2023

Dynamic Vector Bin Packing for Online Resource Allocation in the Cloud

Several cloud-based applications, such as cloud gaming, rent servers to ...
research
06/08/2021

New Competitive Semi-online Scheduling Algorithms for Small Number of Identical Machines

Design and analysis of constant competitive deterministic semi-online al...
research
08/16/2021

Speed Scaling with Multiple Servers Under A Sum Power Constraint

The problem of scheduling jobs and choosing their respective speeds with...
research
05/01/2022

Scheduling for Multi-Phase Parallelizable Jobs

With multiple identical unit speed servers, the online problem of schedu...
research
10/04/2019

System Stability Under Adversarial Injection of Dependent Tasks

In this work, we consider a computational model of a distributed system ...
research
09/01/2022

Online Demand Scheduling with Failovers

Motivated by cloud computing applications, we study the problem of how t...
research
11/08/2017

Performance of Balanced Fairness in Resource Pools: A Recursive Approach

Understanding the performance of a pool of servers is crucial for proper...

Please sign up or login with your details

Forgot password? Click here to reset