%X In this paper, we developed a computing architecture and algorithms for supporting soft real-time task scheduling in a cloud computing environment through the dynamic provisioning of virtual machines. The architecture integrated three modified soft real-time task scheduling algorithms, namely, Earliest Deadline First, Earliest Deadline until Zero-Laxity, and Unfair Semi-Greedy. A deadline look-a-head module was incorporated into each of the algorithms to fire deadline exceptions and avoid the missing deadlines, and to maintain the system criticality. The results of the implementation of the proposed algorithms are presented in this paper in terms of the average deadline exceptions, the extra resources consumed by each algorithm in handling deadline exceptions, and the average response time. The results not only suggest the feasibility of the soft real-time scheduling of periodic real-time tasks in cloud computing but that the process can also be scaled up to handle the near-hard real-time task scheduling. © 2013 IEEE.
%K Cloud computing; Computer architecture; Multitasking; Network security; Real time systems; Virtual machine, Cloud computing environments; Computing architecture; Deadline; Dynamic provisioning; Earliest deadline first; Hard real-time task; Laxity; Real time, Scheduling algorithms
%D 2019
%R 10.1109/ACCESS.2019.2900288
%O cited By 12
%L scholars12189
%J IEEE Access
%T Investigating the schedulability of periodic real-time tasks in virtualized cloud environment
%A H. Alhussian
%A N. Zakaria
%A A. Patel
%A A. Jaradat
%A S.J. Abdulkadir
%A A.Y. Ahmed
%A H.T. Bahbouh
%A S.O. Fageeri
%A A.A. Elsheikh
%A J. Watada
%I Institute of Electrical and Electronics Engineers Inc.
%V 7
%P 29533-29542