CFP last date
20 May 2024
Call for Paper
June Edition
IJCA solicits high quality original research papers for the upcoming June edition of the journal. The last date of research paper submission is 20 May 2024

Submit your paper
Know more
The week's pick
Responsive image
Enhancing Privacy Preservation: Multi-Attribute Protection with P-Sensitive K-Anonymity

Twinkle Patel Kiran Amin
Random Articles
Reseach Article

Improved Bandwidth Utilization based Check pointing Algorithm in Distributed Database

by Neera Batra, Manpreet Singh
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 27 - Number 7
Year of Publication: 2011
Authors: Neera Batra, Manpreet Singh
10.5120/3310-4538

Neera Batra, Manpreet Singh . Improved Bandwidth Utilization based Check pointing Algorithm in Distributed Database. International Journal of Computer Applications. 27, 7 ( August 2011), 31-35. DOI=10.5120/3310-4538

@article{ 10.5120/3310-4538,
author = { Neera Batra, Manpreet Singh },
title = { Improved Bandwidth Utilization based Check pointing Algorithm in Distributed Database },
journal = { International Journal of Computer Applications },
issue_date = { August 2011 },
volume = { 27 },
number = { 7 },
month = { August },
year = { 2011 },
issn = { 0975-8887 },
pages = { 31-35 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume27/number7/3310-4538/ },
doi = { 10.5120/3310-4538 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T20:13:11.644772+05:30
%A Neera Batra
%A Manpreet Singh
%T Improved Bandwidth Utilization based Check pointing Algorithm in Distributed Database
%J International Journal of Computer Applications
%@ 0975-8887
%V 27
%N 7
%P 31-35
%D 2011
%I Foundation of Computer Science (FCS), NY, USA
Abstract

In this paper, we present an optimal-bandwidth, min-process coordinated check pointing algorithm suitable for network failure prone applications in distributed systems. In the developed algorithm, during normal computation message transmission, dependency information among clusters is recorded in the corresponding cluster head processes. When a check pointing procedure begins, the initiator from a cluster concurrently sends composite message to all the cluster head processes which after extracting individual messages from it, further multicasts individual messages to the corresponding currently active receiving processes in their corresponding clusters thus resulting in reduced transmission delay and communication cost, better bandwidth utilization and faster speed of execution. Quantitative analysis shows that proposed algorithm works efficiently in terms of better response time and maximum bandwidth utilization for applications running under critical conditions such as low bandwidth availability and thereby resulting in frequent disconnections.

References
  1. B. Gupta, S. Rahimi, and R. Ahmad, “ A New Roll-Forward Checkpointing / Recovery Mechanism for Cluster Federation”, International Journal of Computer Science and Network Security, vol. 6, no.11, pp. 292-297, Nov. 2006.
  2. J. Cao, Y. Chen, K. Zhang and Y. He, “Checkpointing in Hybrid Distributed Systems”, IEEE ISPAN’04, 2004.
  3. S. Monnet, C. Morin and R. Badrinath,”A Hierarchical Checkpointing Protocl for Parallel Applcations in Cluster Federations”, IEEE IPDPS 2004, 2004.
  4. B. Gupta, S. Rahimi, and Z. Liu, “A New High Performance Checkpointing Approach for Mobile Computing Systems”, International Journal of Computer Science and Network Security, vol. 6, no. 5, May 2006.
  5. G. Cao, and M. Singhal, “On coordinated checkpointing in distributed systems”, IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 12, pp. 1213 – 1225, Dec. 1998.
  6. R. Prakash, and M.Singhal, “Low-Cost Check pointing and Failure Recovery in Mobile Computing Systems,” IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 10, pp. 1035-1048, October 1996.
  7. G.Cao, and M. Singhal, “Mutable checkpoints: a new checkpointing approach for mobile computing systems,” IEEE Transactions on Parallel and Distributed Systems, vol. 12, no. 2, pp. 157-172, Feb. 2001.
  8. K.M. Chandy, and L. Lamport, "Distributed Snapshots: Determining Global States of Distributed Systems," ACM Transactions on Computer Systems, vol. 3, no. 1, pp. 63-75, Feb. 1985.
  9. P. Kumar, L. Kumar, R.K. Chauhan, and V.K. Gupta, “A non-intrusive minimum process synchronous checkpointing protocol for mobile distributed systems,” ICPWC 2005, IEEE International Conference on Personal Wireless, vol. 3, no. 1, pp. 63-75, Feb. 1985.
  10. L. M. Silva, and J.G. Silva, “Global checkpointing for Distributed Programs,” Proceedings of 11th symposium on Reliable Distributed Systems, pp. 155 –162, Oct. 1992.
  11. B. Gupta, S. Rahimi, and Z. Liu, “A New Non-Blocking Synchronous Checkpointing Scheme for Distributed Systems,” Proceeding of 20th International Conference on Computers and Their Applications, pp. 26–31, Mar. 2005.
  12. R. Prakash, and M.Singhal, “Low-Cost Check pointing and Failure Recovery in Mobile Computing Systems,” IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 10, pp. 1035-1048, Oct. 1996.
  13. D. Manivannan, and M. Singhal, “Asynchronous Recovery Without Using Vector Timestamps,” Journal of Parallel and Distributed Computing, vol. 62, no. 12, pp. 1695-1728, Dec. 2002.
  14. B. Gupta, S. Rahimi and Yixin Yang, “A Novel Roll-Back Mechanism for Performance Enhancement of Asynchronous Checkpointing and Recovery”, Informatica, pp. 1–13, 2007.
Index Terms

Computer Science
Information Sciences

Keywords

Optimal bandwidth cluster fed check point non-blocking

Powered by PhDFocusTM