A Method to Construct Task Scheduling Algorithms for Heterogeneous Multi-Core Systems

27Citations
Citations of this article
11Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

The use of heterogeneous multicore processors (HMP) is spreading rapidly from data centers to large-scale deployment in smartphones because they give greater flexibility to adapt to power constraints and performance needs. In this study, we show that an intelligent task scheduler is critical for improving the performance and energy efficiency in an HMP environment. We assume that the tasks are independent in the environment, with hard real-Time constraints and multicore systems, where the processors can be manipulated to change the clock cycle speed and power levels. Tasks are assumed to arrive aperiodically where the tasks are applications from the SPEC CPU 2006 benchmark suite. In the evaluation, we used a real system comprising of two multicore processors, which supported on-The-fly dynamic voltage/frequency scaling. We extracted several important components from previously proposed algorithms and combined them to construct algorithms with better performance. Our results showed that some of the best combinations reduced the energy consumption and achieved a better completion rate in the environment. In addition, a method is proposed for calculating the upper-bound of the task completion rate and energy consumption so that there is a guide as to how near the results are to the optimal performance.

Cite

CITATION STYLE

APA

Kim, S. I., & Kim, J. K. (2019). A Method to Construct Task Scheduling Algorithms for Heterogeneous Multi-Core Systems. IEEE Access, 7, 142640–142651. https://doi.org/10.1109/ACCESS.2019.2944238

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free