CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Non- Preemptive Real Time Scheduling using Checkpointing Algorithm for Cloud Computing

by R. Santhosh, T. Ravichandran
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 80 - Number 9
Year of Publication: 2013
Authors: R. Santhosh, T. Ravichandran
10.5120/13886-1796

R. Santhosh, T. Ravichandran . Non- Preemptive Real Time Scheduling using Checkpointing Algorithm for Cloud Computing. International Journal of Computer Applications. 80, 9 ( October 2013), 1-4. DOI=10.5120/13886-1796

@article{ 10.5120/13886-1796,
author = { R. Santhosh, T. Ravichandran },
title = { Non- Preemptive Real Time Scheduling using Checkpointing Algorithm for Cloud Computing },
journal = { International Journal of Computer Applications },
issue_date = { October 2013 },
volume = { 80 },
number = { 9 },
month = { October },
year = { 2013 },
issn = { 0975-8887 },
pages = { 1-4 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume80/number9/13886-1796/ },
doi = { 10.5120/13886-1796 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T21:54:36.050181+05:30
%A R. Santhosh
%A T. Ravichandran
%T Non- Preemptive Real Time Scheduling using Checkpointing Algorithm for Cloud Computing
%J International Journal of Computer Applications
%@ 0975-8887
%V 80
%N 9
%P 1-4
%D 2013
%I Foundation of Computer Science (FCS), NY, USA
Abstract

This paper focuses on providing a solution for online real time services using non-preemptive scheduling algorithm in order to minimize the execution time of the migrated tasks. Earlier, a non-preemptive scheduling with task migration algorithm is used to minimize the penalty. Whenever a task misses its deadline, it will migrate the task to another virtual machine and starts its execution from the beginning. Therefore it increases the execution time of the migrated task. In order to overcome this problem, a non-preemptive real time scheduling using checkpointing algorithm is proposed to minimize the execution time of the migrated tasks and minimizes the penalty even better by earlier completion of migrated tasks. This improves the overall system performance. Our simulation results outperform the older approaches based on the similar model.

References
  1. A. Weiss (2007). Computing in the clouds, Networker, 11(4):16–25.
  2. C. D. Locke (1986). Best-effort decision making for real-time scheduling, PhD thesis, Carnegie Mellon University.
  3. Dilbag Singh, Jaswinder Singh, AmitChhabra," Evaluating Overheads of Integrated Multilevel Checkpointing Algorithms in Cloud Computing Environment", I. J. Computer Network and Information Security, 2012, 5, 29-38 Published Online June 2012 in MECS (http://www. mecs-press. org/)DOI:10. 5815 /ijcnis. 2012. 05. 04.
  4. E. D. Jensen, C. D. Locke, and H. Toluca (1985). , A time-driven scheduling model for real-time systems, In IEEE Real-Time Systems Symposium.
  5. E. Knorr and G. Gruman (2010). , What cloud computing really means, http://www. infoworld. com.
  6. F. Casati and M. Shan (2001). , Definition, execution, analysis and optimization of composite e-service, IEEE Data Engineering.
  7. H. Wu (2005). , Energy-Efficient utility Accrual Real-Time Scheduling, PhD thesis, Virginia Polytechnic Institute and State University.
  8. H. Wu, U. Balli, B. Ravindran, and E. Jensen (2005). , Utility accrual real-time scheduling under variable cost functions, Pages 213–219.
  9. H. Wu, B. Ravindran, and E. Jensen (2004). , On the joint utility accrual model, pages 124.
  10. H. Wu, B. Ravindran, and E. D. Jensen (2004). , Utility accrual scheduling under joint utility and resource constraints, Pages 307.
  11. H. Kuno (2000). , Surveying the e-services technical landscape, In 2nd International Workshop on Advanced Issues of Ecommerce and Web-based Information Systems.
  12. H. Wu, B. Ravindran, and E. D. Jensen (2010). , Energy-efficient, utility accrual real-time scheduling under the unimodal arbitrary arrival model, In ACM Design, Automation, and Test in Europe.
  13. Idawaty Ahmad, S. Shamala, M. Othman† and Muhammad Fauzan Othman (2008). A Preemptive Utility Accrual Scheduling Algorithm for Adaptive Real Time System, IJCSNS International Journal of Computer Science and Network Security, VOL. 8 No. 5.
  14. MallikarjunaShastry P. M. ,K. Venkatesh," Selection of a Checkpoint Interval in Coordinated Checkpointing Protocol for Fault Tolerant Open MPI," (IJCSE) International Journal on Computer Science and Engineering Vol. 02, No. 06, 2010, 2064-2070.
  15. Maria Chtepen, Filip H. A. Claeys, Bart Dhoedt, Filip De Turck, Piet Demeester," Adaptive Task Checkpointing And Replication: Toward Efficient Fault-Tolerant Grids", IEEE Transactions On Parallel And Distributed Systems, Vol. 20, No. 2, February 2009.
  16. Mehdi Kargahi, Ali Movaghar (2006). ,A method for performance analysis of Earliest Deadline First Scheduling policy, The Journal of Supercomputing, 37, 197–222, 2006.
  17. M. Armbrust, A. Fox, R. Griffith, A. D. Joseph, R. Katz, A. Konwinski, G. Lee, D. Patterson, A. Rabkin, I. Stoica, and M. Zaharia (2009), Above the clouds: A Berkeley view of cloud computing,UC Berkeley.
  18. P. Li (2004). , Utility Accrual Real-Time Scheduling: Models and Algorithms, PhD thesis, Virginia Polytechnic Institute and State University.
  19. P. Li, H. Wu, B. Ravindran, and E. Jensen (2006). , A utility accrual scheduling algorithm for real-time activities with mutual exclusion resource constraints, Computers, IEEE Transactions on, 55(4):454–469.
  20. R. K. Clark (1990). , Scheduling dependent real-time activities PhD thesis, Carnegie Mellon University.
  21. R. Santhosh, T. Ravichandran, "Non-Pre-emptive On-Line Scheduling of Real-Time Services with Task Migration for Cloud Computing", European Journal of Scientific Research ISSN 1450-216X Vol. 89 No 1 October, 2012, pp. 163-169.
  22. R. Santhosh, T. Ravichandran," Pre-emptive Scheduling of On-line Real Time Services With Task Migration for Cloud Computing," International Conference on Pattern Recognition, Informatics and Mobile Engineering (PRIME) , 978-1-4673-5845-3/13,February 21-22 2013.
  23. ShouLiu , Gang Quan, ShangpingRen (2010). ,On-line Scheduling of real time services for cloud computing, In IEEE World congress on services.
  24. Y. Bartal, S. Leonardi, A. Marchetti-Spaccamela, J. S. gall, and L. Stougie (1996). , Multiprocessor scheduling with rejection, In Proceedings of SODA, pages 95 – 103.
  25. Y. Yu, S. Ren, N. Chen, and X. Wang (2010). ,Profit and penalty aware (pp-aware) scheduling for tasks with variable task execution time. , In SAC2010 - Track on Real-Time System (RTS'2010).
Index Terms

Computer Science
Information Sciences

Keywords

Non-preemptive Migration checkpoint Potential profit Potential loss Deadline Virtual machine Vital point.

Powered by PhDFocusTM