NDLI: Weakly-Persistent Causal Objects in Dynamic Distributed Systems

Content Provider	IEEE Xplore Digital Library
Author	Baldoni, R. Malek, M. Milani, A. Piergiovanni, S.T.
Copyright Year	2006
Description	Author affiliation: Dipt. di Informatica e Sistemistica, Universita di Roma La Sapienza (Baldoni, R.)
Abstract	In the context of clients accessing a read/write shared object, persistency of a written value is a property stating that a value written into the object is always available unless overwritten by a successive write operation. This property can be easily guaranteed in a static distributed system provided that either a subset of processes implementing the object does not crash or processes can crash and then recover being able to retrieve their last state. Unfortunately the enforcing of this property in a potentially large scale and dynamic distributed system (e.g. a P2P system) is far from being trivial when considering the case in which processes implementing the object may fail or leave at any time without notifying any other process (i.e., the last state might not be retrievable). The paper introduces the notion of weak persistency that guarantees persistency of values when a system becomes quiescent (arrivals and departures subside). An implementation of a weakly-persistent object ensuring causal consistency is provided along with its correctness proof. The interest of causal consistency lies in the fact that, contrarily to atomic consistency, it can be maintained even during non-quiescent periods of the distributed system (i.e., when persistency is not guaranteed)
Starting Page	165
Ending Page	174
File Size	218886
Page Count	10
File Format	PDF
ISBN	0769526772
ISSN	10609857
DOI	10.1109/SRDS.2006.47
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2006-10-02
Publisher Place	UK
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer crashes Protocols Large-scale systems Abstracts Peer to peer computing Message passing Computer networks Resists Distributed computing Clocks
Content Type	Text
Resource Type	Article
Subject	Theoretical Computer Science Computer Networks and Communications Software Hardware and Architecture

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Failure detectors for large-scale distributed systems

Implementing a Register in a Dynamic Distributed System

Version stamps-decentralized version vectors

Fault-Tolerant Consensus in Unknown and Anonymous Networks

Efficient epidemic-style protocols for reliable and scalable multicast

Self-Stabilization in Tree-Structured Peer-to-Peer Service Discovery Systems

Exploiting temporal and spatial constraints on distributed shared objects

DATAFLASKS: Epidemic Store for Massive Scale Systems

On the complexity of simple distributed systems

Weakly-Persistent Causal Objects in Dynamic Distributed Systems

Similar Documents

Failure detectors for large-scale distributed systems

Implementing a Register in a Dynamic Distributed System

Version stamps-decentralized version vectors

Fault-Tolerant Consensus in Unknown and Anonymous Networks

Efficient epidemic-style protocols for reliable and scalable multicast

Self-Stabilization in Tree-Structured Peer-to-Peer Service Discovery Systems

Exploiting temporal and spatial constraints on distributed shared objects

DATAFLASKS: Epidemic Store for Massive Scale Systems

On the complexity of simple distributed systems

Weakly-Persistent Causal Objects in Dynamic Distributed Systems