IUF Scheduling Algorithm for Improving the Schedulability, Predictability and Sustainability of the Real Time System

Author(s):  
Radhakrishna Naik ◽  
Vivek Joshi ◽  
R. R. Manthalkar
2015 ◽  
Vol 2 (1) ◽  
pp. 35-41
Author(s):  
Rivan Risdaryanto ◽  
Houtman P. Siregar ◽  
Dedy Loebis

The real-time system is now used on many fields, such as telecommunication, military, information system, evenmedical to get information quickly, on time and accurate. Needless to say, a real-time system will always considerthe performance time. In our application, we define the time target/deadline, so that the system should execute thewhole tasks under predefined deadline. However, if the system failed to finish the tasks, it will lead to fatal failure.In other words, if the system cannot be executed on time, it will affect the subsequent tasks. In this paper, wepropose a real-time system for sending data to find effectiveness and efficiency. Sending data process will beconstructed in MATLAB and sending data process has a time target as when data will send.


Symmetry ◽  
2020 ◽  
Vol 12 (1) ◽  
pp. 172 ◽  
Author(s):  
Hoyoun Lee ◽  
Jinkyu Lee

In a real-time system, a series of jobs invoked by each task should finish its execution before its deadline, and EDF (Earliest Deadline First) is one of the most popular scheduling algorithms to meet such timing constraints of a set of given tasks. However, EDF is known to be ineffective in meeting timing constraints for non-preemptive tasks (which disallow any preemption) when the system does not know the future job release patterns of the tasks. In this paper, we develop a scheduling algorithm for a real-time system with a symmetry multiprocessor platform, which requires only limited information about the future job release patterns of a set of non-preemptive tasks, called LCEDF. We then derive its schedulability analysis that provides timing guarantees of the non-preemptive task set on a symmetry multiprocessor platform. Via simulations, we demonstrate the proposed schedulability analysis for LCEDF significantly improves the schedulability performance in meeting timing constraints of a set of non-preemptive tasks up to 20.16%, compared to vanilla non-preemptive EDF.


2014 ◽  
Vol 513-517 ◽  
pp. 2487-2491
Author(s):  
Dong Zhao ◽  
Shang Wei Jiang ◽  
Hong Wei Zhao ◽  
Xin Tong Yu

This paper combines the characteristics of real-time embedded systems and the real-time operating system to propose a software engineering method and process which bases on the function structured analysis and task structured design. First in the process of structured analysis based on the Hatley-Pirbhai method, extracting and sorting out the data flow and control flow according to the functional requirements of the system, analyzing and processing the functions of the system, the dependency among the functions and the timing sequence, and then realizing the design of the specific functions of the system, next achieving the structural design through the improving method, it also simplifies the system design processes. At this time, just need to analyze and divide the processing which is obtained from the structural analysis to get the specific task, design the interfaces among the tasks and also every task to get the new design method of the embedded real-time operating system, which also solves hard issue of the traditional method which is the weak extracting and developing iteration in the embedded real-time system.


2012 ◽  
Vol 32 ◽  
pp. 02003 ◽  
Author(s):  
C. Sozzi ◽  
E. Alessi ◽  
L. Boncagni ◽  
C. Galperti ◽  
C. Marchetto ◽  
...  

2011 ◽  
Vol 2011 ◽  
pp. 1-11
Author(s):  
Andrew McKenzie ◽  
Shameka Dawson ◽  
Fei Hu ◽  
Monica Anderson

Implementing a robot controller that can effectively manage limited resources in a deterministic, real-time manner is challenging. Behavior-based architectures that decompose autonomy into levels of intelligence are popular due to their robustness but do not provide real-time features that enforce timing constraints or support determinism. We propose an architecture and approach for using the real-time features of the Real-Time Specification for Java (RTSJ) in a behavior-based mobile robot controller to show that timing constraints affect performance. This is accomplished by extending a real-time aware architecture that explicitly enumerates timing requirements for each behavior. It is not enough to reduce latency. The usefulness of this approach is demonstrated via an implementation on Solaris 10 and the Sun Java Real-Time System (Java RTS). Experimental results are obtained using a K-team Koala robot performing path following with four composite behaviors. Experiments were conducted using several task period sets in three cases: real-time threads with the real-time garbage collector, real-time threads with the non- real-time garbage collector, and non-real-time threads with the non-real-time garbage collector. Results show that even if latency and determinism are improved, the timing of each individual behavior significantly affects task performance.


Sign in / Sign up

Export Citation Format

Share Document