Yingchi Mao, Haishing Zhong, Longbao Wang, Xiaofang Li
언어
영어(ENG)
URL
https://www.earticle.net/Article/A297453
※ 원문제공기관과의 협약기간이 종료되어 열람이 제한될 수 있습니다.
원문정보
초록
영어
Cloud computing can provide the dynamic and elastic virtual resources for the users to execute the large-scale computing tasks. It has become the hot spot in the academic and industry fields. Task scheduling is one of the most important issues in the Cloud. In the Cloud systems, the goal of the tasks scheduling is to spread the workload among the computing nodes and maximize the utilization while the total execution time is within the specific delay bound. At present, almost scheduling algorithms focus on the single task dispatch in the Cloud. Unfortunately, there is little research on the associate tasks scheduling considering the deadline bound. In this paper, two hierarchical task models were discussed and the corresponding associated task scheduling algorithms based on delay-bound constraint (ATS-DB and SAH-DB) were proposed. The associated tasks and the task execution order were represented by one directed acyclic graph (DAG). The proposed hierarchical task models can improve the task execution concurrency. Extensive experimental results demonstrated that the proposed scheduling algorithms, ATS-DB and SAH-DB, can reduce the execution cost and improve the resource utilization within the user-expected delay bound.
목차
Abstract 1. Introduction 2. Related Work 2.1. Independent Tasks Scheduling 2.2. Associated Task Scheduling 3. Task Hierarchical Model 3.1. Tasks DAG Model 3.2. Problem Statement 3.3. Example 4. CPM Scheduling Alogrithm 5. ATS-DB Scheduling Algorithm 5.1. Hierarchical Decomposition Method 5.2. Calculation Delay Bound 5.3. Detail of ATS-DB Algorithm 5.4. Example of ATS-DB Scheduling 5.5. Analysis of ATS-DB Algorithm 6. SAH-DB Scheduling Algorithm 6.1. SAH-based Hierarchical Decomposition Method 6.2. Detail of SAH-DB Algorithm 6.3. Example of SAH-DB Scheduling 7. Performance Evaluation 7.1. Experiments Settings & Methodology 7.2. Execution Cost with the Same Deadline 7.3. Optimization Ratio with Different Deadline 8. Conclusion and Future Work References
키워드
Cloud computingdelay boundassociated task schedulinghierarchical graph model
저자
Yingchi Mao [ College of Computer and Information Engineering, Hohai University, Nanjing, China ]
Haishing Zhong [ College of Computer and Information Engineering, Hohai University, Nanjing, China ]
Longbao Wang [ College of Computer and Information Engineering, Hohai University, Nanjing, China ]
Xiaofang Li [ College of Computer and Information Engineering, Changzhou Institute of Technology, Changzhou, China ]
보안공학연구지원센터(IJHIT) [Science & Engineering Research Support Center, Republic of Korea(IJHIT)]
설립연도
2006
분야
공학>컴퓨터학
소개
1. 보안공학에 대한 각종 조사 및 연구
2. 보안공학에 대한 응용기술 연구 및 발표
3. 보안공학에 관한 각종 학술 발표회 및 전시회 개최
4. 보안공학 기술의 상호 협조 및 정보교환
5. 보안공학에 관한 표준화 사업 및 규격의 제정
6. 보안공학에 관한 산학연 협동의 증진
7. 국제적 학술 교류 및 기술 협력
8. 보안공학에 관한 논문지 발간
9. 기타 본 회 목적 달성에 필요한 사업
간행물
간행물명
International Journal of Hybrid Information Technology
간기
격월간
pISSN
1738-9968
수록기간
2008~2016
십진분류
KDC 505DDC 605
이 권호 내 다른 논문 / International Journal of Hybrid Information Technology Vol.9 No.12