The Case for Non-transparent Replication: Examples from Bayou.

@article{DBLP:journals/debu/TerryPST98,
  author    = {Douglas B. Terry and
               Karin Petersen and
               Mike Spreitzer and
               Marvin Theimer},
  title     = {The Case for Non-transparent Replication: Examples from Bayou},
  journal   = {IEEE Data Eng. Bull.},
  volume    = {21},
  number    = {4},
  year      = {1998},
  pages     = {12-20},
  ee        = {db/journals/debu/TerryPST98.html},
  bibsource = {DBLP, http://dblp.uni-trier.de}
}

Abstract

Applications that rely on replicated data have different requirements for how their data is managed. For example, some applications may require that updates propagate amongst replicas with tight time constraints, whereas other applications may be able to tolerate longer propagation delays. Some applications only require replicas to interoperate with a few centralized replicas for data synchronization purposes, while other applications need communication between arbitrary replicas. Similary, the type of update conflicts caused by data replication varies amongst applications, and the mechanisms to resolve them differ as well.

The Challenge faced by designers of replicated systems is providing the right interface to support cooperation between applications and their data managers. Application programmers do not want to be overburdened by having to deal with issues like propagating updates to replicas and ensuring eventual consistency, but at the same time they want the ability to set up appropriate replication schedules and to control how update conflicts are deleted and resolved. The Bayou system was designed to mitigate this tension between overburdening and underempowering applications. This paper lokks at two Bayou applications, a calendar manager and a mail reader, and illustrates ways in which they utilize Bayou's feature to manage their data in an application-specific manner.

Copyright © 1998 by The Institute of Electrical and Electronic Engineers, Inc. (IEEE). Abstract used with permission.

ACM SIGMOD Anthology

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the CD and click on the path of your mount point:
  /Anthology/smod7592 or /cdrom

• Windows: Click the letter of your CD drive
  A B C D E F G H I J K L M N O P Q R S T U V W X Y Z
• Mac: Click here
• UNIX/LINUX: mount the DVD and click on the path of your mount point:
  /Anthology/aDVD2 or /dvd

Online Edition:

References

[1]

Philip A. Bernstein, Nathan Goodman: An Algorithm for Concurrency Control and Recovery in Replicated Distributed Databases. ACM Trans. Database Syst. 9(4): 596-615(1984) BibTeX

[2]

Andrew Birrell, Roy Levin, Roger M. Needham, Michael D. Schroeder: Grapevine: An Exercise in Distributed Computing. Commun. ACM 25(4): 260-274(1982) BibTeX

[3]

Susan B. Davidson, Hector Garcia-Molina, Dale Skeen: Consistency in Partitioned Networks. ACM Comput. Surv. 17(3): 341-370(1985) BibTeX

[4]

Alan J. Demers, Daniel H. Greene, Carl Hauser, Wes Irish, John Larson, Scott Shenker, Howard E. Sturgis, Daniel C. Swinehart, Douglas B. Terry: Epidemic Algorithms for Replicated Database Maintenance. PODC 1987: 1-12 BibTeX

[5]

...

[6]

...

[7]

Richard A. Golding: A Weak-Consistency Architecture for Distributed Information Services. Computing Systems 5(4): 379-405(1992) BibTeX

[8]

Jim Gray, Pat Helland, Patrick E. O'Neil, Dennis Shasha: The Dangers of Replication and a Solution. SIGMOD Conference 1996: 173-182 BibTeX

[9]

...

[10]

...

[11]

Puneet Kumar, Mahadev Satyanarayanan: Supporting Application-Specific Resolution in an Optimistically Replicated File System. Workshop on Workstation Operating Systems 1993: 66-70 BibTeX

[12]

Rivka Ladin, Barbara Liskov, Liuba Shrira, Sanjay Ghemawat: Providing High Availability Using Lazy Replication. ACM Trans. Comput. Syst. 10(4): 360-391(1992) BibTeX

[13]

...

[14]

Lily B. Mummert, Maria Ebling, Mahadev Satyanarayanan: Exploiting Weak Connectivity for Mobile File Access. SOSP 1995: 143-155 BibTeX

[15]

...

[16]

Karin Petersen, Mike Spreitzer, Douglas B. Terry, Marvin Theimer, Alan J. Demers: Flexible Update Propagation for Weakly Consistent Replication. SOSP 1997: 288-301 BibTeX

[17]

...

[18]

Douglas B. Terry, Alan J. Demers, Karin Petersen, Mike Spreitzer, Marvin Theimer, Brent B. Welch: Session Guarantees for Weakly Consistent Replicated Data. PDIS 1994: 140-149 BibTeX

[19]

Douglas B. Terry, Marvin Theimer, Karin Petersen, Alan J. Demers, Mike Spreitzer, Carl Hauser: Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System. SOSP 1995: 172-183 BibTeX

[20]

...

Referenced by

1. Haifeng Yu, Amin Vahdat: Efficient Numerical Error Bounding for Replicated Network Services. VLDB 2000: 123-133