We investigate here the performance implications of supporting transaction atomicity in a distributed real-time database system. Using a detailed simulation model of a firm-deadline distributed real-time database system, we profile the real-time performance of a representative set of commit protocols. A new commit protocol that is designed for the real-time domain and allows transactions to `optimistically' read uncommitted data is also proposed and evaluated. The experimental results show that data distribution has a significant influence on the real-time performance and that the choice of commit protocol clearly affects the magnitude of this influence. Among the protocols evaluated, the new optimistic commit protocol provides the best performance for a variety of workloads and system configurations.
CITATION STYLE
Gupta, R., Haritsa, J., Ramamritham, K., & Seshadri, S. (1996). Commit processing in distributed real-time database systems. In Proceedings - Real-Time Systems Symposium (pp. 220–229). https://doi.org/10.1109/real.1996.563719
Mendeley helps you to discover research relevant for your work.