Energy-aware scheduling of malleable fork-join tasks under a deadline constraint on heterogeneous multicores

Nishikawa, Hiroki; Shimada, Kana; Taniguchi, Ittetsu; Tomiyama, Hiroyuki

doi:10.1145/3373400.3373409

Cited by 6 publications

(3 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Many of these applications are broadly used in scientific and engineering domains, and constitute the dominant application type in many parallel benchmark suites extensively used for performance evaluation on symmetric and asymmetric multicore systems 7,11,14‐19 . Some of our insights on effective OS‐runtime interaction techniques could be leveraged for other types of programs, such as the increasingly popular task‐based parallel applications, where runtime scheduling has also drawn special attention 10,20‐22 …”

Section: Introductionmentioning

confidence: 99%

“…7,11,[14][15][16][17][18][19] Some of our insights on effective OS-runtime interaction techniques could be leveraged for other types of programs, such as the increasingly popular task-based parallel applications, where runtime scheduling has also drawn special attention. 10,[20][21][22] Previous research has demonstrated that the runtime system and the OS scheduler can perform optimizations on AMPs by leveraging hardware features that are directly controlled by the OS kernel and exposed to user space, such as performance monitoring counters (PMCs) 4,12,23 or dynamic voltage and frequency scaling (DVFS). 24,25 Often, the support to conveniently access new scheduling-relevant hardware features from the system software may take time to be adopted in operating systems, 4 or it may come in the form of architecture-specific interfaces that limit application portability or make its utilization impossible from particular levels of the software stack.…”

mentioning

confidence: 99%

See 1 more Smart Citation

Flexible system software scheduling for asymmetric multicore systems with PMCSched: A case for Intel Alder Lake

Bilbao

Sáez

Prieto-Matías

2023

Concurrency and Computation

View full text Add to dashboard Cite

SummaryAsymmetric multicore processors (AMPs) couple high‐performance big cores and power‐efficient small ones, all exposing a shared instruction set architecture to software, but with different microarchitectural features. The energy efficiency benefits of AMPs, together with the general‐purpose nature of the various cores, have led hardware manufacturers to build commercial AMP‐based products, first for the mobile and embedded domains, and more recently, for the desktop market segment, as with the Intel Alder Lake processor family. This trend indicates that AMPs may become a solid and more energy efficient replacement for symmetric multicores in a wide range of application domains. Previous research has demonstrated that the system software can substantially improve scheduling—critical to get the most out of heterogeneous cores—by leveraging hardware facilities that are directly managed by the OS, such as performance monitoring counters, or the recently introduced Intel Thread Director technology. Unfortunately, the OS‐level support enabling access to these hardware facilities may often take a long time to be adopted in operating systems, or may come in forms that make its utilization challenging from specific levels of the system software stack, especially in production systems. To fill this gap, we propose PMCSched, an open‐source framework enabling rapid development and evaluation of custom scheduling‐related support in the Linux kernel. PMCSched greatly simplifies the design and implementation of a wide range of scheduling policies for multicore systems that operate at different system software layers without requiring to patch the kernel. To demonstrate the potential of our framework, we conduct a set of experimental case studies on asymmetry‐aware scheduling for Intel Alder Lake processors.

show abstract

Section: Introductionmentioning

confidence: 99%

mentioning

confidence: 99%

Flexible system software scheduling for asymmetric multicore systems with PMCSched: A case for Intel Alder Lake

Bilbao

Sáez

Prieto-Matías

2023

Concurrency and Computation

View full text Add to dashboard Cite

show abstract

“…We should highlight that the OpenMP specification [36] also provides extensions for the creation of task-based parallel applications. Despite the fact that many legacy parallel programs do not exploit task parallelism, there already exists a large body of work that pursues the efficient execution of task-based parallel applications on asymmetric multicores [8,12,13,35,45].…”

Section: Introductionmentioning

confidence: 99%

Enabling performance portability of data-parallel OpenMP applications on asymmetric multicore processors

Sáez

Castro

Prieto-Matías

2020

49th International Conference on Parallel Processing - ICPP

View full text Add to dashboard Cite

Asymmetric multicore processors (AMPs) couple high-performance big cores and low-power small cores with the same instruction-set architecture but different features, such as clock frequency or microarchitecture. Previous work has shown that asymmetric designs may deliver higher energy efficiency than symmetric multicores for diverse workloads. Despite their benefits, AMPs pose significant challenges to runtime systems of parallel programming models. While previous work has mainly explored how to efficiently execute task-based parallel applications on AMPs, via enhancements in the runtime system, improving the performance of unmodified data-parallel applications on these architectures is still a big challenge. In this work we analyze the particular case of loop-based OpenMP applications, which are widely used today in scientific and engineering domains, and constitute the dominant application type in many parallel benchmark suites used for performance evaluation on multicore systems. We observed that conventional loop-scheduling OpenMP approaches are unable to efficiently cope with the load imbalance that naturally stems from the different performance delivered by big and small cores.To address this shortcoming, we propose Asymmetric Iteration Distribution (AID), a set of novel loop-scheduling methods for AMPs that distribute iterations unevenly across worker threads to efficiently deal with performance asymmetry. We implemented AID in libgomp -the GNU OpenMP runtime system-, and evaluated it on two different asymmetric multicore platforms. Our analysis reveals that the AID methods constitute effective replacements of the static and dynamic methods on AMPs, and are capable of improving performance over these conventional strategies by up to 56% and 16.8%, respectively. CCS CONCEPTS• Computer systems organization → Multicore architectures; Heterogeneous (hybrid) systems; • Software and its engineering → Runtime environments; Parallel programming languages.

show abstract

Systematic search space design for energy-efficient static scheduling of moldable tasks

Keller

Litzinger

2022

Journal of Parallel and Distributed Computing

View full text Add to dashboard Cite

Energy-aware scheduling of malleable fork-join tasks under a deadline constraint on heterogeneous multicores

Cited by 6 publications

References 9 publications

Flexible system software scheduling for asymmetric multicore systems with PMCSched: A case for Intel Alder Lake

Flexible system software scheduling for asymmetric multicore systems with PMCSched: A case for Intel Alder Lake

Enabling performance portability of data-parallel OpenMP applications on asymmetric multicore processors

Systematic search space design for energy-efficient static scheduling of moldable tasks

Contact Info

Product

Resources

About