Fairness-aware scheduling on single-ISA heterogeneous multi-cores

Luo, Tian; Ma, Siyuan; Lee, Rubao; Zhang, Xiaodong; Deng, Ling; Zhou, Li

doi:10.1109/pact.2013.6618808

Cited by 8 publications

(7 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Existing scheduling algorithms use the prediction model of thread performance and energy consumption to estimate the core sensitivity of threads, and then threads are schedule based on the core sensitivity of threads. Thread scheduling algorithms proposed by Saez, 8 Craeynest, 9 and Jibaja 15 dynamically collect thread runtime information first. And a core sensitivity analysis model is then adopted to estimate the core sensitivity of threads.…”

Section: Related Workmentioning

confidence: 99%

“…Simply ensuring that each thread runs for an equal amount of time is not enough to achieve fair scheduling. 9 Therefore, scheduling algorithms need to ensure the fairness of scheduling based on the differences in computing power of cores and other critical scheduling factors.…”

Section: Critical Scheduling Factorsmentioning

confidence: 99%

“…For example, some existing thread scheduling algorithms for HMP perform thread scheduling based on core sensitivity of threads. [8][9][10] Scheduling algorithms based on core sensitivity of threads can directly schedule threads in the system to the cores they run fastest on. Existing scheduling algorithms use the prediction model of thread performance and energy consumption to estimate the core sensitivity of threads, and then threads are schedule based on the core sensitivity of threads.…”

Section: Related Workmentioning

confidence: 99%

“…This algorithm balances the load of cores according to the computing power of cores. Craeynest et al 9 proposed a scheduler based on progress synchronization. A performance model is used to predict the performance of threads when they are executed by each type of cores and calculate the execution progress of each thread.…”

Section: Related Workmentioning

confidence: 99%

“…7 Existing scheduling algorithms are often based on single scheduling critical factor and cannot perform thread scheduling according to multiple critical scheduling factors. [8][9][10][11][12][13][14] Moreover, there are some shortcomings in the existing scheduling algorithms. For example, the scheduling algorithm proposed by Jibaja 15 only controls the core allocation operation and does not control the selection of threads, which leads to poor scheduling flexibility.…”

mentioning

confidence: 99%

See 4 more Smart Citations

A scheduling algorithm based on critical factors for heterogeneous multicore processors

Li,

Lin,

Tian

et al. 2023

Concurrency and Computation

View full text Add to dashboard Cite

SummaryAs the development of chip manufacturing technology slows down, high‐performance processors often have high energy consumption and high heat generation. Therefore, heterogeneous multi‐core processors become more and more popular, and the heterogeneous multi‐core processors is adopted to execute programs. At present, the general program consists of multiple threads. To reach goals of accelerating program execution and reducing energy consumption and heat generation of system, a suitable thread scheduling algorithm for heterogeneous multi‐core processors is needed. In this article, a thread scheduling algorithm based on multiple critical scheduling factors is proposed. First, a prediction model of thread performance and energy consumption is used to predict the core sensitivity of threads. Then, critical threads are judged and accelerated by collecting the synchronization information between threads. Finally, the load balancing method based on the computing power of cores and the core sensitivity of threads is employed to perform system load balancing, which ensures the fairness of the scheduling. Several experiments are provided, and the results show that the proposed algorithm can obtain better performance of thread schedule.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Critical Scheduling Factorsmentioning

confidence: 99%