Research on the Dynamic Priority Scheduling Algorithm of CAN Bus in Application-Layer

2018 ◽  
Vol 08 (09) ◽  
pp. 1447-1451
Author(s):  
博文 王
Keyword(s):  
Can Bus ◽  
Scheduling Algorithm ◽  
Application Layer ◽  
Priority Scheduling ◽  
Dynamic Priority

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 Applying Dynamic Priority Scheduling Scheme to Static Systems of Pinwheel Task Model in Power-Aware Scheduling

2014 ◽  
Vol 2014 ◽  
pp. 1-9
Author(s):  
Ye-In Seol ◽  
Young-Kuk Kim
Keyword(s):  
Energy Consumption ◽  
Scheduling Algorithm ◽  
Priority Scheduling ◽  
Dynamic Priority ◽  
Task Model ◽  
Dynamic Voltage ◽  
Priority Method ◽  
Hard Real Time ◽  
Static Systems ◽  
Power Aware Scheduling

Power-aware scheduling reduces CPU energy consumption in hard real-time systems through dynamic voltage scaling (DVS). In this paper, we deal with pinwheel task model which is known as static and predictable task model and could be applied to various embedded or ubiquitous systems. In pinwheel task model, each task’s priority is static and its execution sequence could be predetermined. There have been many static approaches to power-aware scheduling in pinwheel task model. But, in this paper, we will show that the dynamic priority scheduling results in power-aware scheduling could be applied to pinwheel task model. This method is more effective than adopting the previous static priority scheduling methods in saving energy consumption and, for the system being still static, it is more tractable and applicable to small sized embedded or ubiquitous computing. Also, we introduce a novel power-aware scheduling algorithm which exploits all slacks under preemptive earliest-deadline first scheduling which is optimal in uniprocessor system. The dynamic priority method presented in this paper could be applied directly to static systems of pinwheel task model. The simulation results show that the proposed algorithm with the algorithmic complexity ofO(n) reduces the energy consumption by 10–80% over the existing algorithms.

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 Improvement of the Dynamic Priority Scheduling Algorithm Based on a Heapsort

IEEE Access ◽  
2019 ◽  
Vol 7 ◽  
pp. 68503-68510 ◽  
Author(s):  
Shanshan Meng ◽  
Qiang Zhu ◽  
Fei Xia
Keyword(s):  
Scheduling Algorithm ◽  
Priority Scheduling ◽  
Dynamic Priority
Sign in / Sign up

Export Citation Format

Share Document