• Corpus ID: 26454129

Accrual Based Scheduling for Cloud in Single and Multi Resource System: Study of Three Techniques

@article{Santhosh2015AccrualBS,
  title={Accrual Based Scheduling for Cloud in Single and Multi Resource System: Study of Three Techniques},
  author={R. Santhosh and Thiagarajan Ravichandran},
  journal={World Academy of Science, Engineering and Technology, International Journal of Computer, Electrical, Automation, Control and Information Engineering},
  year={2015},
  volume={9},
  pages={848-853}
}
  • R. Santhosh, T. Ravichandran
  • Published 3 October 2015
  • Computer Science
  • World Academy of Science, Engineering and Technology, International Journal of Computer, Electrical, Automation, Control and Information Engineering
This paper evaluates the accrual based scheduling for cloud in single and multi-resource system. Numerous organizations benefit from Cloud computing by hosting their applications. The cloud model provides needed access to computing with potentially unlimited resources. Scheduling is tasks and resources mapping to a certain optimal goal principle. Scheduling, schedules tasks to virtual machines in accordance with adaptable time, in sequence under transaction logic constraints. A good scheduling… 

Figures from this paper

References

SHOWING 1-10 OF 20 REFERENCES
A SURVEY OF VARIOUS SCHEDULING ALGORITHM IN CLOUD COMPUTING ENVIRONMENT
TLDR
In this paper, researchers attempt to build job scheduling algorithms that are compatible and applicable in Cloud Computing environment by studying various scheduling algorithm and issues related to them in cloud computing.
Pre-emptive scheduling of on-line real time services with task migration for cloud computing
  • R. Santhosh, T. Ravichandran
  • Computer Science
    2013 International Conference on Pattern Recognition, Informatics and Mobile Engineering
  • 2013
TLDR
A preemptive online scheduling with task migration algorithm for cloud computing environment is proposed in order to minimize the response time and to improve the efficiency of the tasks.
Migration-Based Elastic Consolidation Scheduling in Cloud Data Center
TLDR
A migration-based elastic consolidation scheduling heuristic to dynamically consolidate the VMs with adaptive resource allocation for reducing the number of physical machines and is able to realize elastic resource allocation with acceptable effect on SLAs.
EBC: Application-level migration on multi-site cloud
  • D. Nguyen, N. Thoai
  • Computer Science
    2012 International Conference on Systems and Informatics (ICSAI2012)
  • 2012
TLDR
The paper introduces the event-based checkpointing tool (EBC), in which users can easily checkpoint and restart running programs in cloud systems, based on event-driven architecture and so it is integrated into cloud infrastructures like OpenNebula easily.
Task Migration with EDF-RM Scheduling Algorithms in Distributed System
  • R. Sharma, Nitin
  • Computer Science
    2012 International Conference on Advances in Computing and Communications
  • 2012
TLDR
This paper explains the processing of task migration with EDF-RM (simultaneously) scheduling algorithm by using Global Scheduling.
Energy Efficient VM Scheduling for Cloud Data Centers: Exact Allocation and Migration Algorithms
TLDR
Experimental results show the benefits of combining the allocation and migration algorithms and demonstrate their ability to achieve significant energy savings while maintaining feasible convergence times when compared with the best fit heuristic.
Evaluating Overheads of Integrated Multilevel Checkpointing Algorithms in Cloud Computing Environment
TLDR
This paper presents a methodology for providing high availability to the demands of cloud's clients by integrating checkpointing feature with load balancing algorithms and making multilevel checkpoint to decrease checkpointing overheads.
Energy aware non-preemptive scheduling for hard real-time systems
TLDR
This work addresses the problem of energy efficient scheduling of nonpreemptive tasks based on the earliest deadline first (EDF) scheduling policy and presents the stack based slowdown algorithm that builds upon the optimal feasibility test for non Preemptive systems.
On the Scheduling of Checkpoints in Desktop Grids
TLDR
This workcrafts a checkpoint scheduling algorithm that is provably optimal for discrete time when failures obey any general probability distribution, and shows that this optimal strategy scales and outperforms other strategies significantly in terms of check pointing costs and batch completion times.
On non-preemptive scheduling of period and sporadic tasks
TLDR
It is proved that the problem of deciding schedulability of a set of concrete periodic tasks is intractable.
...
...