Abstract
Large-scale systems spanning geographically distant sites are potentially appropriate environments for distributed applications supporting collaboration. In this paper, we examine the possibility of using such systems as repositories for replicated files to facilitate lowlatency data sharing. Asynchrony in communication and computation, complex combinations of site and communication failures, and in particular, network partitions that characterize these systems make the design of algorithms to operate on them a difficult task. We show that viewsynchronous communication is not only an appropriate conceptual model for reasoning about large-scale distributed systems, it is also an effective programming model. We support these claims by developing algorithms for managing replicated files with one-copy serializability as the correctness criteria.
Preview
Unable to display preview. Download preview PDF.
References
A. Siegel and K.P. Birman and K. Marzullo. Deceit: a flexible distributed file system. Technical Report TR89-21042, Department of Computer Science at Cornell University, Ithaca, NY, November 1989.
A. El Abbadi, D. Skeen, and F. Cristian. An efficient, fault-tolerant protocol for replicated data management. In Proceedings 4th SIGACT-SIGMOD Symposium on Principles of Database System, pages 215–229. ACM, 1985.
A. El Abbadi and S. Toueg. Maintaining Availability in Partitioned Replicated Databases. ACM Transactions on Databases Systems, 14(2):264–290, June 1989.
ö. Babaoğlu, M.G. Baker, R. Davoli, and L.A. Giachini. Relacs: A communications infrastructure for constructing reliable applications in large-scale distributed systems. Technical Report UBLCS-94-15, Laboratory for Computer Science, University of Bologna, Italy, June 1994.
ö. Babaoğlu, A. Bartoli, and G. Dini. Replicated file management in large-scale distributed systems. Technical Report UBLCS-94-16, Laboratory for Computer Science, University of Bologna, Italy, June 1994.
P.N. Bernstein and N. Goodman. Concurrency control in distributed database systems. A CM Computing Surveys, 13(2):185–221, June 1981.
C.H. Papadimitriou. The Serializability of Concurrent Database Updates. Journal of the ACM, 26(4):631–653, October 1979.
T.D. Chandra and S. Toueg. Unreliable Failure Detectors for Asynchronous Systems. In Proceedings 10 th ACM Symposium on Principles of Distributed Computing, pages 325–340. ACM, August 1991.
S.B. Davidson, H. Garcia-Molina, and D. Skeen. Consistency in partitioned networks. ACM Transactions on Computer Systems, 17(3):341–370, September 1985.
K.P. Birman and T.A. Joseph. Exploiting Virtual Synchrony in Distibuted Systems. In 11 th ACM Synposium on Operating Systems Principles, pages 123–138. ACM, 1987.
T.W. Page Jr, Richard G. Guy, G.J. Popek, and J.S. Heidemann. Architecture of the Ficus scalable replicated file system. Technical report, University of California, Los Angeles, 1991.
M. Satyanarayanan, J.J. Kistler, P. Kumar, M.E. Okasaki, E.H. Siegel, and D.C Steere. Coda: A highly available file system for a distributed workstation environment. IEEE Transactions on Computers, 39(4):447–59, 1990.
A. Schiper and A. Ricciardi. Virtually-synchronous communication based on a weak failure suspector. In Proceedings 23rd International Symposium on Fault-Tolerant Computing Systems, pages 534–543. IEEE, June 1993.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1994 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Babaoğlu, Ö., Bartoli, A., Dini, G. (1994). Replicated file management in large-scale distributed systems. In: Tel, G., Vitányi, P. (eds) Distributed Algorithms. WDAG 1994. Lecture Notes in Computer Science, vol 857. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0020420
Download citation
DOI: https://doi.org/10.1007/BFb0020420
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-58449-0
Online ISBN: 978-3-540-48799-9
eBook Packages: Springer Book Archive