Home > Research > Publications & Outputs > E-OSched: a load balancing scheduler for hetero...

Links

Text available via DOI:

View graph of relations

E-OSched: a load balancing scheduler for heterogeneous multicores

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Published

Standard

E-OSched: a load balancing scheduler for heterogeneous multicores. / Khalid, Yasir Noman; Aleem, Muhammad; Prodan, Radu et al.
In: Journal of Supercomputing, Vol. 74, 31.10.2018, p. 5399–5431.

Research output: Contribution to Journal/MagazineJournal articlepeer-review

Harvard

Khalid, YN, Aleem, M, Prodan, R, Iqbal, MA & Islam, MA 2018, 'E-OSched: a load balancing scheduler for heterogeneous multicores', Journal of Supercomputing, vol. 74, pp. 5399–5431. https://doi.org/10.1007/s11227-018-2435-1

APA

Khalid, Y. N., Aleem, M., Prodan, R., Iqbal, M. A., & Islam, M. A. (2018). E-OSched: a load balancing scheduler for heterogeneous multicores. Journal of Supercomputing, 74, 5399–5431. https://doi.org/10.1007/s11227-018-2435-1

Vancouver

Khalid YN, Aleem M, Prodan R, Iqbal MA, Islam MA. E-OSched: a load balancing scheduler for heterogeneous multicores. Journal of Supercomputing. 2018 Oct 31;74:5399–5431. Epub 2018 May 23. doi: 10.1007/s11227-018-2435-1

Author

Khalid, Yasir Noman ; Aleem, Muhammad ; Prodan, Radu et al. / E-OSched: a load balancing scheduler for heterogeneous multicores. In: Journal of Supercomputing. 2018 ; Vol. 74. pp. 5399–5431.

Bibtex

@article{83668a77f08e4d6c806092a77efc0122,
title = "E-OSched: a load balancing scheduler for heterogeneous multicores",
abstract = "The contemporary multicore era has adhered to the heterogeneous computing devices as one of the proficient platforms to execute compute-intensive applications. These heterogeneous devices are based on CPUs and GPUs. OpenCL is deemed as one of the industry standards to program heterogeneous machines. The conventional application scheduling mechanisms allocate most of the applications to GPUs while leaving CPU device underutilized. This underutilization of slower devices (such as CPU) often originates the sub-optimal performance of data-parallel applications in terms of load balance, execution time, and throughput. Moreover, multiple scheduled applications on a heterogeneous system further aggravate the problem of performance inefficiency. This paper is an attempt to evade the aforementioned deficiencies via initiating a novel scheduling strategy named OSched. An enhancement to the OSched named E-OSched is also part of this study. The OSched performs the resource-aware assignment of jobs to both CPUs and GPUs while ensuring a balanced load. The load balancing is achieved via contemplation on computational requirements of jobs and computing potential of a device. The load-balanced execution is beneficiary in terms of lower execution time, higher throughput, and improved utilization. The E-OSched reduces the magnitude of the main memory contention during concurrent job execution phase. The mathematical model of the proposed algorithms is evaluated by comparison of simulation results with different state-of-the-art scheduling heuristics. The results revealed that the proposed E-OSched has performed significantly well than the state-of-the-art scheduling heuristics by obtaining up to 8.09% improved execution time and up to 7.07% better throughput.",
keywords = "Scheduling, Data-parallel applications, Heterogeneous multicores, Load balancing",
author = "Khalid, {Yasir Noman} and Muhammad Aleem and Radu Prodan and Iqbal, {Muhammad Azhar} and Islam, {Muhammad Arshad}",
year = "2018",
month = oct,
day = "31",
doi = "10.1007/s11227-018-2435-1",
language = "English",
volume = "74",
pages = "5399–5431",
journal = "Journal of Supercomputing",
issn = "0920-8542",
publisher = "Springer Netherlands",

}

RIS

TY - JOUR

T1 - E-OSched: a load balancing scheduler for heterogeneous multicores

AU - Khalid, Yasir Noman

AU - Aleem, Muhammad

AU - Prodan, Radu

AU - Iqbal, Muhammad Azhar

AU - Islam, Muhammad Arshad

PY - 2018/10/31

Y1 - 2018/10/31

N2 - The contemporary multicore era has adhered to the heterogeneous computing devices as one of the proficient platforms to execute compute-intensive applications. These heterogeneous devices are based on CPUs and GPUs. OpenCL is deemed as one of the industry standards to program heterogeneous machines. The conventional application scheduling mechanisms allocate most of the applications to GPUs while leaving CPU device underutilized. This underutilization of slower devices (such as CPU) often originates the sub-optimal performance of data-parallel applications in terms of load balance, execution time, and throughput. Moreover, multiple scheduled applications on a heterogeneous system further aggravate the problem of performance inefficiency. This paper is an attempt to evade the aforementioned deficiencies via initiating a novel scheduling strategy named OSched. An enhancement to the OSched named E-OSched is also part of this study. The OSched performs the resource-aware assignment of jobs to both CPUs and GPUs while ensuring a balanced load. The load balancing is achieved via contemplation on computational requirements of jobs and computing potential of a device. The load-balanced execution is beneficiary in terms of lower execution time, higher throughput, and improved utilization. The E-OSched reduces the magnitude of the main memory contention during concurrent job execution phase. The mathematical model of the proposed algorithms is evaluated by comparison of simulation results with different state-of-the-art scheduling heuristics. The results revealed that the proposed E-OSched has performed significantly well than the state-of-the-art scheduling heuristics by obtaining up to 8.09% improved execution time and up to 7.07% better throughput.

AB - The contemporary multicore era has adhered to the heterogeneous computing devices as one of the proficient platforms to execute compute-intensive applications. These heterogeneous devices are based on CPUs and GPUs. OpenCL is deemed as one of the industry standards to program heterogeneous machines. The conventional application scheduling mechanisms allocate most of the applications to GPUs while leaving CPU device underutilized. This underutilization of slower devices (such as CPU) often originates the sub-optimal performance of data-parallel applications in terms of load balance, execution time, and throughput. Moreover, multiple scheduled applications on a heterogeneous system further aggravate the problem of performance inefficiency. This paper is an attempt to evade the aforementioned deficiencies via initiating a novel scheduling strategy named OSched. An enhancement to the OSched named E-OSched is also part of this study. The OSched performs the resource-aware assignment of jobs to both CPUs and GPUs while ensuring a balanced load. The load balancing is achieved via contemplation on computational requirements of jobs and computing potential of a device. The load-balanced execution is beneficiary in terms of lower execution time, higher throughput, and improved utilization. The E-OSched reduces the magnitude of the main memory contention during concurrent job execution phase. The mathematical model of the proposed algorithms is evaluated by comparison of simulation results with different state-of-the-art scheduling heuristics. The results revealed that the proposed E-OSched has performed significantly well than the state-of-the-art scheduling heuristics by obtaining up to 8.09% improved execution time and up to 7.07% better throughput.

KW - Scheduling

KW - Data-parallel applications

KW - Heterogeneous multicores

KW - Load balancing

U2 - 10.1007/s11227-018-2435-1

DO - 10.1007/s11227-018-2435-1

M3 - Journal article

VL - 74

SP - 5399

EP - 5431

JO - Journal of Supercomputing

JF - Journal of Supercomputing

SN - 0920-8542

ER -