Name
Abstract | ||
|---|---|---|
Considers 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 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 ◊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. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1109/TC.2002.1024738 | IEEE Trans. Computers |
Keywords | Field | DocType |
asynchronous system model,incoming request,processor scheduling,nonreplicated system,agreement,atomic broadcast problem,failure detector,group priority inversion,priority inversion problem,broadcasting,request scheduling protocol,fault tolerant computing,timed asynchronous system,processor group,network servers,group priority inversion problem,asynchronous system,fault-tolerant real-time applications,consistent predictable request processing,access protocols,replicated servers,critical server replication,total ordering enforcement,actively replicated system,real-time systems,priority inversion,predictive models,detectors,real time systems,protocols,inverse problem,synchronization,total order,fault tolerant,atomic broadcast | Priority ceiling protocol,Atomic broadcast,Computer science,Scheduling (computing),Computer network,Real-time computing,Distributed computing,Asynchronous system,Deadline-monotonic scheduling,Parallel computing,Priority inversion,Priority inheritance,Dynamic priority scheduling | Journal |
Volume | Issue | ISSN |
51 | 8 | 0018-9340 |
Citations | PageRank | References |
4 | 0.40 | 20 |
Authors | ||
5 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yun Wang | 1 | 107 | 20.55 |
| Emmanuelle Anceaume | 2 | 211 | 29.98 |
| Francisco Brasileiro | 3 | 388 | 27.99 |
| Fabíola Greve | 4 | 91 | 11.20 |
| Michel Hurfin | 5 | 266 | 29.30 |