ePrints@IIScePrints@IISc Home | About | Browse | Latest Additions | Advanced Search | Contact | Help

More Optimism about Real-Time Distributed Commit Processing

Gupta, Ramesh and Haritsa, Jayant and Ramamritham, Krithi (1997) More Optimism about Real-Time Distributed Commit Processing. In: The 18th IEEE Real-Time Systems Symposium, 2-5 December, 1997, San Francisco, USA, pp. 123-133.

[img]
Preview
PDF
optimism.pdf

Download (280Kb)

Abstract

In [6], we proposed a new commit protocol, OPT, specially designed f o r use in distributed firm-deadline real-time database systems. OPT allows transactions to "optimistically" borrow uncommitted prepared data in a controlled manner: This controlled borrowing reduces the data inaccessibility and the priority inversion that is inherent in real-time commit processing. Experimental evaluations showed the new OPTprotocol to be highly successful, as compared to the classical distributed commit protocols, in minimizing the number of missed transaction deadlines. In this paper; we extend and improve upon this prior work in the following ways: First, we consider parallel distributed transactions whereas the previous study was restricted to sequential transactions. Second, we evaluate the extent to which OPT'S real-time performance is adversely affected by those cases where its optimism turns out to be misplaced. This is achieved by comparing OPTS performance with that of Shadow-OPT a protocol that augments OPT with the "shadow transaction" approach of [3] and ensures that the right decision about access to uncommitted data is always eventually made. In all of our experiments, which considered a wide range of workloads and system configurations, the difference between OPT and Shadow-OPT never exceeded ten percent. Moreover; the difference was reduced to less than two percent when OPT was enhanced with a simple "healthy lenders" heuristic. Finally, we compare the performance of OPT to that of an alternative priority inheritance-based approach to addressing priority inversion during commit processing. Our results show that the benefits that priority inheritance provides are much smaller than those obtained with the OPT approach.

Item Type: Conference Paper
Additional Information: ©1997 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Department/Centre: Division of Information Sciences > Supercomputer Education & Research Centre
Date Deposited: 25 Aug 2008
Last Modified: 19 Sep 2010 04:14
URI: http://eprints.iisc.ernet.in/id/eprint/1073

Actions (login required)

View Item View Item