A memory efficient fast distributed real time commit protocol

Authors:
Udai Shanker;Manoj Misra;A. K. Sarje
Affiliations:
Department of Electronics & Computer Engineering, Indian Institute of Technology, Roorkee, Uttaranchal, India;Department of Electronics & Computer Engineering, Indian Institute of Technology, Roorkee, Uttaranchal, India;Department of Electronics & Computer Engineering, Indian Institute of Technology, Roorkee, Uttaranchal, India
Venue:
IWDC'05 Proceedings of the 7th international conference on Distributed Computing
Year:
2005

Citing 3
Cited 1

The PROMPT Real-Time Commit Protocol

IEEE Transactions on Parallel and Distributed Systems
Main Memory Database Systems: An Overview

IEEE Transactions on Knowledge and Data Engineering
High performance distributed real-time commit protocol

Journal of Systems and Software

Distributed real time database systems: background and literature review

Distributed and Parallel Databases

Quantified Score

Hi-index	0.01

Visualization

Abstract

Most of the past researches [1], [2], [3] investigate the behavior of distributed real time commit protocols either under update or blind write model. The effect of both types of models has not been investigated collectively. These protocols also require a considerable amount of memory for maintaining temporary objects (data structure) created during execution of transactions and block the WORKDONE message if cohort is dependent. This paper presents an optimized distributed real time commit protocol (MEFCP) based on new locking scheme and write operation divided into update and blind write. The proposed protocol optimizes the memory required for maintaining the transient information of lender & borrower [1]. It also sends the WORKDONE message if borrower has locked the data in mode 2 only. We also compared MEFCP with PROMPT and 2SC commit protocols through simulation.