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 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 Improvising Reliability and Security in Multiple Relay Network using Optimal Scheduling

2019 ◽  
Vol 8 (2) ◽  
pp. 1243-1248
Keyword(s):  
Real Time ◽  
Random Network ◽  
Scheduling Algorithm ◽  
Data Communication ◽  
Attack Detection ◽  
Relay Network ◽  
Wireless Sensor ◽  
Delivery Ratio ◽  
Priority Scheduling ◽  
Byzantine Attacks

In the real-time scenario involving wireless sensor networks, the data forwarding and data gathering procedures are taking place from the remote environment. With the involvement of heterogeneous architecture and multi-hop data transmission paths, there lies a serious threat for secured data communication. There may be chances of data attacks either from the inside intruder or from the external intruder. The problem of data flow attack by adding malicious information, viz. Data injection attack and outside arbitrary attack, viz. Byzantine attacks are found to be more dangerous and cause vulnerability for the wireless sensor network. So improving the reliability and security in multi-relay networks is very much essential. In this work, the practical approach of detecting data injection and Byzantine attacks using the proposed method of random network coding is performed. Then, as improvisation measure, the priority scheduling algorithm is implemented to effectively schedule the data transfer. Real-time packets with highest priority in the distribution queue are placed first in the processing mechanism. The remaining packets are arranged based on the position of the sensor nodes and are placed in separate queues. Least priority packets can obstruct the dispensation of their direct higher precedence packets after waitlisted for a certain number of time frames. Simulation results using the NS2 environment show that using the priority scheduling algorithm has good performance values in terms of the packet delivery ratio, throughput and delay. Also, the attack detection metrics such as false positive ratio and detection ratio are also improved when using the priority scheduling algorithm. Thus an improvised priority algorithm for an uplink scheduler in WSN is implemented to increase the performance and detection metrics.

A Research on Dynamic Scheduling Algorithm of Real-Time Operating Systems on Uniprocessor

2011 ◽  
Vol 219-220 ◽  
pp. 40-44
Author(s):  
Kun Shang ◽  
Huan Ding
Keyword(s):  
Real Time ◽  
Operating Systems ◽  
Dynamic Scheduling ◽  
Scheduling Algorithm ◽  
Scheduling Algorithms ◽  
Priority Scheduling ◽  
The Real ◽  
Dynamic Priority ◽  
Important Measure

Real-Time operating systems not only request the logical correctness, but also request the correct computing results in a set time and the instant response to the real-time tasks. Therefore scheduling algorithms of real-time operating systems become an important measure to determine the real-time capability of a system. In this paper, we discuss the dynamic priority scheduling algorithm –Priority Inheritance Scheduling Algorithm. Then we analyze the algorithm from two aspects: description and schedulability.

scholarly journals Designing of 2-Stage CPU Scheduler Using Vague Logic

2014 ◽  
Vol 2014 ◽  
pp. 1-10 ◽  
Author(s):  
Supriya Raheja ◽  
Reena Dhadich ◽  
Smita Rajpal
Keyword(s):  
Fuzzy Theory ◽  
Scheduling Algorithm ◽  
Turnaround Time ◽  
Priority Scheduling ◽  
Performance Simulation ◽  
Inference System ◽  
Second Stage ◽  
Average Turnaround Time ◽  
Selection Of ◽  
Better Than

In operating system the CPU scheduler is designed in such a way that all the resources are fully utilized. With static priority scheduling the scheduler ensures that CPU time will be assigned according to the highest priority but ignores other factors; hence it affects the performance. To improve the performance, we propose a new 2-stage vague logic based scheduler. In first stage, scheduler handles the uncertainty of tasks using the proposed vague inference system (VIS). In second stage, scheduler uses a vague oriented priority scheduling (VOPS) algorithm for selection of next process. The goal of this work is to handle the uncertainty as well as to optimize both the average and the amount of variation with respect to performance matrices average waiting time, average turnaround time, and average normalized turnaround time. A simulation using MATLAB is also conducted to evaluate the performance. Simulation results show that the proposed scheduler using VOPS algorithm is better than the scheduler with traditional priority scheduling algorithm. Results are based on the dual concept of fuzzy theory and its generalization, vague theory. Additionally, this work comprises the evaluation of VOPS and shortest job first algorithm. The outcome of proposed VOPS algorithm is much closer to the result obtained by traditional shortest job first.

Sign in / Sign up

Export Citation Format

Share Document