A Systematic Survey of Multiprocessor Real-Time Scheduling and Synchronization Protocol

2022 ◽  
Vol 12 ◽  
Author(s):  
Ajitesh Kumar
Keyword(s):  
Real Time ◽  
Rapid Development ◽  
Research Work ◽  
Resource Scheduling ◽  
Multiprocessor Scheduling ◽  
Shared Resources ◽  
Time System ◽  
Real Time System ◽  
Real Time Scheduling ◽  
Time Scheduling

Background: Nowadays, there is an immense increase in the demand for high power computation of real-time workloads and the trend towards multi-core and multiprocessor CPUs. The real-time system needs to be implemented upon multiprocessor platforms. Introduction: The nature of processors in an embedded real-time system is changing day by day. The two most significant challenges in a multiprocessor environment are scheduling and synchronization. The popularity of real-time multi-core systems has exploded in recent years, driving the rapid development of a variety of methods for multiprocessor scheduling of essential tasks, on the other hand, these systems have constraints when it comes to maintaining synchronization in order to access shared resources. Method: This research work presents a systematic review of different existing scheduling algorithms and synchronization protocols for shared resources in a real-time multiprocessor environment. The manuscript also presents a study based on various metrics of resource scheduling and comparison among different resource scheduling techniques. Result and Conclusion: The survey classifies open issues, key challenges, and likely useful research directions. Finally, we accept that there is still a lot of capacity in getting better resource management and further maintaining the overall quality. The paper considers such a future path of research in this field.

Predictive - Reactive Strategy for Real Time Scheduling of Manufacturing Systems

2013 ◽  
Vol 307 ◽  
pp. 470-473 ◽  
Author(s):  
Krzysztof Kalinowski ◽  
Damian Krenczyk ◽  
Cezary Grabowik
Keyword(s):  
Real Time ◽  
Manufacturing Systems ◽  
Time System ◽  
Real Time System ◽  
Rule Based ◽  
Real Time Scheduling ◽  
Time Scheduling ◽  
Reactive Strategy

In this paper a solution of soft real time scheduling in manufacturing systems is presented. The basic requirements of scheduling as a real time system are discussed. The proposed rescheduling method uses predictive-reactive strategy and multi thread searching approach with rule-based heuristics, meta-heuristics and random modules.

scholarly journals Energy-Efficient Task Partitioning for Real-Time Scheduling on Multi-Core Platforms

Computers ◽  
2021 ◽  
Vol 10 (1) ◽  
pp. 10
Author(s):  
Manal A. El Sayed ◽  
El Sayed M. Saad ◽  
Rasha F. Aly ◽  
Shahira M. Habashy
Keyword(s):  
Energy Consumption ◽  
Real Time ◽  
Bin Packing ◽  
Shared Resources ◽  
Energy Aware ◽  
Task Partitioning ◽  
Worst Case ◽  
Real Time Scheduling ◽  
Static Partitioning ◽  
Time Scheduling

Multi-core processors have become widespread computing engines for recent embedded real-time systems. Efficient task partitioning plays a significant role in real-time computing for achieving higher performance alongside sustaining system correctness and predictability and meeting all hard deadlines. This paper deals with the problem of energy-aware static partitioning of periodic, dependent real-time tasks on a homogenous multi-core platform. Concurrent access of the tasks to shared resources by multiple tasks running on different cores induced a higher blocking time, which increases the worst-case execution time (WCET) of tasks and can cause missing the hard deadlines, consequently resulting in system failure. The proposed blocking-aware-based partitioning (BABP) algorithm aims to reduce the overall energy consumption while avoiding deadline violations. Compared to existing partitioning strategies, the proposed technique achieves more energy-saving. A series of experiments test the capabilities of the suggested algorithm compared to popular heuristics partitioning algorithms. A comparison was made between the most used bin-packing algorithms and the proposed algorithm in terms of energy consumption and system schedulability. Experimental results demonstrate that the designed algorithm outperforms the Worst Fit Decreasing (WFD), Best Fit Decreasing (BFD), and Similarity-Based Partitioning (SBP) algorithms of bin-packing algorithms, reduces the energy consumption of the overall system, and improves schedulability.

scholarly journals Performance analysis comparison between non mixed-criticality and mixed-criticality system in microcontroller

2019 ◽  
Vol 15 (2) ◽  
pp. 678
Author(s):  
Siti Nurhafizza Maidin ◽  
Noor Azurati Ahmad ◽  
Kamilia Kamardin ◽  
Shamsul Sahibuddin ◽  
Syahrizal Fadhlie Sabri
Keyword(s):  
Embedded System ◽  
Real Time ◽  
Dynamic Power Management ◽  
Task Execution ◽  
Real Time System ◽  
Real Time Scheduling ◽  
Time Scheduling ◽  
Save Energy ◽  
Main Component ◽  
Mixed Criticality

