Dynamic Real-time Scheduling of Firm Periodic Tasks with Hard and Soft Aperiodic Tasks

Authors:
Audrey Marchand;Maryline Silly-Chetto
Affiliations:
Institut de Recherche en Communications et Cybernetique de Nantes, University of Nantes, Nantes Cedex 03, France 44321;Institut de Recherche en Communications et Cybernetique de Nantes, University of Nantes, Nantes Cedex 03, France 44321
Venue:
Real-Time Systems
Year:
2006

Citing 17
Cited 2

Misconceptions About Real-Time Computing: A Serious Problem for Next-Generation Systems

Computer
Some Results of the Earliest Deadline Scheduling Algorithm

IEEE Transactions on Software Engineering
Dynamic scheduling of real-time tasks under precedence constraints

Real-Time Systems
The Deferrable Server Algorithm for Enhanced Aperiodic Responsiveness in Hard Real-Time Environments

IEEE Transactions on Computers
Aperiodic servers in a deadline scheduling environment

Real-Time Systems
Algorithms and optimality of scheduling soft aperiodic requests in fixed-priority preemptive systems

Real-Time Systems
An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic-Priority Preemptive Systems

IEEE Transactions on Software Engineering
Minimizing Aperiodic Response Times in a Firm Real-Time Environment

IEEE Transactions on Software Engineering
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment

Journal of the ACM (JACM)
Optimal Deadline Assignment for Scheduling Soft Aperiodic Tasks in Hard Real-Time Environments

IEEE Transactions on Computers
The EDL Server for Scheduling Periodic and Soft AperiodicTasks with Resource Constraints

Real-Time Systems
Real-Time Systems

Real-Time Systems
A Dynamic Priority Assignment Technique for Streams with (m, k)-Firm Deadlines

IEEE Transactions on Computers
Optimal Scheduling for Fault-Tolerant and Firm Real-Time Systems

RTCSA '98 Proceedings of the 5th International Conference on Real-Time Computing Systems and Applications
Robust aperiodic scheduling under dynamic priority systems

RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Skip-Over: algorithms and complexity for overloaded systems that allow skips

RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Exploiting skips in periodic tasks for enhancing aperiodic responsiveness

RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium

A dynamic scheduler for real-time periodic tasks with quality of service requirements

AIC'06 Proceedings of the 6th WSEAS International Conference on Applied Informatics and Communications
Scheduling on-demand data broadcast in mixed-type request environments

Computer Networks: The International Journal of Computer and Telecommunications Networking

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we address the problem of the dynamic scheduling of skippable periodic task sets (i.e., period tasks allowing occasional skips of instances), together with aperiodic tasks. Scheduling of tasks is handled thanks to the merging of two existing approaches: the Skip-Over task model and the EDL (Earliest Deadline as Late as possible) aperiodic task server. The objective is to provide two on-line scheduling algorithms, namely EDL-RTO and EDL-BWP, in order to minimize the average response time of soft aperiodic requests, while ensuring that the QoS (Quality of Service) of periodic tasks will never be less than a specified bound. We also extend our results to the acceptance of sporadic tasks (i.e., aperiodic tasks with deadlines). We show that these novel scheduling algorithms have better performance compared to related algorithms regarding aperiodic response time and acceptance ratio.