Paper Title : Investigating the Schedulability of PeriodicReal-Time Tasks in Virtualized Cloud Environment
ISSN : 2394-2231
Year of Publication : 2021
MLA Style: R.NAVIN KUMAR MCA., M.Phil., B.NEELAMPARI " Investigating the Schedulability of PeriodicReal-Time Tasks in Virtualized Cloud Environment " Volume 8 - Issue 2 March-April , 2021 International Journal of Computer Techniques (IJCT) ,ISSN:2394-2231 , www.ijctjournal.org
APA Style: R.NAVIN KUMAR MCA., M.Phil., B.NEELAMPARI " Investigating the Schedulability of PeriodicReal-Time Tasks in Virtualized Cloud Environment " Volume 8 - Issue 2 March-April , 2021 International Journal of Computer Techniques (IJCT) ,ISSN:2394-2231 , www.ijctjournal.org
In this paper, we developed a computing architecture and algorithms for supporting soft real-time task scheduling during 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-ahead 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 during this paper in terms of the typical deadline exceptions, the additional resources consumed by each algorithm in handling deadline exceptions, and therefore the average reaction 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 method can also be scaled up to handle the near-hard real-time task scheduling.
 A. Burns and A. J. Wellings, Real-Time Systems and Program- ming Languages, 4th ed. Toronto, ON, Canada: Pearson Education, 2009.  G. C. Buttazzo, Hard Real-Time Computing Systems: Predictable Schedul- ing Algorithms and Applications, vol. 24, 3rd ed. New York, NY, USA: Springer, 2013.  J. W. S. Liu, Real-Time Systems, 1st ed. Upper Saddle River, NJ, USA: Prentice-Hall, 2000.  R. Mall, Real-Time Systems: Theory and Practice. London, U.K.: Pearson, 2009.  H. Kopetz, Real-Time Systems, 2nd ed. New York, NY, USA: Springer, 2013.  J. A. Stankovic and K. Ramamritham, ‘‘What is predictability for realtime systems?’’ Real-Time Syst., vol. 2, no. 4, pp. 247–254, 1990.  I. Lee, J. Y. Leung, and S. H. Son, Handbook of Real-time and Embedded Systems. Boca Raton, FL, USA: CRC Press, 2007.  P. Regnier, G. Lima, E. Massa, G. Levin, and S. Brandt, ‘‘Multiprocessor scheduling by reduction to uniprocessor: an ingenious optimal approach,’’ Real-Time Syst., vol. 49, no. 4, pp. 436–474, 2013.  G. Nelissen, V. Berten, V. Nélis, J. Goossens, and D. Milojevic, ‘‘UEDF: An unfair but optimal multiprocessor scheduling algorithm for sporadic tasks,’’ in Proc. 24th Euromicro Conf. Real-Time Syst. (ECRTS), Pisa, Italy, Jul. 2012, pp. 13–23.  G. Levin, S. Funk, C. Sadowski, I. Pye, and S. Brandt, ‘‘DP-FAIR: an easy model for understanding optimal multiprocessor scheduling,’’ in Proc. 22nd Euromicro Conf. Real-Time Syst. (ECRTS), Jul. 2010, pp. 3–13.  S. Funk and V. Nanadur, ‘‘LRE-TL: An optimal multiprocessor scheduling algorithm for sporadic task sets,’’ in Proc. 17th Int. Conf. Real-Time Netw. Syst., 2009, pp. 159–168.  B. Andersson and E. Tovar, ‘‘Multiprocessor scheduling with few preemptions,’’ in Proc. 12th IEEE Int. Conf. Embedded Real-Time Comput. Syst. Appl., Aug. 2006, pp. 322–334.
—— Real-time, cloud computing, virtual machine, deadline, laxity