Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
Dependability Modeling and Evaluation of Software Fault-Tolerant Systems
IEEE Transactions on Computers
Scheduling hard real-time systems: a review
Software Engineering Journal - Special issue on real-time software
Adaptive fault-tolerance in complex real-time distributed computer system applications
Computer Communications - Special issue on software aspects of future trends in distributed systems
On the competitiveness of on-line real-time task scheduling
Real-Time Systems
Determining Redundancy Levels for Fault Tolerant Real-Time Systems
IEEE Transactions on Computers - Special issue on fault-tolerant computing
A reflective architecture for real-time operating systems
Advances in real-time systems
Dover: An Optimal On-Line Scheduling Algorithm for Overloaded Uniprocessor Real-Time Systems
SIAM Journal on Computing
Value-density algorithms for the deliberation-scheduling problem
ACM SIGART Bulletin
Scheduling for Overload in Real-Time Systems
IEEE Transactions on Computers
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Probability and Statistics with Reliability, Queuing and Computer Science Applications
Probability and Statistics with Reliability, Queuing and Computer Science Applications
On the Reflective Nature of the Spring Kernel
Prozeßrechnersysteme '91, Automatisierungs- und Leitsysteme in den neunziger Jahren
Flexible scheduling for adaptable real-time systems
RTAS '95 Proceedings of the Real-Time Technology and Applications Symposium
Value-cognizant admission control for RTDB systems
RTSS '96 Proceedings of the 17th IEEE Real-Time Systems Symposium
Opening Keynote Address Omniscience, Consensus, Autonomy: Three Tempting Roads to Responsiveness
SRDS '95 Proceedings of the 14TH Symposium on Reliable Distributed Systems
Best-effort decision-making for real-time scheduling
Best-effort decision-making for real-time scheduling
| Hi-index | 0.00 |
This paper deals with planningsystem activities to support applications that have differentcontrasting requirements including timing constraints on tasksexecution and correctness requirements. Our approach is basedon a simple yet effective formulation of a value structure associatedto the application tasks. Values are associated to each relevantoutcome thus accounting for successful executions as well asfor those which violate the application requirements. Moreoverwe assume degradable real time systems equipped with severalexecution techniques characterised by different execution costsand different levels of fulfilment of requirements (and associatedreward). We propose an admission algorithm to select the partof the offered load to be executed, should overload occur. Forall the admitted tasks the algorithm selects also the most suitableexecution technique (among those available) to optimise the expectedcumulated reward. We show that the algorithm provides the bestsolution to the optimisation problem resorting to the linearprogramming theory. Then we discuss the applicability of thisresult to systems operating in dynamic environments. A plannercomponent is defined, responsible to collect information on thecurrent status of the system and of its environment. The plannerdecides when a new ’plan‘ is required, and dynamically executesthe admission algorithm to properly tune the usage of systemresources.