Abstract
An algorithm that integrates real-time scheduling with replication control is presented. The algorithm adopts a token-based scheme for replication control and attempts to balance the urgency of real-time transactions with the conflict resolution policies. In addition, the algorithm employs epsilon-serializability (ESR), a correctness criterion that is less stringent than conventional one-copy serializability. The algorithm is flexible and very practical, since no prior knowledge of data requirements or execution time of each transaction is required.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 12th International Conference on Distributed Computing Systems, ICDCS 1992 |
| Publisher | Institute of Electrical and Electronics Engineers Inc. |
| Pages | 144-151 |
| Number of pages | 8 |
| ISBN (Electronic) | 0818628650 |
| DOIs | |
| State | Published - 1992 |
| Event | 12th International Conference on Distributed Computing Systems, ICDCS 1992 - Yokohama, Japan Duration: 9 Jun 1992 → 12 Jun 1992 |
Publication series
| Name | Proceedings - International Conference on Distributed Computing Systems |
|---|---|
| Volume | 1992-June |
Conference
| Conference | 12th International Conference on Distributed Computing Systems, ICDCS 1992 |
|---|---|
| Country/Territory | Japan |
| City | Yokohama |
| Period | 9/06/92 → 12/06/92 |
Bibliographical note
Publisher Copyright:© 1992 IEEE.