z-logo
open-access-imgOpen Access
ENPP: Extended Non-preemptive PP-aware Scheduling for Real-time Cloud Services
Author(s) -
Fereshteh Hoseini,
Mostafa GhobaeiArani,
Alireza Taghizadeh
Publication year - 2016
Publication title -
international journal of electrical and computer engineering
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.277
H-Index - 22
ISSN - 2088-8708
DOI - 10.11591/ijece.v6i5.pp2291-2299
Subject(s) - computer science , cloud computing , scheduling (production processes) , distributed computing , dynamic priority scheduling , schedule , fair share scheduling , real time computing , mathematical optimization , operating system , mathematics
By increasing the use of cloud services and the number of requests to processing tasks with minimum time and costs, the resource allocation and scheduling, especially in real-time applications become more challenging. The problem of resource scheduling, is one of the most important scheduling problems in the area of NP-hard problems. In this paper, we propose an efficient algorithm is proposed to schedule real-time cloud services by considering the resource constraints. The simulation results show that the proposed algorithm shorten the processing time of tasks and decrease the number of canceled tasks.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here