메뉴 건너뛰기
.. 내서재 .. 알림
소속 기관/학교 인증
인증하면 논문, 학술자료 등을  무료로 열람할 수 있어요.
한국대학교, 누리자동차, 시립도서관 등 나의 기관을 확인해보세요
(국내 대학 90% 이상 구독 중)
로그인 회원가입 고객센터 ENG
주제분류

추천
검색
질문

논문 기본 정보

자료유형
학술저널
저자정보
Hongtao Wang (Jilin Technology College of Electronic Information)
저널정보
대한전자공학회 IEIE Transactions on Smart Processing & Computing IEIE Transactions on Smart Processing & Computing Vol.13 No.3
발행연도
2024.6
수록면
243 - 253 (11page)
DOI
10.5573/IEIESPC.2024.13.3.243

이용수

표지
📌
연구주제
📖
연구배경
🔬
연구방법
🏆
연구결과
AI에게 요청하기
추천
검색
질문

초록· 키워드

오류제보하기
With the continuous development of internet information technology, cloud-computing task-scheduling platform technology is gradually maturing. Cloud computing is profoundly changing every aspect of people’s lives and providing many conveniences. With the application of cloud computing in more fields, more extensive applications and efficient task scheduling algorithms have become increasingly important. This research focuses on the problem of taskscheduling methods for cloud computing platforms in customer-oriented online training systems. Based on the optimization of the ant colony algorithm, an ant colony optimization (ACO) cloudcomputing task-scheduling algorithm is proposed. The research results indicate that when the number of tasks is 300, the makespan value of the optimized ant colony cloud scheduling algorithm (OACC) is 340, that of the discrete firefly algorithm (DFA) is 350, that of multi-objective differential evolution (MODE) is 380, and that of improved group search optimization (IGSO) is 409. The overall performance of OACC was 20.3% higher than that of IGSO. OACC maintained a low and stable degree of imbalance (DI) in different task count tests. At a task volume of 300, the overall utility evaluation of the ACO cloud-computing task-scheduling algorithm was 146, which is 31.5% higher than ACO, 18.7% higher than TACO, and 8.1% higher than LB-AACO. The experimental results meet expectations and indicate that the OACC cloud-computing taskscheduling algorithm proposed in the study has high task-processing ability and efficiency and is capable of scheduling tasks on cloud computing platforms for customer-oriented online training systems.

목차

Abstract
1. Introduction
2. Related Work
3. Task Scheduling Method based on Ant Colony Algorithm
4. Experiment and Analysis
5. Conclusion
References

참고문헌 (19)

참고문헌 신청

함께 읽어보면 좋을 논문

논문 유사도에 따라 DBpia 가 추천하는 논문입니다. 함께 보면 좋을 연관 논문을 확인해보세요!

최근 본 자료

전체보기

댓글(0)

0

UCI(KEPA) : I410-ECN-151-24-02-090061657