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 Internet of Things (IoT) Platform for Multi-Topic Messaging

Energies ◽  
2020 ◽  
Vol 13 (13) ◽  
pp. 3346
Author(s):  
Mahmoud Hussein ◽  
Ahmed I. Galal ◽  
Emad Abd-Elrahman ◽  
Mohamed Zorkany
Keyword(s):  
Operating System ◽  
Internet Of Things ◽  
Real Time ◽  
Communication Protocol ◽  
Real Time Systems ◽  
Real Time System ◽  
Client Server ◽  
Iot Applications ◽  
Iot Platforms ◽  
Time Systems

IoT-based applications operate in a client–server architecture, which requires a specific communication protocol. This protocol is used to establish the client–server communication model, allowing all clients of the system to perform specific tasks through internet communications. Many data communication protocols for the Internet of Things are used by IoT platforms, including message queuing telemetry transport (MQTT), advanced message queuing protocol (AMQP), MQTT for sensor networks (MQTT-SN), data distribution service (DDS), constrained application protocol (CoAP), and simple object access protocol (SOAP). These protocols only support single-topic messaging. Thus, in this work, an IoT message protocol that supports multi-topic messaging is proposed. This protocol will add a simple “brain” for IoT platforms in order to realize an intelligent IoT architecture. Moreover, it will enhance the traffic throughput by reducing the overheads of messages and the delay of multi-topic messaging. Most current IoT applications depend on real-time systems. Therefore, an RTOS (real-time operating system) as a famous OS (operating system) is used for the embedded systems to provide the constraints of real-time features, as required by these real-time systems. Using RTOS for IoT applications adds important features to the system, including reliability. Many of the undertaken research works into IoT platforms have only focused on specific applications; they did not deal with the real-time constraints under a real-time system umbrella. In this work, the design of the multi-topic IoT protocol and platform is implemented for real-time systems and also for general-purpose applications; this platform depends on the proposed multi-topic communication protocol, which is implemented here to show its functionality and effectiveness over similar protocols.

A Study on the Design Method of the Real-Time System Software Based on RTOS

2014 ◽  
Vol 513-517 ◽  
pp. 2487-2491
Author(s):  
Dong Zhao ◽  
Shang Wei Jiang ◽  
Hong Wei Zhao ◽  
Xin Tong Yu
Keyword(s):  
Operating System ◽  
Real Time ◽  
Design Method ◽  
Control Flow ◽  
Functional Requirements ◽  
Time System ◽  
Real Time System ◽  
Real Time Operating System ◽  
The Real ◽  
Structured Analysis

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.

Software Design of Aircraft Electrical Load Management Center Based on μC/OS-II

2011 ◽  
Vol 268-270 ◽  
pp. 552-556
Author(s):  
Jian Jun Wu ◽  
Wei Wan ◽  
Da Hai Zhao
Keyword(s):  
Operating System ◽  
Real Time ◽  
Software Design ◽  
Load Management ◽  
Electrical Load ◽  
Time System ◽  
Real Time System ◽  
Single Task ◽  
Real Time Operating System ◽  
Priority Allocation

This paper introduces that embedded real time operating system μC/OS-II is applied in software design of aircraft electrical load management center. Firstly, the μC/OS-II and its running on ARM are briefly presented. Then the method of two system running modes is given in details. And the tasks assignment, priority allocation and communication between tasks under both two modes are also provided. Results show that multitask schedule managements of real-time system has solved the problem of poor real-time in a single task system. And the reliability of the system has been greatly improved.

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.

scholarly journals Performance of Dynamic Queue based Minimal Deadline First Scheduling Algorithm in Multicore System Under Real Time and NonReal Time Kernel Environment

2019 ◽  
Vol 8 (11) ◽  
pp. 3263-3268
Keyword(s):  
Operating System ◽  
Real Time ◽  
Low Cost ◽  
Scheduling Algorithm ◽  
Priority Queue ◽  
Real Time Systems ◽  
Real Time System ◽  
Core System ◽  
Hard Real Time ◽  
Time Systems

Some real-time systems that need to be associated with operating system services with a hard real-time system. Since these real-time systems that need to be extremely responsive to the outside world have no simple and low-cost operating system assistance. This paper deals with the application on a Linux-based operating system of the priority-based preemptive real-time scheduling algorithm that will suffice these firm applications in real-time. Typically, the algorithms regarded for these hard real-time systems are preemptive scheduling based on priorities. Based on the priority, by meeting the deadline, this algorithm can produce a feasible schedule for the dynamic tasks to be performed on the processor. It is feasible to schedule tasks on a processor as long as preemption is permitted and tasks do not compete for resources. In this scheduling algorithm, the task in the running queue that is waiting for the execution will be placed in the priority queue that is ready to execute in the available processor. This algorithm is deployed in the Linux kernel with the patch file and the kernel is built in the multi core system to execute an application

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.

scholarly journals Scheduling Algorithms Implementation for Real Time Operating Systems: A Review

2021 ◽  
pp. 35-51
Author(s):  
Gulistan Ahmead Ismael ◽  
Azar Abid Salih ◽  
Adel AL-Zebari ◽  
Naaman Omar ◽  
Karwan Jameel Merceedi ◽  
...  
Keyword(s):  
Real Time ◽  
Nuclear Reactor ◽  
Time Frame ◽  
Real Time Systems ◽  
Time System ◽  
Real Time System ◽  
Safety Control ◽  
Time Component ◽  
Paper Review ◽  
Time Systems

The term "Real-Time Operating System (RTOS)" refers to systems wherein the time component is critical. For example, one or more of a computer's peripheral devices send a signal, and the computer must respond appropriately within a specified period of time. Examples include: the monitoring system in a hospital care unit, the autopilot in the aircraft, and the safety control system in the nuclear reactor. Scheduling is a method that ensures that jobs are performed at certain times. In the real-time systems, accuracy does not only rely on the outcomes of calculation, and also on the time it takes to provide the results. It must be completed within the specified time frame. The scheduling strategy is crucial in any real-time system, which is required to prevent overlapping execution in the system. The paper review classifies several previews works on many characteristics. Also, strategies utilized for scheduling in real time are examined and their features compared.

Formal Specification of a Wall-Climbing Robot Using Z – A Case Study of Small-Scale Embedded Hard Real-Time System

2012 ◽  
Author(s):  
Radziah Mohamad ◽  
Dyg. Norhayati Abg. Jawawi ◽  
Safaai Deris ◽  
Rosbi Mamat
Keyword(s):  
Real Time ◽  
Formal Methods ◽  
Software Reliability ◽  
Formal Specification ◽  
Small Scale ◽  
Real Time Systems ◽  
Time System ◽  
Real Time System ◽  
Hard Real Time ◽  
Time Systems

Aktiviti menguji sama ada sistem masa nyata memenuhi spesifikasi masa dan keserempakan adalah sangat penting. Salah satu bidang penyelidikan dalam bidang keboleh-percayaan perisian ialah teknik formal yang cuba untuk membuktikan kesahihan sesuatu atur cara dengan spesifikasinya. Oleh kerana masa dan keserampakan merupakan aspek yang penting dalam sistem masa nyata, keperluan untuk menggunakan teknik formal sebagai teknik untuk mengesahkan aspek masa dan keserempakan ini adalah amat tinggi. Kertas kerja ini mengkaji proses membina spesifikasi formal untuk sistem masa nyata berskala kecil dengan menggunakan teknik Z. Spesifikasi formal yang dibangunkan di dalam kertas kerja ini diharap dapat membantu proses penganalisisan fasa reka bentuk di awal proses pembangunan sistem. Kertas kerja ini juga diharap dapat menjadi rujukan kepada projek–projek teknik formal yang akan datang terutamanya projek yang berkaitan dengan sistem masa nyata berskala kecil. Kata kunci: Kebolehpercayaan perisian; spesifikasi formal; Z; masa nyata; sistem berskala kecil. The task of checking whether a real–time system satisfies its timing and concurrency specifications is extremely important. One major area of research addressing software reliability aspect is called formal method, which attempts to prove the correctness of programs with respect to system specifications. Since, timing and concurrency properties can very important in the operation of real–time systems, there is a need for applying formal methods to verify timing properties. This paper investigates the process of building a formal specification of a small-scale embedded hard real–time systems using Z. It is expected that the formal specification presented in this paper can provide assistance in analysing design trade–offs early in the development process. It is also expected that this paper can act as the foundation for any upcoming formal methods related project especially for small-scale real–time systems project. Key words: Software reliability; formal specification; Z; hard real-time; small-scale systems

An Overview of the SUSI Control System

1994 ◽  
Vol 158 ◽  
pp. 181-183
Author(s):  
R. A. Minard ◽  
A. J. Booth ◽  
W. J. Tango ◽  
T. Ten Brummelaar ◽  
H. Bennis ◽  
...  
Keyword(s):  
Operating System ◽  
Control System ◽  
Real Time ◽  
Network Protocols ◽  
Time System ◽  
Real Time System ◽  
Real Time Operating System ◽  
Multiple Processors ◽  
Synchronous Operation

The SUSI control system is a distributed real-time system currently consisting of 17 processors. A custom real-time operating system and network protocols ensure synchronous operation of servo loops across multiple processors.

scholarly journals Contention-Free Scheduling for Mixed-Criticality Multiprocessor Real-Time System

Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1515
Author(s):  
Hyeongboo Baek ◽  
Kilho Lee
Keyword(s):  
Real Time ◽  
Schedulability Analysis ◽  
Multiprocessor Systems ◽  
Real Time Systems ◽  
Time System ◽  
Real Time System ◽  
Scheduling Policy ◽  
And Performance ◽  
Time Systems ◽  
Mixed Criticality

Zero-laxity (ZL) and contention-free (CF) policies have received considerable attention owing to their simplicity and applicability to real-time systems equipped with symmetry multiprocessors. Recently, the ZL policy for mixed-criticality (MC) systems has been proposed and studied, but the applicability to and performance of the CF policy for MC systems have not been investigated yet. In this paper, we propose the CF policy (as a scheduling policy) for MC symmetry multiprocessor systems, referred to as the MC systems tailored CF policy (MC-CF), and a schedulability analysis in support thereof. We define the notion of contention-free slots for two different criticalities (of MC systems) of tasks, propose a technique to limit the amount to be utilized for each task by defining an upper bound, and subsequently explain the way in which the contention-free slots are systematically utilized to improve the schedulability of MC symmetry multiprocessor systems. Following this, we develop a deadline analysis (DA) for MC-CF. Using our experimental results under various environmental settings, we demonstrate that MC-CF can significantly improve the schedulability of fixed-priority scheduling.

Sign in / Sign up

Export Citation Format

Share Document