Affinity-Based Task Scheduling on Heterogeneous Multicore Systems Using CBS and QBICTM

Applied Sciences

Munkhjargal Gochoo¹  Sohaib Iftikhar Abbasi²  Shaharyar Kamal²  Ahmad Jalal²  Kibum Kim³ 

[1] Department of Computer Science and Software Engineering, United Arab Emirates University, Al Ain 15551, United Arab Emirates;Department of Computer Science, Air University, Islamabad 44200, Pakistan;Department of Human-Computer Interaction, Hanyang University, Ansan 15588, Korea;

关键词: affinity-based scheduling;    Bayesian generative model;    high-performance computing;    load balancing;    parallel computing;   

DOI  :  10.3390/app11125740

来源: DOAJ

【 摘 要 】

This work presents the grouping of dependent tasks into a cluster using the Bayesian analysis model to solve the affinity scheduling problem in heterogeneous multicore systems. The non-affinity scheduling of tasks has a negative impact as the overall execution time for the tasks increases. Furthermore, non-affinity-based scheduling also limits the potential for data reuse in the caches so it becomes necessary to bring the same data into the caches multiple times. In heterogeneous multicore systems, it is essential to address the load balancing problem as all cores are operating at varying frequencies. We propose two techniques to solve the load balancing issue, one being designated “chunk-based scheduler” (CBS) which is applied to the heterogeneous systems while the other system is “quantum-based intra-core task migration” (QBICTM) where each task is given a fair and equal chance to run on the fastest core. Results show 30–55% improvement in the average execution time of the tasks by applying our CBS or QBICTM scheduler compare to other traditional schedulers when compared using the same operating system.

【 授权许可】

Unknown