HDA: Hierarchical and dependency-aware task mapping for network-on-chip based embedded systems

Huang, Chun-Hsian

doi:10.1016/j.sysarc.2020.101740

Cited by 16 publications

(10 citation statements)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Generally, it is recommended to avoid caches in real-time systems. As many works have reported, the scheduling of tasks and their mapping to available resources also may balance the system loading and better use its capacities [2,[19][20][21][22]. The methodology proposed in [19] uses a group-based, energy-efficient dual-priority scheduling (GEDP) that isolates different types of tasks and, thus, allows avoiding disruption and minimizing the context switches between tasks.…”

Section: Related Workmentioning

confidence: 99%

“…The methodology proposed in [19] uses a group-based, energy-efficient dual-priority scheduling (GEDP) that isolates different types of tasks and, thus, allows avoiding disruption and minimizing the context switches between tasks. On the other hand, [20] presents a hierarchical approach to task scheduling (HDA), in which the mapping process takes into account the dependencies between tasks, which, as a result, allows better management of resources and organization of communication in the system. The authors of [21] suggest the usage of a dynamic mechanism that analyzes the resource load during tasks' execution.…”

Section: Related Workmentioning

confidence: 99%

See 1 more Smart Citation

An Analysis of the Impact of Gating Techniques on the Optimization of the Energy Dissipated in Real-Time Systems

Antolak

Pułka

2022

Applied Sciences

View full text Add to dashboard Cite

The paper concerns research on electronics-embedded safety systems. The authors focus on the optimization of the energy consumed by multitasking real-time systems. A new flexible and reconfigurable multi-core architecture based on pipeline processing is proposed. The presented solution uses thread-interleaving mechanisms that allow avoiding hazards and minimizing unpredictability. The proposed architecture is compared with the classical solutions consisting of many processors and based on the scheme using one processor per single task. Energy-efficient task mapping is analyzed and a design methodology, based on minimizing the number of active and utilized resources, is proposed. New techniques for energy optimization are proposed, mainly, clock gating and switching-resources blocking. The authors investigate two main factors of the system: setting the processing frequency, and gating techniques; the latter are used under the assumption that the system meets the requirements of time predictability. The energy consumed by the system is reduced. Theoretical considerations are verified by many experiments of the system's implementation in an FPGA structure. The set of tasks tested consists of programs that implement Mälardalen WCET benchmark algorithms. The tested scenarios are divided into periodic and non-periodic execution schemes. The obtained results show that it is possible to reduce the dynamic energy consumed by real-time applications' meeting their other requirements.

show abstract

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

An Analysis of the Impact of Gating Techniques on the Optimization of the Energy Dissipated in Real-Time Systems

Antolak

Pułka

2022

Applied Sciences

View full text Add to dashboard Cite

show abstract

“…The task with the smallest energy delay product (EDP) is selected, and then, it is assigned to the corresponding processor, but the method considers that the power of the scheduled task is constant. Huang [ 31 ] points out that processing elements are idle when the required data are not received which will lead to the issue of low utilization of processing elements. Choi et al [ 34 ] have proposed an estimated-execution-time (EET) scheduling to predict the remaining execution time of programs according to the remaining execution time of tasks and pointed out the deficiency of the alternate assignment (AA) scheduling, first free (FF) scheduling, and performance history (PH) scheduling in [ 32 , 33 ].…”

Section: Related Workmentioning

confidence: 99%

“…Energytemp_K_GPUIndex ⟵ AccumPer_GPUIndex1 * the energy of task number ptm_K_GPUIndex (22) end if (23) end if (24) // e above calculation traverses K_GPUIndex array (25) for i ⟵ 1, NumGPU − 1 do//Select the minimum product (26) if Energytemp_i < MinEnergy (27) assign the GPU number i to Return_GPUIndex (28) assign the Energytemp_i to MinEnergy (29) end if (30) end for (31) if Return_TempGPUIndex is from array (32) assign 0 to flag_ Return_TempGPUIndex (33) return Return_GPUIndex, pth_Return_GPUIndex, 0 (34) else (35) return Return_GPUIndex, ptm_Return_GPUIndex, 1 (36) end if ALGORITHM 3: Getting the task and GPU number with the smallest product of accumulated time and energy of its task.…”

mentioning

confidence: 99%

Low Power Scheduling Approach for Heterogeneous System Based on Heuristic and Greedy Method

Guo

Liu

et al. 2022

Computational Intelligence and Neuroscience

View full text Add to dashboard Cite

Big data, cloud computing, and artificial intelligence technologies supported by heterogeneous systems are constantly changing our life and cognition of the world. At the same time, its energy consumption affects the operation cost and system reliability, and this attracts the attention of architecture designers and researchers. In order to solve the problem of energy in heterogeneous system environment, inspired by the results of 0-1 programming, a scheduling method of heuristic and greedy energy saving (HGES) approach is proposed to allocate tasks reasonably to achieve the purpose of energy saving. Firstly, all tasks are assigned to each GPU in the system, and then the tasks are divided into high-value tasks and low-value tasks by the calculated average time value and variance value of all tasks. By using the greedy method, the high-value tasks are assigned first, and then the low-value tasks are allocated. In order to verify the effectiveness and rationality of HGES, different tasks with different inputs and different comparison methods are designed and tested. The experimental results on different platforms show that the HGES has better energy saving than that of existing method and can get result faster than that of the 0-1 programming.

show abstract

“…We foresee our approach can be applied in a variety of applications such as checking dependencies in a task mapping scenarios [12], dependency reduction algorithms [13] and fault detection algorithms that have task execution dependencies as constraints [14].…”

Section: Related Workmentioning

confidence: 99%

Online Cycle Detection for Models with Mode-Dependent Input and Output Dependencies

Park,

Easwaran,

Borde

2021

Preprint

View full text Add to dashboard Cite

In the fields of co-simulation and component-based modelling, designers import models as building blocks to create a composite model that provides more complex functionalities. Modelling tools perform instantaneous cycle detection (ICD) on the composite models having feedback loops to reject the models if the loops are mathematically unsound and to improve simulation performance. In this case, the analysis relies heavily on the availability of dependency information from the imported models. However, the cycle detection problem becomes harder when the model's input to output dependencies are mode-dependent, i.e. changes for certain events generated internally or externally as inputs. The number of possible modes created by composing such models increases significantly and unknown factors such as environmental inputs make the offline (statical) ICD a difficult task. In this paper, an online ICD method is introduced to address this issue for the models used in cyber-physical systems. The method utilises an oracle as a central source of information that can answer whether the individual models can make mode transition without creating instantaneous cycles. The oracle utilises three types of data-structures created offline that are adaptively chosen during online (runtime) depending on the frequency as well as the number of models that make mode transitions. During the analysis, the models used online are stalled from running, resulting in the discrepancy with the physical system. The objective is to detect an absence of the instantaneous cycle while minimising the stall time of the model simulation that is induced from the analysis. The benchmark results show that our method is an adequate alternative to the offline analysis methods and significantly reduces the analysis time.

show abstract

HDA: Hierarchical and dependency-aware task mapping for network-on-chip based embedded systems

Cited by 16 publications

References 13 publications

An Analysis of the Impact of Gating Techniques on the Optimization of the Energy Dissipated in Real-Time Systems

An Analysis of the Impact of Gating Techniques on the Optimization of the Energy Dissipated in Real-Time Systems

Low Power Scheduling Approach for Heterogeneous System Based on Heuristic and Greedy Method

Online Cycle Detection for Models with Mode-Dependent Input and Output Dependencies

Contact Info

Product

Resources

About