Issue No. 08 - August (2002 vol. 51)
<p>We consider the priority inversion problem in an actively replicated system. Priority inversion was originally defined in the context of nonreplicated systems. Therefore, we first introduce the concept of <it>group priority inversion</it>, 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 us 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.</p>
Priority inversion, replicated servers, timed asynchronous model, agreement.
Y. Wang, E. Anceaume, F. Brasileiro, F. Greve and M. Hurfin, "Solving the Group Priority Inversion Problem in a Timed Asynchronous System," in IEEE Transactions on Computers, vol. 51, no. , pp. 900-915, 2002.