원문정보
보안공학연구지원센터(IJHIT)
International Journal of Hybrid Information Technology
Vol.8 No.6
2015.06
pp.145-152
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Cloud computing is a computing paradigm where applications, resources and services are provided over the internet. Software and hardware can be used to pay as service basis, without buying them. The key role of scheduling is to manage different tasks in different cloud environment. Cloud computing service providers use the available resources efficiently to achieve maximum profit. This makes task scheduling as a challenging issue for cloud service providers. This paper gives an introduction about cloud computing, various existing scheduling algorithms in different task scheduling environments, existing problem and the future suggestions in existing algorithms.
목차
Abstract
1. Introduction
2. User Level Scheduling Algorithms
2.1 IVQ (Intelligent Approach for VM and QoS Provisioning) [4]
2.2 Novel Scheduling Heuristic based on SLA [5]
2.3 LBIMM (Load Balance Improved Min-Min Scheduling ), Pa-Lbimm(User Priority Aware Load Balance Improved Min-Min Scheduling) [6]
2.4 CPROVISION [8]
3. Dynamic Level Scheduling Algorithms
3.1 TQS (Tri Queue Job Scheduling Algorithm) [11]
3.2 DGS (Dynamically Allocating VMs and Distributing Tasks by Greed strategy)[12]
3.3 OFDT’s (An Optimally Fair Dynamic Task Scheduling Algorithm) [13]
4. Workflow Level Scheduling Algorithms
4.1 HEFT (Heterogeneous Earlier Finish Time) [14]
4.2 CSO(Cat Swarm Optimization) [15]
4.3 Critical Greedy Algorithm [16]
5. Real Time Scheduling Algorithms
5.1 Multiobjective Particle Swarm Optimization [17]
5.2 ECMM( Max-Min Task Scheduling Algorithm For Elastic Cloud) [18]
6. Conclusion
Acknowledgment
References
1. Introduction
2. User Level Scheduling Algorithms
2.1 IVQ (Intelligent Approach for VM and QoS Provisioning) [4]
2.2 Novel Scheduling Heuristic based on SLA [5]
2.3 LBIMM (Load Balance Improved Min-Min Scheduling ), Pa-Lbimm(User Priority Aware Load Balance Improved Min-Min Scheduling) [6]
2.4 CPROVISION [8]
3. Dynamic Level Scheduling Algorithms
3.1 TQS (Tri Queue Job Scheduling Algorithm) [11]
3.2 DGS (Dynamically Allocating VMs and Distributing Tasks by Greed strategy)[12]
3.3 OFDT’s (An Optimally Fair Dynamic Task Scheduling Algorithm) [13]
4. Workflow Level Scheduling Algorithms
4.1 HEFT (Heterogeneous Earlier Finish Time) [14]
4.2 CSO(Cat Swarm Optimization) [15]
4.3 Critical Greedy Algorithm [16]
5. Real Time Scheduling Algorithms
5.1 Multiobjective Particle Swarm Optimization [17]
5.2 ECMM( Max-Min Task Scheduling Algorithm For Elastic Cloud) [18]
6. Conclusion
Acknowledgment
References
키워드
저자정보
참고문헌
자료제공 : 네이버학술정보