scholarly journals Analysis of thread schedulability in Huawei LiteOS

2021 ◽  
Vol 336 ◽  
pp. 05031
Author(s):  
Xiaochun Wang
Keyword(s):  
Operating System ◽  
Real Time ◽  
Scheduling Algorithm ◽  
Application Rate ◽  
Practical Application ◽  
Priority Scheduling ◽  
Real Time Operating System ◽  
Important Thing ◽  
Rate Monotonic ◽  
Rate Monotonic Scheduling

Huawei LiteOS is a real-time operating system. Thread schedulability is an important thing to be considered first when we use the RTOS in an application. There are a lot of methods to value thread schedulability in practical application. Rate monotonic scheduling algorithm is a widely used static priority scheduling algorithm. We discussed the thread schedulability in Huawei LiteOS.

scholarly journals Schedulability of Rate Monotonic Algorithm using Improved Time Demand Analysis for Multiprocessor Environment

2018 ◽  
Vol 8 (1) ◽  
pp. 429
Author(s):  
Leena Das ◽  
Sourav Mohapatra ◽  
Durga Prasad Mohapatra
Keyword(s):  
Real Time ◽  
Scheduling Algorithm ◽  
Demand Analysis ◽  
Priority Scheduling ◽  
Task Set ◽  
Rate Monotonic ◽  
Test Algorithm ◽  
Task Sets ◽  
Number Of Iterations ◽  
Better Than

<p>Real-Time Monotonic algorithm (RMA) is a widely used static priority scheduling algorithm. For application of RMA at various systems, it is essential to determine the system’s feasibility first. The various existing algorithms perform the analysis by reducing the scheduling points in a given task set. In this paper we propose a schedubility test algorithm, which reduces the number of tasks to be analyzed instead of reducing the scheduling points of a given task. This significantly reduces the number of iterations taken to compute feasibility. This algorithm can be used along with the existing algorithms to effectively reduce the high complexities encountered in processing large task sets. We also extend our algorithm to multiprocessor environment and compare number of iterations with different number of processors. This paper then compares the proposed algorithm with existing algorithm. The expected results show that the proposed algorithm performs better than the existing algorithms.</p>

scholarly journals Priority based round robin (PBRR) CPU scheduling algorithm

2019 ◽  
Vol 9 (1) ◽  
pp. 190
Author(s):  
Sonia Zouaoui ◽  
Lotfi Boussaid ◽  
Abdellatif Mtibaa
Keyword(s):  
Operating System ◽  
Real Time ◽  
Waiting Time ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Turnaround Time ◽  
Round Robin ◽  
New Approach ◽  
Real Time Operating System ◽  
Cpu Scheduling

<p>This paper introduce a new approach for scheduling algorithms which aim to improve real time operating system CPU performance. This new approach of CPU Scheduling algorithm is based on the combination of round-robin (RR) and Priority based (PB) scheduling algorithms. This solution maintains the advantage of simple round robin scheduling algorithm, which is reducing starvation and integrates the advantage of priority scheduling. The proposed algorithm implements the concept of time quantum and assigning as well priority index to the processes. Existing round robin CPU scheduling algorithm cannot be dedicated to real time operating system due to their large waiting time, large response time, large turnaround time and less throughput. This new algorithm improves all the drawbacks of round robin CPU scheduling algorithm. In addition, this paper presents analysis comparing proposed algorithm with existing round robin scheduling algorithm focusing on average waiting time and average turnaround time.</p>

scholarly journals Research on Real-Time System and Related Graph Task Model

2021 ◽  
Vol 2066 (1) ◽  
pp. 012054
Author(s):  
Juan Xiao ◽  
Song Wang ◽  
Sheng Duan ◽  
Shanglin Li
Keyword(s):  
Operating System ◽  
Real Time ◽  
Directed Graph ◽  
Scheduling Algorithm ◽  
Time Constraint ◽  
Time System ◽  
Real Time System ◽  
Real Time Operating System ◽  
Task Model ◽  
Time Accuracy

Abstract Generally speaking, real-time system is considered to be able to influence the environment by receiving and processing data, and returning calculation results rapid enough, so as to control the environment. In computer science, real-time system describes the software and hardware system affected by time constraints, and its correctness relies on the logical correctness of the function and the time when the result is generated. According to the main characteristics of real-time operating system, such as time constraint, predictability and reliability, it puts forward higher requirements for the time accuracy and reliability of real-time operating system. This paper first introduces the real-time system from its main characteristics, related concepts and scheduling algorithm. Then five classical graph based task models of real-time system are introduced. Finally, this paper introduces the directed graph realtime task model from two aspects of definition and semantics. As an extension of realtime system task model, directed graph real-time task model is considered to be able to provide real-time systems with stronger expressive power and support the formal study of time constraint problems.

Sign in / Sign up

Export Citation Format

Share Document