http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.
변환된 중국어를 복사하여 사용하시면 됩니다.
HPC/HC opt-aiNet-based Scheduling
Arief Zulianto,Kuspriyanto,Yudi S. Gondokaryono 한국정보통신학회 2019 2016 INTERNATIONAL CONFERENCE Vol.11 No.1
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).