Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/1980022.1980077acmotherconferencesArticle/Chapter ViewAbstractPublication PagesicwetConference Proceedingsconference-collections
research-article

New & efficient low overheads algorithm for mobile distributed systems

Published: 25 February 2011 Publication History

Abstract

Determining the global state of distributed systems is an important problem in the absence of global memory and global clocks. Several algorithms have been proposed for collecting global states in mobile distributed systms. The new algorithm uses a different approach to represent the dependencies of each process during the communication between the two processes. Although the proposed improvement is simple and easy to implement, it significantly reduce the message overhead during the communications in distributed mobile systems which is a key requirement because low bandwidth is a key issue in mobile distributed systems.

References

[1]
A. Acharya, B. R. badrinath, T. Imjelinski. Checkpointing Distributed applications on Mobile Computers. Technical report, Department of Computer science, Rutgers University, 1994
[2]
B. Awerbuch and D. Peleg "Concurrent Online Tracking of Mobile Users" In proceedings of the ACM symposium on Communication, architectures and protocols 1991
[3]
Baldoni R., Hélary J-M., Mostefaoui A. and Raynal M., "A Communication-Induced Checkpointing Protocol that Ensures Rollback-Dependency Trackability," Proceedings of theInternational Symposium on Fault-Tolerant-Computing Systems, pp. 68--77, June 1997
[4]
Cao G. and Singhal M., "On coordinated checkpointing in Distributed Systems", IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 12, pp. 1213--1225, Dec 1998.
[5]
Cao G. and Singhal M., "On the Impossibility of Min-process Non-blocking Checkpointing and an Efficient Checkpointing Algorithm for Mobile Computing Systems," Proceedings of International Conference on Parallel Processing, pp. 37--44, August 1998.
[6]
Cao G. and Singhal M., "Mutable Checkpoints: A New Checkpointing Approach for Mobile Computing systems," IEEE Transaction On Parallel and Distributed Systems, vol. 12, no. 2, pp. 157--172, February 2001
[7]
Chandy K. M. and Lamport L., "Distributed Snapshots: Determining Global State of Distributed Systems," ACM Transaction on Computing Systems, vol. 3, No. 1, pp. 63--75, February 1985
[8]
Elnozahy E. N., Alvisi L., Wang Y. M. and Johnson D. B., "A Survey of Rollback-Recovery Protocols in Message-Passing Systems," ACM Computing Surveys, vol. 34, no. 3, pp. 375--408, 2002.
[9]
F. Mattern "Efficient Distributed Snapshots and Global Virtual time algorithms for Non-FIFO Systems", Technical report, University of Kaiserslautern, 1990
[10]
Hélary J. M., Mostefaoui A. and Raynal M., "Communication-Induced Determination of Consistent Snapshots," Proceedings of the 28th International Symposium on Fault-Tolerant Computing, pp. 208--217, June 1998.
[11]
J. Fidge "timestamps in Message Passing System that preserve the partial ordering" Proceeding of 11th Australian comuter science conference, pp 55--66, Feb 1988
[12]
Koo R. and Toueg S., "Checkpointing and Roll-Back Recovery for Distributed Systems," IEEE Trans. on Software Engineering, vol. 13, no. 1, pp. 23--31, January 1987.
[13]
L. Lamport, "Time, clocks and ordering of events in a distributed system" Comm. ACM, vol. 21, no. 7, pp. 558--565, July 1978
[14]
Prakash R. and Singhal M., "Low-Cost Checkpointing and Failure Recovery in Mobile Computing Systems," IEEE Transaction On Parallel and Distributed Systems, vol. 7, no. 10, pp. 1035--1048, October 1996.
[15]
Parveen Kumar, "A Low-Cost Hybrid Coordinated Checkpointing Protocol for mobile distributed systems", To appear in Mobile Information Systems
[16]
Praveen Kumar, Ajay Khunteta "A Minimum Process Coordinated Checkpointing Protocol for Mobile Distributed Systems", International Journal of Computer Science Issues Vol. 7 Issue 3 No. 5 Page 23--32
[17]
Ssu K. F., Yao B., Fuchs W. K. and Neves N. F., "Adaptive Checkpointing with Storage Management for Mobile Environments," IEEE Transactions on Reliability, vol. 48, no. 4, pp. 315--324, December 1999.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences
ICWET '11: Proceedings of the International Conference & Workshop on Emerging Trends in Technology
February 2011
1385 pages
ISBN:9781450304498
DOI:10.1145/1980022
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

  • Thakur College Of Engg. & Tech: Thakur College Of Engineering & Technology

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 25 February 2011

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. causal dependencies
  2. distributed systems
  3. mobile computing systems
  4. snapshot algorithms

Qualifiers

  • Research-article

Conference

ICWET '11
Sponsor:
  • Thakur College Of Engg. & Tech

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 25 Jan 2025

Other Metrics

Citations

Cited By

View all

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media