Scheduling algorithm for user requirements on cloud computing base on deadline and budget constraints

Authors

  • Nguyen Hoang Ha Hue University of Sciences, Vietnam
  • Nguyễn Thanh Bình Hue University of Sciences, Vietnam

DOI:

https://doi.org/10.15625/1813-9663/31/3/5296

Keywords:

Admission control, scheduling algorithms, constraint QoS, resource allocation

Abstract

 

The goal of the SaaS provider is the most  profitable; the user's goal is to meet requirements as quickly as possible but still within budget and deadline. In this paper, a heuristic ACO (Ant Colony Optimization) is used to propose an algorithm to admission control, then building a scheduling algorithm based on the overlapping time between requests. The goal of both algorithms is to minimize the total execution time of the system, satisfying QoS constraints for all requirements and provide the greatest returned profit for SaaS providers. These two algorithms are set up and run a complete test on CloudSim, the experimental results are compared with sequential and EDF (Earliest Deadline First)  algorithms.

Metrics

Metrics Loading ...

Downloads

Published

2015-09-14

How to Cite

[1]
N. H. Ha and N. T. Bình, “Scheduling algorithm for user requirements on cloud computing base on deadline and budget constraints”, JCC, vol. 31, no. 3, p. 231, Sep. 2015.

Issue

Section

Computer Science

Most read articles by the same author(s)