A new approach for ACET based scheduling of soft real-time systems

Authors:
X. Guo;M. Boubekeur;J. Mc Enery;D. Hickey
Affiliations:
University College Cork, Department of Computer Science, Cork, Ireland;University College Cork, Department of Computer Science, Cork, Ireland;University College Cork, Department of Computer Science, Cork, Ireland;University College Cork, Department of Computer Science, Cork, Ireland
Venue:
ICCOMP'08 Proceedings of the 12th WSEAS international conference on Computers
Year:
2008

Citing 6
Cited 0

Determining average program execution times and their variance

PLDI '89 Proceedings of the ACM SIGPLAN 1989 Conference on Programming language design and implementation
Automatic average-case analysis of algorithms

Theoretical Computer Science - Theme issue on the algebraic and computing treatment of noncommutative power series
Average-case analysis of algorithms and data structures

Handbook of theoretical computer science (vol. A)
An introduction to the analysis of algorithms

An introduction to the analysis of algorithms
Data Structures and Algorithms

Data Structures and Algorithms
A Modular Calculus for the Average Cost of Data Structuring

A Modular Calculus for the Average Cost of Data Structuring

Quantified Score

Hi-index	0.00

Visualization

Abstract

In certain real-time systems worst-case execution time estimates often lead to a waste of resources. In hard real-time systems these types of estimates are essential to guarantee temporal requirements are met. However in soft-real time systems using other measurements, such as average-case timing, to complement the worst-case estimates can lead to better utilisation of resources while ensuring most, if not all, deadlines are met. In this paper we propose a methodology to integrate ACET information as a base for scheduling of soft real-time systems. We demonstrate the usability of the approach and illustrate it via a typical Real-Time Java sorting program.