| 한글제목(Korean Title) |
HPC/HC opt-aiNet-based Scheduling |
| 영문제목(English Title) |
HPC/HC opt-aiNet-based Scheduling |
| 저자(Author) |
Arief Zulianto
Kuspriyanto
Yudi S. Gondokaryono
|
| 원문수록처(Citation) |
VOL 11 NO. 01 PP. 0244 ~ 0248 (2019. 06) |
한글내용
(Korean Abstract) |
|
영문내용
(English Abstract) |
Diversity of computing power and interconnections between processing element caused heterogeneity in High Performance Computing (HPC). The heterogeneity in HPC will affect the completion time of each task that has been assigned to the processors. This increases the complexity of scheduling problems, thus the effort to obtain optimal makespan becomes challenging. Scheduling problems in HPC with respect to the heterogeneity, can be solved by applied the opt-aiNet algorithm. Better result achieved compared to scheduling using Heterogeneous Earliest Finish Time (HEFT), which has been popular. In general, scheduling with opt-aiNet yield better makespan than scheduling with HEFT. Best results obtained in this research was 0.37 to 0.99 times shorter than makespan produced by HEFT algorithm, obtained for communication intensive task (high CCR).
|
| 키워드(Keyword) |
HPC
HC
AIS
opt-aiNet
scheduling
makespan
HEFT
|
| 파일첨부 |
PDF 다운로드
|
