Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Appears in the Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC '97), Santa Barbara, CA, August 1997 Lazy Consistency Using Loosely Synchronized Clocks
 

Summary: Appears in the Proceedings of the ACM Symposium on Principles of Distributed Computing (PODC '97), Santa Barbara, CA, August 1997
Lazy Consistency Using Loosely Synchronized Clocks
Atul Adya Barbara Liskov
Laboratory for Computer Science,
Massachusetts Institute of Technology,
545 Technology Square, Cambridge, MA 02139
fadya,liskovg@lcs.mit.edu
Abstract
Thispaperdescribesanewschemeforguaranteeing thattransactions
in a client/server system observe consistent state while they
are running. The scheme is presented in conjunction with an
optimistic concurrency control algorithm, but could also be used
to prevent read-only transactions from conflicting with read/write
transactions in a multi-version system. The scheme is lazy about the
consistency it provides for running transactions and also in the way
it generates the consistency information. The paper presents results
of simulation experiments showing that the cost of the scheme is
negligible.
The scheme uses multipart timestamps to inform nodes about
information they need to know. Today the utility of such schemes

  

Source: Adya, Atul - Google Labs

 

Collections: Computer Technologies and Information Sciences