Abstract
In the studies of real-time concurrency control protocols (RT-CCPs), it is always assumed that earliest deadline first (EDF) is employed as the CPU scheduling algorithm. However, using purely (ultimate) deadline for priority assignment may not be suitable for distributed real-time database systems (DRTDBS) in which there exist different kinds of transactions, such as global and local transactions. In order to improve the performance, different priority assignment heuristics have to be used. In this paper, we have investigated the performance of different priority assignment heuristics for subtransactions in DRTDBS with optimistic concurrency control (OCC) protocol. It is found that the heuristics, which are suitable for distributed real-time systems, are not suitable for DRTDBS. We find that our proposed heuristic, which considers both deadline constraint and data contention, can give the best performance.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the International Workshop on Real-Time Computing Systems and Applications/RTCSA |
| Publisher | IEEE |
| Pages | 128-134 |
| Publication status | Published - 1996 |
| Event | Proceedings of the 1996 3rd International Workshop on Real-Time Computing Systems and Applications - Seoul, South Korea Duration: 30 Oct 1996 → 1 Nov 1996 |
Conference
| Conference | Proceedings of the 1996 3rd International Workshop on Real-Time Computing Systems and Applications |
|---|---|
| City | Seoul, South Korea |
| Period | 30/10/96 → 1/11/96 |
Fingerprint
Dive into the research topics of 'Impact of priority assignment on optimistic concurrency control in distributed real-time databases'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver