An efficient feasibility test method for hard real-time periodic tasks

Authors:
Moonju Park;Yookun Cho
Affiliations:
School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Korea;School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Korea
Venue:
RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium
Year:
2000

Citing 7
Cited 1

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

Real-Time Systems
An extendible approach for analyzing fixed priority hard real-time tasks

Real-Time Systems
Improvement in feasibility testing for real-time tasks

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

Journal of the ACM (JACM)
Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms

Deadline Scheduling for Real-Time Systems: Edf and Related Algorithms
Distance-Constrained Scheduling and Its Applications to Real-Time Systems

IEEE Transactions on Computers
Improved Response-Time Analysis Calculations

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium

Feasibility analysis of hard real-time periodic tasks

Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper addresses the problem of deciding the feasibility of hard real-time periodic tasks. It is known to be co-NP problem to determine whether a task set is feasible on one processor, when there exists a task with relative deadline shorter than its period in the task set. For synchronous task sets, "Processor Demand Analysis (PDA)" has been considered as a practical tool to solve the feasibility problem. PDA determines the feasibility of a task set by checking whether a deadline is missed in an interval with finite length; this time interval is called "test interval." The efficiency of a feasibility test method will depend on the length of the test interval. In this paper, we present a new method for feasibility test of hard real-time periodic tasks. We show that the length of the test interval in our algorithm is shorter than or equal to existing ones theoretically. We also present experimental results that show the length of the test interval in our algorithm is significantly shorter than existing ones on the average.