Dynamic Priority Scheduling Algorithm to Improve Real-Time of CAN Bus Communication

2012 ◽  
pp. 261-268 ◽  
Author(s):  
Kaikai Guo ◽  
Jingzhao Li ◽  
Shanshan Wu ◽  
Xiaoqian Song ◽  
Xueqin Wu
Keyword(s):  
Real Time ◽  
Can Bus ◽  
Scheduling Algorithm ◽  
Priority Scheduling ◽  
Dynamic Priority

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 Penerapan Algoritma Dynamic Priority Scheduling pada Antrian Pencucian Mobil

2020 ◽  
Vol 2 (1) ◽  
pp. 29-35
Author(s):  
Rizki Setyawati ◽  
Adam Bachtiar Maulachela
Keyword(s):  
Human Error ◽  
Business Processes ◽  
System Development ◽  
Scheduling Algorithm ◽  
Functional System ◽  
Application Development ◽  
Priority Scheduling ◽  
Dynamic Priority ◽  
Prototype Development ◽  
Car Wash

Queue is a condition where the number of service recipients is higher than the number ofservice providers. This condition can cause a buildup of service recipients, and eventually,bottlenecks will occur. It faced by all service organizations that focus on service to customers.No exception is a car wash business whose business processes focus on providing fast andquality car wash services. But unfortunately, many car wash businesses get complaints fromcustomers, especially related to the queue buildup and unclear queue information received bycustomers. Therefore this study aims to produce a mobile-based car wash queue application,which includes a dynamic priority scheduling algorithm that functions as a queue manager.To carry out these objectives, a research methodology that is sequential and iterative used,namely, the software development methodology using the Rapid Application Development(RAD) model. This model consists of four phases: planning needs, prototype development,system development, and finally, testing. The Application test is finished with two approaches,namely testing of application code, specifically the application of dynamic priority schedulingalgorithm and testing of the overall functional system. From the test results, it knows that thecar wash queue application managed to sort customer orders based on the specified priorityrules based on the distance and time of the law. While the results of testing the systemfunctionality show that the application successfully manages a variety of errors, both causedby system failures and due to human error.

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 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.

Sign in / Sign up

Export Citation Format

Share Document