Skip to main content

A Memory Efficient Fast Distributed Real Time Commit Protocol

  • Conference paper
Distributed Computing – IWDC 2005 (IWDC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3741))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Qin, B., Liu, Y.: High performance distributed real time commit protocol. Journal of Systems and Software, 1–8 (2003)

    Google Scholar 

  2. Haritsa, J.R., Ramamritham, K., Gupta, R.: The PROMPT real time commit protocol. IEEE Transaction on parallel and distributed systems 11(2), 160–181 (2000)

    Article  Google Scholar 

  3. Lam, K.Y., Pang, C.L., Son, S.H., Cao, J.: Resolving executing-committing conflicts in distributed real-time database systems. Computer Journal 42(8), 674–692 (1999)

    Article  MATH  Google Scholar 

  4. Garcia-Molina, H., Salem, K.: Main memory database systems: an overview. IEEE Transactions on Knowledge and Data Engineering 4(6), 509–516 (1992)

    Article  Google Scholar 

  5. Shanker, U., Misra, M., Sarje, A.K.: A Modified Distributed Real–Time Commit Protocol. In: Proceedings of the International Conference on Systemics, Cybernetics and Informatics, Hyderabad. India, pp. 783–786 (2005)

    Google Scholar 

  6. Lam, K.: Concurrency Control in Distributed real time database systems. PhD Thesis. City University of Hong Kong (1994)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shanker, U., Misra, M., Sarje, A.K. (2005). A Memory Efficient Fast Distributed Real Time Commit Protocol. In: Pal, A., Kshemkalyani, A.D., Kumar, R., Gupta, A. (eds) Distributed Computing – IWDC 2005. IWDC 2005. Lecture Notes in Computer Science, vol 3741. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603771_55

Download citation

  • DOI: https://doi.org/10.1007/11603771_55

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30959-8

  • Online ISBN: 978-3-540-32428-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics