Research of Mechanism to System Flexibility Based on Embedded Real-Time System

2010 ◽  
Vol 108-111 ◽  
pp. 789-794 ◽  
Author(s):  
Guo Dong Zhao ◽  
Guo Yin Zhang ◽  
Ai Hong Yao
Keyword(s):  
Coping Strategies ◽  
Real Time ◽  
Distributed System ◽  
System Framework ◽  
Time System ◽  
Real Time System ◽  
Testing Environment ◽  
Simulation Testing ◽  
Time Systems ◽  
The Impact

This paper briefly describes the main ideas and coping strategies of mechanism to system flexibility based on embedded real-time system, designs the distributed system framework to system flexibility for the characteristics of embedded real-time systems. By building simulation testing environment based on RT-Linux real-time operating system, the impact of coping strategies of mechanism to system flexibility based on embedded real-time system and the distributed system framework to system flexibility on performance of RT-Linux was tested.

Research on Security Level Assessment Technology in Embedded Real-Time System

2014 ◽  
Vol 696 ◽  
pp. 266-270
Author(s):  
Hong Li Chen
Keyword(s):  
Real Time ◽  
System Security ◽  
Assessment System ◽  
Security Level ◽  
Time System ◽  
Real Time System ◽  
Testing Environment ◽  
Simulation Testing ◽  
Time Systems ◽  
The Impact

This paper briefly describes the main ideas and implementation of technology strategy of Embedded real-time system security level assessment which is important part of mechanism to system flexibility based on embedded real-time system, designs the embedded real-time system security level assessment system based on pattern matching for the characteristics of embedded real-time systems. By building security level assessment system and simulation testing environment based on RT-Linux real-time operating system, the impact of Embedded real-time system security level assessment strategy on performance of RT-Linux was tested.

scholarly journals An Introduction to RTOS

2012 ◽  
pp. 285-289
Author(s):  
Sanjay Singh ◽  
Nishant Tripathi ◽  
Anil Kumar Chaudhary ◽  
Mahesh Kumar Singh
Keyword(s):  
Operating System ◽  
Real Time ◽  
Level Of Service ◽  
Real Time Systems ◽  
Time System ◽  
Real Time System ◽  
Real Time Operating System ◽  
System A ◽  
External Stimuli ◽  
Time Systems

RTOS (real time operating system) can be defined as “The ability of the operating system to provide a required level of service in bounded response time.” A real time system responds in a (timely) predictable way to unpredictable external stimuli arrivals. To build a predictable system, all its components (hardware & software) should enable this requirement to be fulfilled. Traffic on a bus for example should take place in a way allowing all events to be managed within the prescribe time limit. However it should not be forgotten that a good RTOS is only is building block. Using it in a wrongly designed system may lead to a malfunctioning of the RT system. A good RTOS can be defined as one that has a bounded (predictable) behavior under all system load scenarios (simultaneous interrupts and thread execution). In RT system, each individual deadline should be met. Real-time systems are designed to control and monitor their environment. Most of these systems are using sensors to collect environment state and use actuators to change something.

scholarly journals Performance Evaluation of New Joint EDF-RM Scheduling Algorithm for Real Time Distributed System

2014 ◽  
Vol 2014 ◽  
pp. 1-13 ◽  
Author(s):  
Rashmi Sharma ◽  
Nitin
Keyword(s):  
Real Time ◽  
Distributed System ◽  
Scheduling Algorithm ◽  
Earliest Deadline First ◽  
Time System ◽  
Real Time System ◽  
Main Target ◽  
Migration Mechanism ◽  
Simulation Results ◽  
Earliest Deadline

In Real Time System, the achievement of deadline is the main target of every scheduling algorithm. Earliest Deadline First (EDF), Rate Monotonic (RM), and least Laxity First are some renowned algorithms that work well in their own context. As we know, there is a very common problem Domino's effect in EDF that is generated due to overloading condition (EDF is not working well in overloading situation). Similarly, performance of RM is degraded in underloading condition. We can say that both algorithms are complements of each other. Deadline missing in both events happens because of their utilization bounding strategy. Therefore, in this paper we are proposing a new scheduling algorithm that carries through the drawback of both existing algorithms. Joint EDF-RM scheduling algorithm is implemented in global scheduler that permits task migration mechanism in between processors in the system. In order to check the improved behavior of proposed algorithm we perform simulation. Results are achieved and evaluated in terms of Success Ratio (SR), Average CPU Utilization (ECU), Failure Ratio (FR), and Maximum Tardiness parameters. In the end, the results are compared with the existing (EDF, RM, and D_R_EDF) algorithms. It has been shown that the proposed algorithm performs better during overloading condition as well in underloading condition.

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.

ADDING FORM TO REAL-TIME SYSTEM SPECIFICATION AND SIMULATION

1999 ◽  
Vol 09 (05) ◽  
pp. 643-661 ◽  
Author(s):  
JI Y. LEE ◽  
KYO C. KANG ◽  
GERARD J. KIM ◽  
HYE J. KIM
Keyword(s):  
Real Time ◽  
Critical Role ◽  
Real Time Systems ◽  
System Specification ◽  
Time System ◽  
Real Time System ◽  
Interactive Behavior ◽  
Behavior Function ◽  
And Behavior ◽  
Time Systems

Specification and validation of a real-time system are often based on making simplistic predictions and assumptions about relevant behavior of the external environment and the controlled device interacting with it. However, in many cases, real-time systems physically interact with other external objects in a complex manner in a dynamically changing world and thus, their form (e.g. physical properties such as shape, mass, material, and configuration) can play a critical role in producing a correct specification and obtaining realistic simulation output. We present ASADAL/PROTO, a specification and simulation tool for real-time systems, that takes form into account in addition to the function and behavior handled by ASADAL/SIM, its predecessor. Simulation of the control system specification runs in conjunction with the environmental simulation, and the resulting interactive behavior of the controlled system is observed visually for analysis. Our vision is to incrementally model, simulate and analyze all three views (behavior, function, and form) of real-time system specification for its increased level of confidence at early prototyping stage.

Graphical Modeling of a Component-Based Software Architecture for Distributed Real-Time Systems

2013 ◽  
Vol 462-463 ◽  
pp. 352-355
Author(s):  
Xiao Yan Liu ◽  
Xiao Dong Fu
Keyword(s):  
Software Architecture ◽  
Real Time ◽  
Design Method ◽  
Design Environment ◽  
Time System ◽  
Real Time System ◽  
Graphical Modeling ◽  
Component Element ◽  
Graphical Design ◽  
Time Systems

Present a graphical modeling design methodology of component-based software architecture for distributed real-time system. First of all, definitions of real-time application component model, types of component element that are used for describing software architecture, and types of collaboration relationship between components are introduced in a graphical design environment. Secondly a graphical modeling design method of software architecture for distributed real-time system is described. Finally, the graphical modeling method based on components defined is illustrated via an example.

Synchronization-Aware Task Allocation Techniques for Preemption Control to Reduce Blocking Time in Multiprocessor Real-Time System

2020 ◽  
Vol 11 (4) ◽  
pp. 60-79
Author(s):  
Ajitesh Kumar ◽  
Sanjai Kumar Gupta
Keyword(s):  
Real Time ◽  
Task Completion ◽  
Real Time Systems ◽  
Time System ◽  
Real Time System ◽  
Priority Inversion ◽  
Context Switching ◽  
Optimal Approach ◽  
Result Analysis ◽  
Time Systems

Multiprocessor real-time systems receive a great deal of attention. For better utilization of multiprocessors in a real-time context, an optimal approach for scheduling, allocation, and synchronization is required. In this research, a novel heuristic synchronization-aware scheduling has been proposed to reduce the blocking delays in a critical section and also bound to minimize multiple priority inversion. The key idea of this technique is to assign the task set in the same processor that accesses a common shared resource and also access them for the longest period of time; thereby, the global sharing of resource transforms into local sharing. From simulation results, it was concluded that the duration of blocking overheads should be minimized up to 25% to 30% and context switching between processors also reduced up to 10% to 15%. On the basis of result analysis, schedulability, minimization of context switching, and reduced blocking time indicate that the proposed method outperforms the existing methods and does not affect the task completion time.

Sign in / Sign up

Export Citation Format

Share Document