Efficient sporadic task handling in parallel AUTOSAR applications using runnable migration

Copic, Milan; Leupers, Rainer; Ascheid, Gerd

doi:10.1145/3287624.3287654

Cited by 4 publications

(2 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The AUTOSAR-based ECU uses data through implicit communication of runnables. Before runnable start, a data buffer used in the runnable is copied to a local runnable buffer, which is written back to the existing data buffer after runnable end [23]. Maintaining data consistency has been demonstrated through the runnable's copy strategy of implicit communication [24].…”

Section: A Shared Data Protectionmentioning

confidence: 99%

The Migration of Engine ECU Software From Single-Core to Multi-Core

Moon

Kim

et al. 2021

IEEE Access

View full text Add to dashboard Cite

As multiple functions have been added to single-core-based engine electronic control units (ECUs) in vehicles, automotive researchers and manufacturers have actively studied multi-core architecture for engine ECUs. Multi-core architecture can provide load balancing and parallelism that can meet the requirements of international organization standard (ISO) 26262. However, since real-world engine ECUs have the most complex automotive open system architecture (AUTOSAR)-based control logic and datasets among automotive ECUs, developing multi-core-based engine ECUs is a substantial amount of work. Thus, automotive researchers and manufacturers will need new methodologies for multi-core-based engine ECUs. In this paper, we focus on designing a multi-core migration methodology and applying it to a real-world AUTOSAR-based engine ECU from HYUNDAI. We verify its practicability and enhanced performance. In conclusion, through connection with other automotive domain ECUs, it is demonstrated that a multi-core engine ECU using our migration technology can be applied in real-world automotive vehicles, leading to a significant improvement in performance.INDEX TERMS Multi-core-based engine system, shared data inconsistency, core load balancing, memory and offset optimization technology.

show abstract

Section: A Shared Data Protectionmentioning

confidence: 99%

The Migration of Engine ECU Software From Single-Core to Multi-Core

Moon

Kim

et al. 2021

IEEE Access

View full text Add to dashboard Cite

show abstract

“…R EAL-TIME systems [1] are widely used in safetycritical applications such as aerospace [2], automobiles [3], industrial control, robotics, communications, and medical electronics. It plays an important role in a system with strict timing requirements, fast response, and stability.…”

Section: Introductionmentioning

confidence: 99%

A Schedulability Test for Sporadic Task DM Scheduling Based on Density Upper Bound

Liu

Qiao

Yang³

et al. 2022

IEEE Access

View full text Add to dashboard Cite

Due to low runtime overhead and simple implementation of DM(Deadline Monotonic) scheduling, it is widely used in real-time systems. Aiming at the schedulability test problem of the sporadic task DM(Deadline Monotonic) scheduling under uniprocessor, a density upper bound of 0.693 is analyzed, which can determine the schedulability of a task set in linear time. The theoretical analysis process is carried out in three steps. Firstly, the case is considered where the task set contains only two tasks and the deadline ratio between the tasks is less than 2. Secondly, the case is considered where the task set contains multiple tasks and the deadline ratio between any two tasks is still less than 2. Finally, the case is considered where the task set contains multiple tasks and the deadline ratio between tasks is an arbitrary value. The experimental results show that the upper bound of density is higher than related methods and the run time overhead is much lower than that of other available exact schedulability tests. The time complexity is O(1) when a task is dynamically added to the task set, while that of other methods increases rapidly along with the number of tasks. In addition, we combined this upper bound and other tests to further propose an exact schedulability test, which effectively reduces the running time overhead by 30.8% compared with the stateof-the-art schedulability test. Due to the high efficiency of our schedulability test, an online schedulability test can be implemented in open real-time systems.

show abstract