<span>Nowadays, implementation of real-time embedded system or safety-critical in a real-time system is significant within emerging technologies because the system involves many aspects such as safety and task execution without missing deadlines. The main cause of implementation is to avoid catastrophic loss. Besides that, effectuation of the mixed-criticality system in embedded system making system more complex for task execution. For an embedded system, the main component involves real-time scheduling. The implementation of DPM method in real-time scheduling is well known, but in the mixed-criticality system, DPM method is still lacking. In order to cater this problem, Dynamic Power management (DPM) method is deployed onto the microcontroller of the mixed-criticality system to save energy when executing tasks in order to have better performance in the system. The usage of the DPM method in mixed-criticality of microcontroller resulting decrease of 0.82% in LED output voltage value meanwhile, for the LCD output, the voltage value decreased by 1.37% in the home alarm system. Thus, the energy-saving in the microcontroller of the mixed-criticality system using the DPM method is defined.</span>

scholarly journals A Time Refinement Framework Based on iUML-B State Machine

2021 ◽  
Vol 2021 ◽  
pp. 1-21
Author(s):  
Han Peng ◽  
Xiaoli Zhang ◽  
Guozhen Cao ◽  
Zhouzhou Liu ◽  
Yuejuan Jing ◽  
...  
Keyword(s):  
Real Time ◽  
Timed Automata ◽  
System Modeling ◽  
Research Work ◽  
Time Constraints ◽  
Formal Modeling ◽  
Time System ◽  
Time Model ◽  
Real Time System ◽  
Time Systems

Event-B is a formal modeling language that is very suitable for software engineering, but it lacks the ability of modeling time. Researchers have proposed some methods for modeling time constraints in Event-B. The limitations with existing methods are that, first of all, the existing research work lacks a systematic time refinement framework based on Event-B; secondly, the existing methods only model time in the Event-B framework and cannot be smoothly converted to automata-based models such as timed automata that facilitate the verification of time properties. These limitations make it more difficult to model and verify real-time systems with Event-B because it is very time-consuming to prove time properties in the Event-B framework. In this paper, we firstly proposed a systematic time refinement framework to express and refine time constraints in Event-B. Secondly, we also proposed various vertical refinement patterns and horizontal extension patterns to guide modelers to refine the Event-B real-time model step by step. Finally, we use a real-time system case to demonstrate the practicality of our method. The experimental results show that the proposed method can make the real-time system modeling in Event-B more convenient and the models are easier to convert to the timed automata model, thereby facilitating the verification of various time properties.

A Scalable Approach to Real-Time System Timing Applications

2010 ◽  
pp. 606-644
Author(s):  
Alan Grigg ◽  
Lin Guan
Keyword(s):  
Real Time ◽  
Reference Model ◽  
Timing Analysis ◽  
Target System ◽  
Time System ◽  
Worst Case ◽  
Real Time System ◽  
Resource Requirements ◽  
Time Scheduling ◽  
Execution Model

This chapter describes a real-time system performance analysis approach known as reservation-based analysis (RBA). The scalability of RBA is derived from an abstract (target-independent) representation of system software components, their timing and resource requirements and run-time scheduling policies. The RBA timing analysis framework provides an evolvable modeling solution that can be instigated in early stages of system design, long before the software and hardware components have been developed, and continually refined through successive stages of detailed design, implementation and testing. At each stage of refinement, the abstract model provides a set of best-case and worst-case timing ‘guarantees’ that will be delivered subject to a set of scheduling ‘obligations’ being met by the target system implementation. An abstract scheduling model, known as the rate-based execution model then provides an implementation reference model with which compliance will ensure that the imposed set of timing obligations will be met by the target system.

An adaptive SVM-based real-time scheduling mechanism and simulation for multiple-load carriers in automobile assembly lines

2017 ◽  
Vol 08 (04) ◽  
pp. 1750048 ◽  
Author(s):  
Binghai Zhou ◽  
Jiahui Xu
Keyword(s):  
Real Time ◽  
System Performance ◽  
Manufacturing Systems ◽  
Batch Size ◽  
Support Vector ◽  
Real Time System ◽  
Real Time Scheduling ◽  
Automobile Assembly ◽  
Time Scheduling ◽  
Multiple Load

Multiple-load carriers are widely introduced for material delivery in manufacturing systems. The real-time scheduling of multiple-load carriers is so complex that it deserves attention to pursue higher productivity and better system performance. In this paper, a support vector machine (SVM)-based real-time scheduling mechanism was proposed to tackle the scheduling problem of parts replenishment with multiple-load carriers in automobile assembly plants under dynamic environment. The SVM-based scheduling mechanism was trained first and then used to make the optimal real-time decisions between “wait” and “deliver” on the basis of real-time system states. An objective function considering throughput and delivery distances was established to evaluate the system performance. Moreover, a simulation model in eM-Plant software was developed to validate and compare the proposed SVM-based scheduling mechanism with the classic minimum batch size (MBS) heuristic. It simulated both the steady and dynamic environments which are characterized by the uncertainty of demands or scheduling criteria. The simulation results demonstrated that the SVM-based scheduling mechanism could dynamically make optimal real-time decisions for multiple-load carriers and outperform the MBS heuristic as well.

Sign in / Sign up

Export Citation Format

Share Document