Mechanisms for reliable distributed real-time operating systems: The Alpha Kernel
Mechanisms for reliable distributed real-time operating systems: The Alpha Kernel
An Adaptive, Distributed Airborne Tracking System ("process the Right Tracks at the Right Time")
Proceedings of the 11 IPPS/SPDP'99 Workshops Held in Conjunction with the 13th International Parallel Processing Symposium and 10th Symposium on Parallel and Distributed Processing
Best-effort decision-making for real-time scheduling
Best-effort decision-making for real-time scheduling
Scheduling dependent real-time activities
Scheduling dependent real-time activities
IEEE Transactions on Software Engineering
On Recent Advances in Time/Utility Function Real-Time Scheduling and Resource Management
ISORC '05 Proceedings of the Eighth IEEE International Symposium on Object-Oriented Real-Time Distributed Computing
Utility Accrual Real-Time Scheduling under Variable Cost Functions
RTCSA '05 Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
SRDS '06 Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems
| Hi-index | 0.00 |
We consider the problem of scheduling exception handlers in real-time systems that operate under run-time 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 on a Real-Time Java Virtual Machine demonstrates the algorithm's effectiveness.