The PROMPT Real - Time Commit
نویسندگان
چکیده
| We investigate the performance implications of providing transaction atomicity for rm-deadline real-time applications operating on distributed data. Using a detailed simulation model, the real-time performance of a representative set of classical transaction commit protocols is evaluated. The experimental results show that data distribution has a signiicant innuence on real-time performance and that the choice of commit protocol clearly aaects the magnitude of this innuence. We also propose and evaluate a new commit protocol, PROMPT (Permits Reading Of Modiied Prepared-data for Timeliness), that is speciically designed for the real-time domain. PROMPT allows transactions to \optimistically" borrow, in a controlled manner, the updated data of transactions currently in their commit phase. This controlled borrowing reduces the data inaccessibility and the priority inversion that is inherent in distributed real-time commit processing. A simulation-based evaluation shows PROMPT to be highly successful, as compared to the classical commit protocols, in minimizing the number of missed transaction deadlines. In fact, its performance is close to the best on-line performance that could be achieved using the optimistic lending approach. Further, it is easy to implement and incorporate in current database system software. Finally, PROMPT is compared against an alternative priority inheritance-based approach to addressing priority inversion during commit processing. The results indicate that priority inheritance does not provide tangible performance beneets.
منابع مشابه
The PROMPT Real-Time Commit Protocol
ÐWe investigate the performance implications of providing transaction atomicity for firm-deadline real-time applications operating on distributed data. Using a detailed simulation model, the real-time performance of a representative set of classical transaction commit protocols is evaluated. The experimental results show that data distribution has a significant influence on real-time performanc...
متن کاملACTIVE-A Real Time Commit Protocol
Many existing real time commit protocols try to improve system performance by allowing a committing cohort to lend its data to an executing cohort, thus reducing data inaccessibility. They block the borrower from sending WORKDONE/PREPARED message and restrict them from lending data so that transaction abort chain is limited to one. Thus, transaction execution time increases. This paper proposes...
متن کاملSPEEDITY-A Real Time Commit Protocol
This paper presents Shadow, Piggy bag, Elemental External Dependency Inversion and in Time Yielding (SPEEDITY) commit protocol for distributed real time database systems (DRTDBS). Here, only abort dependent cohort having deadline greater than a specific value (Tshadow_creation_time) needs to forks off a replica of itself called a shadow, whenever it borrows dirty value of a data item. Commit-on...
متن کاملIn Search for an E cient Real - Time Atomic Commit Protocol
The purpose of this paper is to report on the rst step in our quest for an e cient atomic commit protocol in real time databases This includes the development of real time implicit yes vote RT IYV a new real time atomic commit protocol In contrast to other real time commit protocols that provide for semantic atomicity RT IYV is designed to ensure the traditional notion of transaction atomicity ...
متن کاملCommit Processing in Distributed Real-Time Database Systems - Real-Time Systems Symposium, 1996., 17th IEEE
W e investigate here the performance implications of supporting transaction atomicity in a distributed realtime database system. Using a detailed simulation model of a firm-deadline distributed real-time database sgstem, we profile the real-time performance of a representative set of commit protocols. A new commit protocol that i s designed for the real-time domain and allows transactions to “o...
متن کامل