Mechanisms for reliable distributed real-time operating systems: The Alpha Kernel
Mechanisms for reliable distributed real-time operating systems: The Alpha Kernel
Holistic schedulability analysis for distributed hard real-time systems
Microprocessing and Microprogramming - Parallel processing in embedded real-time systems
Improved algorithms for synchronizing computer network clocks
IEEE/ACM Transactions on Networking (TON)
Priority Inheritance Protocols: An Approach to Real-Time Synchronization
IEEE Transactions on Computers
Fast Asynchronous Uniform Consensus in Real-Time Distributed Systems
IEEE Transactions on Computers
Deadline Assignment in a Distributed Soft Real-Time System
IEEE Transactions on Parallel and Distributed Systems
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
On the Impact of Fast Failure Detectors on Real-Time Fault-Tolerant Systems
DISC '02 Proceedings of the 16th International Conference on Distributed Computing
Admission Control for Soft-Transactions in ACCORD
RTAS '97 Proceedings of the 3rd IEEE Real-Time Technology and Applications Symposium (RTAS '97)
Schedulability Analysis for Tasks with Static and Dynamic Offsets
RTSS '98 Proceedings of the IEEE Real-Time Systems Symposium
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
Response Time Analysis for Tasks Scheduled under EDF within Fixed Priorities
RTSS '03 Proceedings of the 24th IEEE International Real-Time Systems Symposium
IEEE Transactions on Software Engineering
Improved Schedulability Analysis of Real-Time Transactions with Earliest Deadline Scheduling
RTAS '05 Proceedings of the 11th IEEE Real Time on Embedded Technology and Applications Symposium
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: models and algorithms
Utility accrual real-time scheduling: models and algorithms
Distributed real-time specification for Java: a status report (digest)
JTRES '06 Proceedings of the 4th international workshop on Java technologies for real-time and embedded systems
SRDS '06 Proceedings of the 25th IEEE Symposium on Reliable Distributed Systems
Evolving mach 3.0 to a migrating thread model
WTEC'94 Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference
On distributed real-time scheduling in networked embedded systems in the presence of crash failures
SEUS'07 Proceedings of the 5th IFIP WG 10.2 international conference on Software technologies for embedded and ubiquitous systems
Implementing reliable distributed real-time systems with the Θ-model
OPODIS'05 Proceedings of the 9th international conference on Principles of Distributed Systems
About 15 years of real-time Java
Proceedings of the 10th International Workshop on Java Technologies for Real-time and Embedded Systems
| Hi-index | 0.00 |
We consider the problem of recovering from the failures of distributable threads (“threads”) in distributed real-time systems that operate under runtime uncertainties including those on thread execution times, thread arrivals, and node failure occurrences. When a thread experiences a node failure, the result is a broken thread having an orphan. Under a termination model, the orphans must be detected and aborted, and exceptions must be delivered to the farthest, contiguous surviving thread segment for resuming thread execution. Our application/scheduling model includes the proposed distributable thread programming model for the emerging Distributed Real-Time Specification for Java (DRTSJ), together with an exception-handler model. Threads 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 higher importance threads are always favored over lower importance ones, irrespective of thread urgency as specified by their time constraints. We present a thread scheduling algorithm called HUA and a thread integrity protocol called TPR. We show that HUA and TPR bound the orphan cleanup and recovery time with bounded loss of the best-effort property. Our implementation experience for HUA/TPR in the Reference Implementation of the proposed programming model for the DRTSJ demonstrates the algorithm/protocol's effectiveness.