Scheduling Self-Suspending Real-Time Tasks with Rate-Monotonic Priorities

Author(s):  
Karthik Lakshmanan ◽  
Ragunathan Rajkumar
Keyword(s):  
2019 ◽  
Vol 29 ◽  
pp. 03002 ◽  
Author(s):  
Mãdãlin-Dorin Pop

The studies and real situations shown that the traffic congestion is one of nowadays highest problems. This problem wassolved in the past using roundabouts and traffic signals. Taking in account the number of cars that is increasing continuously, we can see that past approaches using traffic lights with fixed-time controller for traffic signals timing is obsolete. The present and the future is the using of Intelligent Transportation Systems. Traffic lights systems should be aware about realtime traffic parameters and should adapt accordingly to them. The purpose of this paper is to present a new approach to control traffic signals using rate-monotonic scheduling. Obtained results will be compared with the results obtained by using others real-time scheduling algorithms.


ICCKE 2013 ◽  
2013 ◽  
Author(s):  
Amin Rezaeian ◽  
Mahmoud Naghibzadeh ◽  
Peyman Neamatollahi

Author(s):  
Leena Das ◽  
Sourav Mohapatra ◽  
Durga Prasad Mohapatra

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


2014 ◽  
Vol 651-653 ◽  
pp. 1933-1936
Author(s):  
Feng Xiang Zhang

This paper focus on the schedulability analysis of fixed priority servers. A number of fixed priority servers and their schedulability analysis are reviewed, these results and properties can be used for constructing systems with different timing constraints, where real-time tasks with hard deadlines and the soft aperiodic tasks can be scheduled in the same system. The aperiodic tasks in the fixed priority servers are not preemptable, and they are scheduled in a first-come first-served manner. There is only one server with many periodic or sporadic tasks in the system. The tasks and the server are scheduled by a fixed priority algorithm such as rate monotonic or deadline monotonic.


Sign in / Sign up

Export Citation Format

Share Document