Soft real-time task response time prediction in dynamic embedded systems

Authors:
Cássia Yuri Tatibana;Carlos Montez;Rômulo Silva De Oliveira
Affiliations:
Universidade Federal de Santa Catarina, Pós-Graduação em Engenharia Elétrica, Florianópolis, SC, Brazil;Universidade Federal de Santa Catarina, Pós-Graduação em Engenharia Elétrica, Florianópolis, SC, Brazil;Universidade Federal de Santa Catarina, Pós-Graduação em Engenharia Elétrica, Florianópolis, SC, Brazil
Venue:
SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
Year:
2007

Citing 6
Cited 1

Probabilistic performance guarantee for real-time tasks with varying computation times

RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
Real-Time Queueing Theory

RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Statistical Rate Monotonic Scheduling

RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
Stochastic Analysis of Periodic Real-Time Systems

RTSS '02 Proceedings of the 23rd IEEE Real-Time Systems Symposium
Web++: a system for fast and reliable web service

ATEC '99 Proceedings of the annual conference on USENIX Annual Technical Conference
Exploiting application workload characteristics to accurately estimate replica server response time

OTM'05 Proceedings of the 2005 Confederated international conference on On the Move to Meaningful Internet Systems - Volume >Part I

Deadline missing predictor based on aperiodic server queue length for distributed systems

Computer Communications

Quantified Score

Hi-index	0.00

Visualization

Abstract

The hardware infrastructure that provides the support of ubiquitous embedded computing may be shared by different applications. Many of those applications have real-time requirements, where events from the environment require the reaction of the computing system. The meeting of deadlines is hindered by the fast system dynamics. At the same time, the embedded system must deal with overload situations. In this paper we assume that an embedded application receives aperiodic requests with soft deadlines. Other unknown applications are executed simultaneously. The goal of this paper is to discuss algorithms to estimate the probability of a deadline to be met. The prediction of a deadline miss at the request arrival allows actions for damage control.