Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao SN Computer Sciencearrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
SN Computer Science
Article . 2021 . Peer-reviewed
License: Springer TDM
Data sources: Crossref
https://doi.org/10.23919/date....
Article . 2019 . Peer-reviewed
Data sources: Crossref
DBLP
Conference object . 2022
Data sources: DBLP
DBLP
Article . 2022
Data sources: DBLP
versions View all 4 versions
addClaim

Dynamic Scheduling on Heterogeneous Multicores

Authors: Ruben Vazquez; Ayobami S. Edun; Ann Gordon-Ross; Greg Stitt;

Dynamic Scheduling on Heterogeneous Multicores

Abstract

Heterogeneous multicore systems can help adherence to design goals by providing a diverse set of hardware components to meet application requirements. Each core may also have tunable hardware that can reconfigured for different applications. However, scheduling becomes difficult in the presence of tunable hardware due to the additional constraint that an application must be scheduled to a core that offers the best configuration, based on the application’s requirements, to maximize the benefit of the tunable hardware. The scheduling decision can be made by exploring and evaluating each hardware configuration in the design space exhaustively or through the use of a heuristic to evaluate a subset of the design space. However, exhaustive and heuristic approaches do not scale well with the number of available hardware configurations. To improve upon exhaustive and heuristic approaches, in this paper, we present a dynamic scheduling methodology that uses machine learning to schedule applications to the application’s respective best core for reduced energy consumption for a system with configurable caches. We use an artificial neural network (ANN) to train our predictive model, using hardware counters, to predict the best core and a tuning heuristic to determine best configuration on non-best cores. If the best core is busy, our scheduler considers alternative idle cores, or the application is stalled depending on which decision is energy advantageous. Our experiments show that our proposed system can achieve a total energy savings of approximately 33% and 2.5% compared to a fixed-cache, base system when using a configurable instruction and data cache, respectively, while remaining competitive and exhibiting better scaling properties compared to systems adopting a heuristic approach.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    11
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    Top 10%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    Average
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
11
Top 10%
Average
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!