2017
DOI: 10.1145/3057267
|View full text |Cite
|
Sign up to set email alerts
|

A Survey and Comparative Study of Hard and Soft Real-Time Dynamic Resource Allocation Strategies for Multi-/Many-Core Systems

Abstract: Multi/Many-core systems are envisioned to satisfy the ever increasing performance requirements of complex applications in various domains such as embedded and high performance computing (HPC). Such systems need to cater for increasingly dynamic workloads, requiring efficient dynamic resource allocation strategies in order to satisfy hard or soft real-time constraints. This article provides an extensive survey of hard and soft real-time dynamic resource allocation strategies proposed over the last two decades a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
52
0

Year Published

2017
2017
2023
2023

Publication Types

Select...
4
4
1

Relationship

3
6

Authors

Journals

citations
Cited by 78 publications
(53 citation statements)
references
References 190 publications
0
52
0
Order By: Relevance
“…When it comes to HRT task scheduling, hybrid methods are always employed. The hybrid approaches utilize design-time computations to identify a timing constraint satisfying allocation at runtime [36,37].…”
Section: Multi-robot Task Schedulingmentioning
confidence: 99%
“…When it comes to HRT task scheduling, hybrid methods are always employed. The hybrid approaches utilize design-time computations to identify a timing constraint satisfying allocation at runtime [36,37].…”
Section: Multi-robot Task Schedulingmentioning
confidence: 99%
“…The approach has some o ine and online steps (falling into the category of hybrid approach [31]) where o ine computed results for various applications are used to identify energy e cient run-time mapping and partitioning of threads of concurrent applications to be executed on the heterogeneous MPSoC. The main steps of the approach are as follows:…”
Section: Proposed Run-time Thread Mapping and Partitioningmentioning
confidence: 99%
“…Therefore, efficient and scalable RL algorithms are desired for large scale many-core systems with hundreds of cores. In order to address the scalability issues imposed by centralized resource management in many-core systems, distributed or hierarchical management has been employed [29,81]. In distributed management, each core is checked independently to make management decisions, whereas the cores are grouped into multiple clusters in hierarchical management and each cluster is managed by a local manager.…”
Section: Distributed Reinforcement Learningmentioning
confidence: 99%
“…Different types of timing requirements are imposed depending upon the kind of target system, e.g., hard real-time and soft real-time systems [29]. Examples of hard real-time systems are time critical systems such as automotive engine and flight control software.…”
Section: Introductionmentioning
confidence: 99%