Response Time Analysis of Asynchronous Real-Time Systems

Authors:
Guillem Bernat
Affiliations:
Real-Time Systems Research Group, Department of Computer Science, University of York, York, YO10 5DD, UK bernat@cs.york.ac.uk
Venue:
Real-Time Systems
Year:
2003

Citing 10
Cited 3

Aperiodic servers in a deadline scheduling environment

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

Journal of the ACM (JACM)
Weakly Hard Real-Time Systems

IEEE Transactions on Computers
Real-Time Systems and Programming Languages: ADA 95, Real-Time Java, and Real-Time POSIX

Real-Time Systems and Programming Languages: ADA 95, Real-Time Java, and Real-Time POSIX
Priority Inheritance Protocols: An Approach to Real-Time Synchronization

IEEE Transactions on Computers
Fixed-Priority Sensitivity Analysis for Linear Compute Time Models

IEEE Transactions on Software Engineering
Weakly Hard Real-time Constraints on Controller Area Network

ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
On the Efficient Scheduling of Non-Periodic Tasks in Hard Real-Time Systems

RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
New Results on Fixed Priority Aperiodic Servers

RTSS '99 Proceedings of the 20th IEEE Real-Time Systems Symposium
Enhanced fixed-priority scheduling with (m,k)-firm guarantee

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

Schedulability of aperiodic tasks in hybrid process model

PDCS '07 Proceedings of the 19th IASTED International Conference on Parallel and Distributed Computing and Systems
Response time bounds for event handlers in the priority based functional reactive programming (P-FRP) paradigm

Proceedings of the 2012 ACM Research in Applied Computation Symposium
Feasibility interval for the transactional event handlers of P-FRP

Journal of Computer and System Sciences

Quantified Score

Hi-index	0.00

Visualization

Abstract

In asynchronous real-time systems the time when all events occur can not be predicted beforehand. Systems with sporadic tasks, or that operate a protocol for sharing resources like the priority ceiling protocol, for example, are asynchronous real-time systems. In this paper, we present a sufficient and efficient response time based analysis technique for computing Ri(k), the worst case response time at each invocation k of the periodic tasks of real-time asynchronous systems. In addition, efficient idle time computation for asynchronous systems is presented. This analysis technique can be applied to the analysis of several process models including weakly hard real-time systems, and slack management techniques like aperiodic servers and slack stealing algorithms. It is also shown that the pattern of response times of tasks in a hyperperiod is pseudoperiodic and that the maximum response time instants tend to occur evenly separated within the hyperperiod.