Reliable transaction processing for real-time distributed database systems

Yong I Yoon, Song C Moon
1992 Microprocessing and Microprogramming  
When real-time applications require distributed transaction processing, both correct completion and timeliness should be satisfied. All previous commit protocols, however, fail to provide the timeliness for real-time processing. That is, methods for the timely completion do not always guarantee the correct completion or vice ~,ersa. In this paper, we propose s novel commit protocol, called an mteg~ted commst protocol (ICP), in which the correct completion is satisfied with timely completion for
more » ... distributed real-time transactions. The basic idea of ICP is that commit procedures for correct completion use the results of remote transactions which are timely executed, The timely execution is provided by the dynamic multilevel scheduling policy and the multi-version timestamp ordering scheme, t. INTRODUCTION Applications including telecommunication systems and military systems stimulated database research towards real-time database systems [6]. They require a timely completion such that data manipulation operations should be executed within a specified deadline. The real-time database systems need to operate in a distributed fashion to support inherent distributed nature of the applications. A distributed program requires a group of cooperating transactions distributed in the whole system. It is essential for the system to complete correctly so that the group of transactions behave consistently in the presence of failures. A key property of the correct completion is failure atomicity that means either a program has the intended results, or it has no results at all [1].
doi:10.1016/0165-6074(92)90103-e fatcat:7suaj6k2kfcndn2pda3zype3he