World Scientific
  • Search
Skip main navigation

Cookies Notification

We use cookies on this site to enhance your user experience. By continuing to browse the site, you consent to the use of our cookies. Learn More
×
Our website is made possible by displaying certain online content using javascript.
In order to view the full content, please disable your ad blocker or whitelist our website www.worldscientific.com.

System Upgrade on Tue, Oct 25th, 2022 at 2am (EDT)

Existing users will be able to log into the site and access content. However, E-commerce and registration of new users may not be available for up to 12 hours.
For online purchase, please visit us again. Contact us at [email protected] for any enquiries.

Scalable Sender-Based Message Logging Protocol with Little Communication Overhead for Distributed Systems

    The inherent shortcoming of the conventional Sender-Based Message Logging (SBML) protocols is to require additional control message interactions per application message to satisfy the always-no-orphans condition in case of sequential failures. In this paper, a scalable SBML protocol is introduced to lower the communication overhead by handling a sequence of messages consecutively received by each process before sending as a party. The protocol enables the process to delay the update of their receive sequence numbers to their senders until there comes out the first message it is willing to send, and then perform the collective filling out task with each sender requiring only one control message exchange. Experimental results show that our protocol outperforms the previous one in terms of the number of control messages generated.

    References

    • 1. G. R. Andrews, Paradigms for process interaction in distributed programs, ACM Comput. Surv. 23(1) (1991) 49–90. CrossrefGoogle Scholar
    • 2. R. Bagrodia et al., Parsec: A parallel simulation environments for complex systems, IEEE Comput. 31(10) (1998) 77–85. Crossref, ISIGoogle Scholar
    • 3. E. Elnozahy et al., A survey of rollback-recovery protocols in message-passing systems, ACM Comput. Surv. 34(3) (2002) 375–408. Crossref, ISIGoogle Scholar
    • 4. D. Johnson and W. Zwaenpoel, Sender-based message logging, in Proc. 7th International Symposium on Fault-Tolerant Computing (Pittsburgh, PA, July 1987), pp. 14–19. Google Scholar
    • 5. B. Gupta, R. Nikolaev and R. Chirra, A recovery scheme for cluster federations using sender-based message logging, J. Comput. Inf. Technol. 19(2) (2011) 127–139. CrossrefGoogle Scholar
    • 6. Y. Huang and Y. Wang, Why optimistic message logging has not been used in telecommunications systems, in Proc. 25th International Symposium on Fault-Tolerant Computing (Washington, DC, June 1995), pp. 459–463. Google Scholar
    • 7. P. Jaggi and A. Singh, Log based recovery with low overhead for large mobile computing systems, J. Inf. Sci. Eng. 29(5) (2013) 969–984. Google Scholar
    • 8. L. Lamport, Time, clocks, and the ordering of events in a distributed system, Commun. ACM 21(7) (1978) 558–565. Crossref, ISIGoogle Scholar
    • 9. Y. Luo and D. Manivannan, HOPE: A hybrid optimistic checkpointing and selective pessimistic mEssage logging protocol for large scale distributed systems, Future Gener. Comp. Sy. 28(8) (2012) 1217–1235. Crossref, ISIGoogle Scholar
    • 10. H. Meyer, D. Rexachs and E. Luque, Hybrid message pessimistic logging. Improving current pessimistic message logging protocols, J. Parallel. Distrib. Comput. 104(C) (2017) 206–222. Crossref, ISIGoogle Scholar
    • 11. T. Ropars and C. Morin, Active optimistic and distributed message logging for message-passing applications, Concurrency-Pract. Ex. 23(17) (2011) 2167–2178. Crossref, ISIGoogle Scholar
    • 12. T. Ropars and C. Morin, Improving message logging protocols scalability through distributed event logging, in Proc. 16th International Euro-Par Conference (Ischia, Italy, August 2010), pp. 511–522. Google Scholar
    • 13. R. D. Schlichting and F. B. Schneider, Fail-stop processors: An approach to designing fault-tolerant distributed computing systems, ACM Trans. Comput. Syst. 1(3) (1985) 222–238. Crossref, ISIGoogle Scholar
    • 14. B. Yao, K. Ssu and W. Fuchs, Message logging in mobile computing, in Proc. 29th International Symposium on Fault-Tolerant Computing (Madison, Wisconsin, February 1999), pp. 14–19. Google Scholar