scholarly journals What to Make of Multicore Processors for Reliable Real-Time Systems?

Author(s):  
Theodore P. Baker
2020 ◽  
Author(s):  
Gedare Bloom ◽  
Joel Sherrill ◽  
Tingting Hu ◽  
Ivan Cibrario Bertolotti

2012 ◽  
Vol 241-244 ◽  
pp. 2246-2252
Author(s):  
Mao Lin Yang ◽  
Hang Lei ◽  
Yong Liao ◽  
Lin Hui Hu

Multicore processors are increasingly used in real-time embedded systems. Better utilization of hard real-time systems requires accurate scheduling and synchronization analysis. In this paper, we characterize the major synchronization penalties arising from partitioned fixed priority scheduling for hard real-time tasks on multicore platform, including transitive remote preemption, multiple remote blocking, and multiple priority inversions. Subsequently, we propose a new response time analysis by improving the approach to bound task blocking time. The key idea of this approach is to classify the total blocking time into (i) direct blocking, including local and remote blocking, and transitive remote preemption; and (ii) multiple local interference which is incurred by multiple priority inversion. Simulation results indicate that the proposed approach produces less pessimistic results in task blocking time, and better schedulability performance.


Symmetry ◽  
2021 ◽  
Vol 13 (8) ◽  
pp. 1488
Author(s):  
Basharat Mahmood ◽  
Naveed Ahmad ◽  
Majid Iqbal Khan ◽  
Adnan Akhunzada

The use of real-time systems is growing at an increasing rate. This raises the power efficiency as the main challenge for system designers. Power asymmetric multicore processors provide a power-efficient platform for building complex real-time systems. The utilization of this efficient platform can be further enhanced by adopting proficient scheduling policies. Unfortunately, the research on real-time scheduling of power asymmetric multicore processors is in its infancy. In this research, we have addressed this problem and added new results. We have proposed a dynamic-priority semi-partitioned algorithm named: Earliest-Deadline First with C=D Task Splitting (EDFwC=D-TS) for scheduling real-time applications on power asymmetric multicore processors. EDFwC=D-TS outclasses its counterparts in terms of system utilization. The simulation results show that EDFwC=D-TS schedules up to 67% more tasks with heavy workloads. Furthermore, it improves the processor utilization up to 11% and on average uses 14% less cores to schedule the given workload.


2020 ◽  
Vol E103.D (2) ◽  
pp. 329-338
Author(s):  
Takashi NAKADA ◽  
Hiroyuki YANAGIHASHI ◽  
Kunimaro IMAI ◽  
Hiroshi UEKI ◽  
Takashi TSUCHIYA ◽  
...  

IEE Review ◽  
1992 ◽  
Vol 38 (3) ◽  
pp. 112
Author(s):  
Stuart Bennett

Author(s):  
Pallab Banerjee ◽  
◽  
Riya Shree ◽  
Richa Kumari Verma ◽  
◽  
...  

Sign in / Sign up

Export Citation Format

Share Document