Impossibility of distributed consensus with one faulty process
Journal of the ACM (JACM)
Unreliable failure detectors for reliable distributed systems
Journal of the ACM (JACM)
The weakest failure detector for solving consensus
Journal of the ACM (JACM)
Distributed systems (2nd Ed.)
Fault-tolerant broadcasts and related problems
Distributed systems (2nd Ed.)
GUARDS: A Generic Upgradable Architecture for Real-Time Dependable Systems
IEEE Transactions on Parallel and Distributed Systems
The Timed Asynchronous Distributed System Model
IEEE Transactions on Parallel and Distributed Systems
Real-Time Systems - Special issue on real-time computing in the age of the Web and the Internet
A General Framework to Solve Agreement Problems
SRDS '99 Proceedings of the 18th IEEE Symposium on Reliable Distributed Systems
Solving the Group Priority Inversion Problem in a Timed Asynchronous System
IEEE Transactions on Computers
Reducing Transaction Abort Rates with Prioritized Atomic Multicast Protocols
Euro-Par '08 Proceedings of the 14th international Euro-Par conference on Parallel Processing
On the Cost of Prioritized Atomic Multicast Protocols
OTM '09 Proceedings of the Confederated International Conferences, CoopIS, DOA, IS, and ODBASE 2009 on On the Move to Meaningful Internet Systems: Part I
| Hi-index | 0.00 |
Abstract: We consider the priority inversion problem in an actively replicated system. Priority inversion was originally defined in the context of non-replicated systems. Therefore we first introduce the concept of group priority inversion, which extends the concept of (local) priority inversion to the context of a group of processors that perform an actively replicated processing. We then present the properties of a request scheduling protocol to enforce a total ordering for the processing of requests while avoiding group priority inversions. These properties have been implemented in a protocol that relies on a timed asynchronous system model equipped with a failure detector of the class \diamond S. The proposed solution allows to replicate a critical server while ensuring that the processing of all the incoming requests is consistent (mechanisms for solving the atomic broadcast problem) and predictable (mechanisms for solving the group priority inversion problem). Thus, the described request scheduling protocol is a key component which can be used to develop fault tolerant real time applications in a timed asynchronous system.