Real-time concurrency control with analytic worstcase latency guarantees (1993) [2 citations — 2 self]
by Lihchyun Shu, Michal Young
In Proceedings of the 10th IEEE Workshop on Real-Time Operating Systems and Software
ftp://ftp.cs.purdue.edu/pub/serc/tech-reports/By-School/Purdue/TR136P.PS.Z
Add To MetaCart
Abstract:
Meeting hard deadlines while also ensuring the integrity of shared data is a difficult problem in real-time systems design. We discuss the key differences between database concurrency control and concurrency control for hard-real-time systems and describe an approach to adapting advanced concurrency control techniques to systems requiring analytic worst-case latency guarantees. We describe an example concurrency control technique, implementable with simple and low-overhead algorithms and data structures, which completely avoids interference between queries and updaters. This report offers a high-level overview and introduction to the problem and approach. Details are provided in other reports [SY92a, SY92b].
Citations
| 1320 | Concurrency Control and Recovery in Database Systems – Bernstein, Hadzilacos, et al. - 1987 |
| 254 | Aperiodic Task Scheduling for Hard Real-Time Systems – Sprunt, Sha, et al. - 1989 |
| 19 | Simple rational guidance for chopping up transactions – Shasha, Simon, et al. - 1992 |
| 12 | Ragunathan Rajkumar, Sang Hyuk Son, and Chun-Hyon Chang. A real-time locking protocol – Sha - 1991 |
| 8 | Correctness Criteria and Concurrency Control for Real-Time Systems: A Survey – Shu, Young - 1992 |
| 1 | Multiversion integrated concurrecy control for hard real-time systems – Shu, Young - 1992 |
