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

Author(s):  
Ajitesh Kumar ◽  
Sanjai Kumar Gupta

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.

Author(s):  
Sanjay Singh ◽  
Nishant Tripathi ◽  
Anil Kumar Chaudhary ◽  
Mahesh Kumar Singh

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.


Author(s):  
JI Y. LEE ◽  
KYO C. KANG ◽  
GERARD J. KIM ◽  
HYE J. KIM

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.


Author(s):  
Gulistan Ahmead Ismael ◽  
Azar Abid Salih ◽  
Adel AL-Zebari ◽  
Naaman Omar ◽  
Karwan Jameel Merceedi ◽  
...  

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.


Author(s):  
Radziah Mohamad ◽  
Dyg. Norhayati Abg. Jawawi ◽  
Safaai Deris ◽  
Rosbi Mamat

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


Symmetry ◽  
2020 ◽  
Vol 12 (9) ◽  
pp. 1515
Author(s):  
Hyeongboo Baek ◽  
Kilho Lee

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.


2013 ◽  
Vol 681 ◽  
pp. 65-71
Author(s):  
Xu Hui Wang

Embedded real-time systems are facing more and more security problems. Malicious attacks on the system from suspicious or malicious code and the change of system hardware state could lead to system exception, resulting in system reliability and security deteriorated. This paper summarizes the characteristics of embedded real-time system and its special requirements for security, analyses security problems faced by embedded real-time system and defects of programming languages. And then put forward methods to improve the safety of embedded real-time system, providing a new security the idea for solving the embedded real-time system security.


2014 ◽  
Vol 696 ◽  
pp. 266-270
Author(s):  
Hong Li Chen

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.


Energies ◽  
2020 ◽  
Vol 13 (13) ◽  
pp. 3346
Author(s):  
Mahmoud Hussein ◽  
Ahmed I. Galal ◽  
Emad Abd-Elrahman ◽  
Mohamed Zorkany

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.


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.


Author(s):  
Mitsuhiro Okada

Abstract Hilbert remarked in the introductory part of his most famous finitism address (1925  [1]) that “[t]he infinite divisibility of a continuum is an operation that is present only in our thought”, which means that no natural event or matter is infinitely divisible in reality. We recall that Scedrov’s group including the author started logical analysis of real time systems with the principle similar to Hilbert’s no-infinite divisibility claim, in  [2]. The author would like to note some early history of the group’s work on logical analysis of real time system as well as some remark related to Hilbert’s claim of no-infinite divisibility.


Sign in / Sign up

Export Citation Format

Share Document