Skip to main content
SpringerLink
Log in

Gossip based fault tolerant protocol in distributed transactional memory using quorum based replication system

  • Published:
Cluster Computing Aims and scope Submit manuscript

Abstract

Single copy Distributed Software Transactional Memory protocol maintains only one replica of each object in the system and is therefore prone to failures in large scale dynamically changing network. In this paper we propose a replication model using quorum system for transactional memory protocol where communication among the nodes takes place using gossip. The previous protocols demand a static structure over the network. Maintenance of a static structure for a dynamic network requires a significant overhead. Our method executes on an unstructured network which does not require adaption in case of node joining and node leaving. The algorithm maintains the coherence of the objects and aims to achieve low communication cost while reducing execution time of the transactions. The algorithm achieves a message complexity of \( {\text{O}}\left( {\sqrt n } \right) \) and time complexity of \( {\text{O}}\left( {\log \sqrt n } \right) \) which is an improvement over previous replication protocols for distributed transactional memory. Simulation results shows that the method exhibits better fault tolerance and requires less number of messages than existing approaches.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9

Similar content being viewed by others

References

  1. Herlihy, M., Sun, Y.: Distributed transactional memory for metric-space networks. Distrib. Comput. 20(3), 195–208 (2007)

    Article  Google Scholar 

  2. Attiya, H., Gramoli, V., Milani, A.: Combine: an improved directory-based consistency protocol. In: Technical, LPD-2010-002, EPFL (2010)

  3. Sharma, G., Busch, C., Srinivasagopalan, S.: Distributed transactional memory for general networks. In: 2012 IEEE 26th International Parallel and Distributed Processing Symposium (IPDPS 2012) (2012)

  4. Zhang, B., Ravindran, B.: BA: relay: a cache-coherence protocol for distributed transactional memory. In: Proceedings of the 13th international conference on Principles of Distributed Systems (OPODIS), pp. 48–53 (2009)

  5. Herlihy, M., Kuhn, F., Tirthapura, S., Wattenhofer, R.: Dynamic Analysis of the Arrow Distributed Protocol Theory of Computing Systems. Springer, New York (2006)

    MATH  Google Scholar 

  6. Saad, M.M., Ravindran, B.: Snake: control flow distributed software transactional memory. In: SSS, pp. 238–252 (2011)

  7. Saad, M.M., Ravindran, B.: RMI-DSTM: control flow distributed software transactional memory: technical report. ECE Dept., VirginiaTech, Blacksburg, VA (2011)

    Google Scholar 

  8. Chatterjee M., Setua S.K.: A distributed transactional memory protocol for dynamic networks. In: Mandal J., Dutta P., Mukhopadhyay S. (eds.) Computational Intelligence, Communications, and Business Analytics. CICBA 2017. Communications in Computer and Information Science, vol. 775. Springer, Singapore

  9. Kim, J., Ravindran, B.: Scheduling transactions in replicated distributed software transactional memory. In: CCGrid, pp. 227–234 (2013)

  10. Hirve, S., Palmieri, R., Ravindran, B.: HiperTM: high performance, fault-tolerant transactional memory. In: Chatterjee, M., Cao, J., Kothapalli, K., Rajsbaum, S. (eds.) Distributed Computing and Networking. ICDCN 2014. Lecture Notes in Computer Science, vol. 8314. Springer, Berlin (2014)

    Google Scholar 

  11. Zhang, B., Ravindran, B.: A quorum-based replication framework for distributed software transactional memory. In: OPODIS, pp. 18–33 (2011)

  12. Peluso, S., Ruivo, P., Romano, P., Quaglia, F., Rodrigues, L.: When scalability meets consistency: genuine multiversion update-serializable partial data replication. In: ICDCS, pp. 455–465 (2012)

  13. Attiya, H., Gramoli, V., Milani, A.: Directory protocols for distributed transactional memory. In: Guerraoui, R., Romano, P. (eds.) Transactional Memory. Lecture Notes in Computer Science, vol. 8913, pp. 367–391. Springer, New York (2015)

    Google Scholar 

  14. Palmieri, R., Peluso, S., Ravindran, B.: Transaction execution models in partially replicated transactional memory: the case for dataflow and control flow. In: Guerraoui, R., Romano, P. (eds.) Transactional Memory. Lecture Notes in Computer Science, vol. 8913. Springer, New York (2015)

    Google Scholar 

  15. Busch, C., Herlihy, M., Popovic, M., Sharma, G.: Impossibility results for distributed transactional memory. In: PODC’15, July 21–23, 2015, Donostia-San Sebastián, Spain (2015)

  16. Busch, C., Herlihy, M., Popovic, M., Sharma, G.: Fast scheduling in distributed transactional memory. In: Proceedings of the 29th ACM Symposium on Parallelism in Algorithms and Architecture-SPAA’17

  17. Hirve, S., Palmieri, R., Ravindran, B.: Archie: a speculative replicated transactional system. In: Middleware, pp. 265–276 (2014)

  18. Keidar, I., Perelman, D.: Multi-versioning in transactional memory. In: Guerraoui, R., Romano, P. (eds.) Transactional Memory Lecture Notes in Computer Science, vol. 8913, pp. 150–165. Springer, New York (2015)

    MATH  Google Scholar 

  19. Hendler, D., Naiman, A., Peluso, S., Quaglia, F., Romano, P., Suissa, A.: Exploiting locality in lease-based replicated transactional memory via task migration. In: DISC, pp. 121–133 (2013)

  20. Romano, P., Palmieri, R., Quaglia, F., Carvalho, N., Rodrigues, L.: On speculative replication of transactional systems. J. Comput. Syst. Sci. 80(1), 257–276 (2014)

    Article  MathSciNet  Google Scholar 

  21. Kim, J., Ravindran, B.: On transactional scheduling in distributed transactional memory systems. In: SSS, pp. 347–361 (2010)

  22. Lima, D., Miranda, H., Jaiani, F.: Simulation of partial replication in distributed transactional memory. In: IEEE Wireless Days Conference, pp. 54–59 (2017)

  23. Guerraoui, R., Herlihy, M., Pochon, B.: Towards a theory of transactional contention managers. In: PODC’05: Proceedings of the Twenty-Fourth Annual ACM Symposium on Principles of Distributed Computing, New York, pp. 258–264, ACM (2005)

  24. Malkhi, D., Reiter, M., Wright, R.: Probabilistic quorum systems. In: Proceedings of the 16th ACM Symposium on Principles Distributed Computing, pp. 267–273 (1997)

  25. Agarwal, D., El Abbabi, A.: The tree quorum protocol: an efficient approach for managing replicated data. In: Proceedings of the 16th VLDB Conference, Brisbane (1990)

  26. Malkhi, D., Reiter, M.K., Wool, A.: Probabilistic quorum systems. Inf. Comput. 170, 184–206 (2001). https://doi.org/10.1006/inco.2001.3054

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Calcutta University Technology Campus, JD-2, Sector-III, Salt Lake, Kolkata, 70 0 098, India

    Moumita Chatterjee & Sanjit Kumar Setua

  2. Department of Computer Science and Engineering, Academy of Technology, Adisaptagram, West Bengal, 712121, India

    Anirban Mitra

  3. RCIL, Washington University in St. Louis, 510 South Kings Highway Boule-vard, Saint Louis, MO, 63110, USA

    Sudipta Roy

Authors
  1. Moumita Chatterjee
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Anirban Mitra
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Sudipta Roy
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Sanjit Kumar Setua
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Sudipta Roy.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Chatterjee, M., Mitra, A., Roy, S. et al. Gossip based fault tolerant protocol in distributed transactional memory using quorum based replication system. Cluster Comput 23, 1103–1124 (2020). https://doi.org/10.1007/s10586-019-02973-7

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10586-019-02973-7

Keywords

Search

Navigation