International Journal of Distributed and Cloud Computing

Open Access Open Access  Restricted Access Subscription Access
Open Access Open Access Open Access  Restricted Access Restricted Access Subscription Access

A Priority Constrained Pre-emptive Scheduling of Online Real Time Services with Fixed Checkpoint Intervals for Cloud Computing


Affiliations
1 Department of Computer Science and Engineering, Karpagam University, Coimbatore, Tamil Nadu., India
2 Hindusthan Institute of Technology, Coimbatore, Tamil Nadu., India
     

   Subscribe/Renew Journal


In cloud computing, various services are accessed by the different types of clients as pay per use over the internet. This paper presents a new scheduling technique for real time tasks in order to minimize the execution time and focuses on the priority constrained tasks. In older approaches, a non-preemptive scheduling with task migration algorithm is used to schedule the task with highest expected gain and executes the tasks in the queue in a non-preemptive manner. Therefore it increases the execution time of the task and response time of the priority constrained tasks. In order to overcome this problem, a priority constrained pre-emptive scheduling of online real time services with fixed checkpoint intervals is proposed to minimize the execution time of the tasks and improves the overall system performance by giving importance for higher priority tasks. Our simulation results outperform the traditional scheduling algorithms based on the similar model.

Keywords

Execution Time, Priority, Deadline, Preemptive, Checkpoint Intervals
Subscription Login to verify subscription
User
Notifications
Font Size


  • Weiss, A. (2007). Computing in the clouds. Networker, 11(4), 16–25.

  • Singh, D., Singh, J. & Chhabra, A. (2012). Evaluating Overheads of Integrated Multilevel Checkpointing Algorithms in Cloud Computing Environment. International Journal of Computer Network and Information Security, 5(1), 29-38. Published Online June 2012 in MECS (http://www.mecs-press.org/) DOI: 10.5815/ijcnis (2012.05.04).

  • Burford, D. (2010). Cloud Computing- A Brief Introduction. LAD Enterprizes, Inc.

  • Armbrust, M., Fox, A., Griffith, R., Joseph, A. D., Katz, R., Konwinski, A., Lee, G., Patterson, D., Rabkin, A., Stoica, I. & Zaharia, M. (2005). Above the Clouds: A Berkeley View of Cloud Computing. UC Berkeley Technical Report UCB/EECS-2009-28, February 2009.

  • Shastry, P. M. M. & Venkatesh, K. (2010). Selection of a Checkpoint Interval in Coordinated Checkpointing Protocol for Fault Tolerant Open MPI. International Journal on Computer Science and Engineering, 2(6), 2064-2070.

  • Chtepen, M., Claeys, F. H. A., Dhoedt, B., Turck, F. D. & Demeester, P. (2009). Adaptive Task Checkpointing And Replication: Toward Efficient Fault-Tolerant Grids. IEEE Transactions on Parallel and Distributed Systems, February, 20(2), 180-190.

  • Paul, M. & Sanyal, G. (2011). Task-Scheduling in Cloud Computing using Credit Based Assignment Problem. International Journal on Computer Science and Engineering, October, 3(10), 3427-3431.

  • Paul, M., Samanta, D. & Sanyal, G. (2011). Dynamic job scheduling in cloud computing based on horizontal load balancing. International Journal of Computer Technology and Application, 2(5), 1552-1556.

  • Santhosh, R. & Ravichandran, T. (2012). Non-preemptive on-line scheduling of real-time services with task migration for cloud momputing. European Journal of Scientific Research, October, 89(1), 163-169.

  • Santhosh, R. & Ravichandran, T. (2013). Pre-emptive Scheduling of On-line Real Time Services With Task Migration for Cloud Computing. International Conference on Pattern Recognition, Informatics and Mobile Engineering.

  • Tayal, S. (2011). Tasks scheduling optimization for the cloud computing system. International Journal of Advanced Engineering Sciences and Technologies, 5(2), 111-115.

  • Rao, S., Rao, N. & Kumari, K. (2005-2009). Cloud computing: An overview. Journal of Theoretical and Applied Information Technology, 71-76.

  • Suen, T. T. Y. & Wong, J. S. K. (1992). Efficient task migration algorithm for distributed systems. IEEE Transactions on Parallel and Distributed Systems, July, 3(4), 488-499.

  • Paindaveine, Y. & Malojicic, D. S. (1996). Process vs Task Migration. Twenty Ninth Hawaii International Conference, (Vol. 1, pp. 636-645).


Abstract Views: 804

PDF Views: 4




  • A Priority Constrained Pre-emptive Scheduling of Online Real Time Services with Fixed Checkpoint Intervals for Cloud Computing

Abstract Views: 804  |  PDF Views: 4

Authors

R. Santhosh
Department of Computer Science and Engineering, Karpagam University, Coimbatore, Tamil Nadu., India
T. Ravichandran
Hindusthan Institute of Technology, Coimbatore, Tamil Nadu., India

Abstract


In cloud computing, various services are accessed by the different types of clients as pay per use over the internet. This paper presents a new scheduling technique for real time tasks in order to minimize the execution time and focuses on the priority constrained tasks. In older approaches, a non-preemptive scheduling with task migration algorithm is used to schedule the task with highest expected gain and executes the tasks in the queue in a non-preemptive manner. Therefore it increases the execution time of the task and response time of the priority constrained tasks. In order to overcome this problem, a priority constrained pre-emptive scheduling of online real time services with fixed checkpoint intervals is proposed to minimize the execution time of the tasks and improves the overall system performance by giving importance for higher priority tasks. Our simulation results outperform the traditional scheduling algorithms based on the similar model.

Keywords


Execution Time, Priority, Deadline, Preemptive, Checkpoint Intervals

References