Schedulability of aperiodic tasks in hybrid process model

Authors:
Huiting Chen;Kenneth Ong
Affiliations:
National University of Singapore, Singapore;National University of Singapore, Singapore
Venue:
PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Year:
2007

Citing 9
Cited 0

A Performance Analysis of Minimum Laxity and Earliest Deadline Scheduling in a Real-Time System

IEEE Transactions on Computers
Calculating the maximum, execution time of real-time programs

Real-Time Systems
Scheduling hard real-time systems: a review

Software Engineering Journal - Special issue on real-time software
A Multiframe Model for Real-Time Tasks

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

Journal of the ACM (JACM)
Generalized Multiframe Tasks

Real-Time Systems
A multiframe model for real-time tasks

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
On the Efficient Scheduling of Non-Periodic Tasks in Hard Real-Time Systems

RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Response Time Analysis of Asynchronous Real-Time Systems

Real-Time Systems

Quantified Score

Hi-index	0.01

Visualization

Abstract

The temporal validity of real-time execution is critical in a real-time system. In real-time system, there are many interests in the real-time scheduling. In this paper, the execution of periodic and aperiodic tasks is studied using a hybrid process model to examine the problem of the real-time scheduling. In this model, a new scheduling algorithm for acyclic task execution is proposed and the schedulability of acyclic execution is analyzed. A flexible sporadic server with a utilization bound and variable execution rate is applied to schedule the aperiodic tasks using the new algorithm, and also to do some simulation to investigate the performance of Flexible Sporadic Server (FSS) algorithm.