ENPP: Extended non-preemptive PP-aware scheduling for real-time cloud services

2Citations
Citations of this article
9Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

Hoseini, F., Arani, M. G., & Taghizadeh, A. (2016). ENPP: Extended non-preemptive PP-aware scheduling for real-time cloud services. International Journal of Electrical and Computer Engineering, 6(5), 2291–2299. https://doi.org/10.11591/ijece.v6i5.10640

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free