On Scheduling Exception Handlers in Dynamic Real-Time Systems
نویسندگان
چکیده
We consider the problem of scheduling exception handlers in real-time systems that operate under runtime uncertainties including those on execution times, activity arrivals, and failure occurrences. The application/scheduling model includes activities and their exception handlers that are subject to time/utility function (TUF) time constraints and an utility accrual (UA) optimality criterion. A key underpinning of the TUF/UA scheduling paradigm is the notion of “best-effort” where high importance activities are always favored over low importance ones, irrespective of activity urgency. (This is in contrast to classical admission control models which favor feasible completion of admitted activities over admitting new ones, irrespective of activity importance.) We consider a transactional style activity execution paradigm, where handlers that are released when their activities fail (e.g., due to time constraint violations) abort the failed activities after performing recovery actions. We present a scheduling algorithm called Handler-assured Utility accrual Algorithm (or HUA) for scheduling activities and their handlers. We show that HUA’s properties include bounded-time completion for handlers and bounded loss of the best-effort property. Our implementation experience on a RTSJ (Real-Time Specification for Java) Virtual Machine demonstrates the algorithm’s effectiveness.
منابع مشابه
Examining Real-Time Scheduling Exceptions in Complex Planning Domains using Decision Support Systems
Decision support systems are intended to assist human decision makers. In complex, dynamic domains a proper task apportionment between the computer and the human decision maker largely dictates system success. Task apportionment is even more critical when exceptions are introduced into the system. We examine an airbase logistics scheduling and planning system, a complex and dynamic application ...
متن کاملAccounting for interrupt handling costs in dynamic priority task systems
In order to apply the results of formal studies of real-time task models, a practitioner must account for the effects of phenomena present in the implementation but not present in the formal model. We study the feasibility and schedulability problems for periodic tasks that must compete for the processor with interrupt handlers –– tasks that are assumed to always have priority over application ...
متن کاملAsynchronous Event Handling and Real-time Threads in the Real-time Specification for Java
This paper discusses the role and implementation of asynchronous event handlers in the Real-time specification for Java (RTSJ). For non-blocking handlers, an implementation model whereby all heap-using handlers are serviced by a single thread and all no-heap handlers are serviced by another server thread is proposed and schedulability analysis is derived. The model is shown to have bounded prio...
متن کاملDynamic Cargo Trains Scheduling for Tackling Network Constraints and Costs Emanating from Tardiness and Earliness
This paper aims to develop a multi-objective model for scheduling cargo trains faced by the costs of tardiness and earliness, time limitations, queue priority and limited station lines. Based upon the Islamic Republic of Iran Railway Corporation (IRIRC) regulations, passenger trains enjoy priority over other trains for departure. Therefore, the timetable of cargo trains must be determined based...
متن کاملOptimal Scheduling of CHP-based Microgrid Under Real-Time Demand Response Program
Microgrid (MG) is considered as a feasible solution to integrate the distributed energy sources. In this paper, optimal scheduling of a grid-connected MG is investigated considering different power sources as combined heat and power (CHP) units, only power and heat generating units, and battery storage systems. Two different feasible operating regions are considered for the CHP units. In additi...
متن کامل