Feasibility analysis of hard real-time periodic tasks

Authors:
Moonju Park;Yookun Cho
Affiliations:
UMTS Laboratory, LG Electronics, 1042 Emerald BD, Hogye-Dong, Dongan-Gu, Anyang City, Kyungi-Do, 431-080 South Korea;School of Electrical Engineering and Computer Science, Seoul National University, Seoul, South Korea
Venue:
Journal of Systems and Software - Special issue: Performance modeling and analysis of computer systems and networks
Year:
2004

Citing 9
Cited 0

Some Results of the Earliest Deadline Scheduling Algorithm

IEEE Transactions on Software Engineering
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
An efficient feasibility test method for hard real-time periodic tasks

RTSS'10 Proceedings of the 21st IEEE conference on Real-time systems symposium

Quantified Score

Hi-index	0.00

Visualization

Abstract

The problem of determining the feasibility of hard real-time periodic tasks is known to be co-NP-complete when there exists a task with relative deadline shorter than its period. Thus "Processor Demand Approach (PDA)" for synchronous task sets has been considered as a practical tool to solve the feasibility problem. PDA determines the feasibility of a task set by checking whether there exists a task whose deadline is missed by a certain time which is computed based on the characteristic of the task set. In this paper, we present a new method for feasibility test by combining PDA with the analysis methods for aperiodic scheduling. It is shown that the number of tests required of the new method to determine the feasibility is never greater than the smallest number of tests the existing algorithm requires. Although our method has pseudo-polynomial time complexity, experimental results show that the new method requires significantly less computation to determine feasibility.