Revisiting fixed priority techniques

Authors:
Nasro Min-Allah;Wang Yong-Ji;Xing Jian-Sheng;Junxiang Liu
Affiliations:
Graduate University, Chinese Academy of Sciences, Beijing, P.R. China and Department of Computer Sciences, COMSATS University, Pakistan and Institute of Software, Chinese Academy of Sciences, Beij ...;Institute of Software, Chinese Academy of Sciences, Beijing, P.R. China;Graduate University, Chinese Academy of Sciences, Beijing, P.R. China and Institute of Software, Chinese Academy of Sciences, Beijing, P.R. China;Institute of Software, Chinese Academy of Sciences, Beijing, P.R. China
Venue:
EUC'07 Proceedings of the 2007 international conference on Embedded and ubiquitous computing
Year:
2007

Citing 11
Cited 5

Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor

Real-Time Systems
Priorities and protocols in hard real-time LANs: implementing a crisis-free system

Computer Communications
Rate monotonic scheduling in hard real-time systems

Information Processing Letters
An extendible approach for analyzing fixed priority hard real-time tasks

Real-Time Systems
A Feasibility Decision Algorithm for Rate Monotonic andDeadline Monotonic Scheduling

Real-Time Systems
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Real-Time Systems

Real-Time Systems
Engineering and Analysis of Fixed Priority Schedulers

IEEE Transactions on Software Engineering
Improved Response-Time Analysis Calculations

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
The Space of Rate Monotonic Schedulability

RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Schedulability Analysis of Periodic Fixed Priority Systems

IEEE Transactions on Computers

Utilization bound for periodic task set with composite deadline

Computers and Electrical Engineering
Power efficient rate monotonic scheduling for multi-core systems

Journal of Parallel and Distributed Computing
A comparative study of rate monotonic schedulability tests

The Journal of Supercomputing
Optimal task execution times for periodic tasks using nonlinear constrained optimization

The Journal of Supercomputing
Lowest priority first based feasibility analysis of real-time systems

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

Discrete scheduling is preferred over continuous scheduling for preemptive scheduling problems, however, classical continuous schedulability tests can not work effectively with discrete scheduling. This area of integrating discrete scheduling with continuous schedulability tests remains unexplored. Two contributions are made in this paper; firstly, an empty-slot method is introduced and extended to discrete schedulability analysis and secondly, an efficient exact feasibility test is proposed that has lower complexity in contrast to current feasibility tests in terms of reducing the number of scheduling points, where task feasibility is analyzed.