Abstract
We consider the problem of developing reliable applications to be deployed in partitionable asynchronous distributed systems. What makes this task difficult is guaranteeing the consistency of shared state despite asynchrony, failures and recoveries, including the formation and merging of partitions. While view synchrony within process groups is a powerful paradigm that can significantly simplify reasoning about asynchrony and failures, it is insufficient for coping with recoveries and merging of partitions after repairs. We first give an abstract characterization for shared state management in partitionable asynchronous distributed systems and then show how views can be enriched to convey structural and historical information relevant to the group's activity. The resulting paradigm, called enriched view synchrony, can be implemented efficiently and leads to a simple programming methodology for solving shared state management in the presence of partitions.
Portions reprinted, with permission, from IEEE Transactions on Computers 46:6, pp. 642–658, June 1997.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Amir, Y., Moser, L.E., Melliar-Smith, P.M., Agarwal, D.A., Ciarfella, P.: The Totem single-ring ordering and membership protocol, ACM Trans. on Comp. Sys., 13 (1995) 311–342.
Babaoğlu, Ö, Bartoli, A., Dini, G.: Replicated File management in large-scale distributed systems. In: Tel, G. and Vitányi, P., (eds.): Distributed Algorithms. Lecture Notes in Computer Science, Vol. 857. Springer-Verlag, (1994) 1–16.
Babaoğlu, Ö, Davoli, R., Giachini, L.A., Sabatini, P.: The Inherent Cost of Strong-Partial View-Synchronous Communication. In: Hélary, J.M., Raynal, M. (eds.): Distributed Algorithms. Lecture Notes in Computer Science, Vol. 972. Springer-Verlag, (1995) 72–86.
Babaoğlu, Ö., Bartoli, A., Dini, G.: Enriched View Synchrony: A Programming Paradigm for Partitionable Asynchronous Distributed Systems. IEEE Trans. on Comp., 46 (1997) 642–658.
Birman, K., Cooper, R., Joseph, T., Marzullo, K., Makpangou, M., Kane, K. Schmuck, F., Wood, M.: The ISIS-System Manual, Version 2.1. Department of Computer Science, Cornell University, (1993).
Birman, K.: Virtual Synchrony. In: Birman, K., van Renesse, R. (eds.): Reliable Distributed Computing with the Isis toolkit. IEEE Computer Society Press, (1994).
Chandra, T.D., Toueg, S.; Unreliable Failure Detectors for Asynchronous Systems. In: Proc. of the 10th ACM Symp. on Princ. of Distr. Comp. (1991) 325–340.
El Abbadi, A., Skeen, D., Cristian, F.: An efficient, fault-tolerant protocol for replicated data management. In: Proc. of the 4th ACM Symp. on Princ. of Datab. Syst. (1985) 215–229.
El Abbadi A., Toueg, S.: Maintaining Availability in Partitioned Replicated Databases. In: ACM Trans. on Datab. Syst. 14 (1989) 264–290.
Fischer, M.J., Lynch, N.A., Paterson, M.S., Impossibility of Distributed Consensus with One Faulty Process. Journal of the ACM 32 (1985) 374–382.
Herlihy M., Wing, J.: Linearizability: A Correctness Condition for Concurrent Objects. ACM Trans. on Prog. Lang. and Syst., (1990) 463–492.
Keidar, I., Dolev, D.: Increasing the resilience of atomic commit at no additional cost. In: Proc. of the 14th ACM Symp. on Princ. of Datab. Syst. (1995) 245–254.
Malki, D., Amir, Y., Dolev, D., Kramer, S.: The Transis approach to high availability cluster communication. Technical Report CS94-14, Institute of Computer Science, The Hebrew University of Jerusalem (1994).
Budhiraja, N., Marzullo, K., Schneider, F. Toueg, S.: The Primary-Backup Approach. In: Mullender, S. (ed.) Distributed Systems, 2nd edition, ACM Press, (1993) 199–216.
Satyanarayanan, M., Kistler, J.J., Kumar, P., Okasaki, M.E., Siegel, E.H., Steere, D.C.: Coda: A highly available file system for a distributed workstation environment. IEEE Trans. on Comp. 39 (1990) 447–459.
Schiper, A., Ricciardi, A.: Virtually-synchronous communication based on a weak failure suspector. In: Proc. of the 23rd Intern. Symp. on Fault-Tolerant Comp. (1993) 534–543.
Schiper, A., Ricciardi, A., Birman, K.: Understanding partitions and the “no partition” assumption: In: Proc. of the 4th IEEE Workshop on Future Trends of Distr. Syst. (1993) 354–360.
Schiper, A., Sandoz, A.: Uniform reliable multicast in a virtually synchronous environment. In: Proc of the 13th Intern. Conf. on Distr. Comp. Syst. (1993) 561–568.
Schiper, A., Sandoz, A.: Primary partition virtually synchronous communication harder than consensus. In: Tel, G. and Vitànyi, P., (eds.): Distributed Algorithms. Lecture Notes in Computer Science, Vol. 857. Springer-Verlag, (1994) 39–52.
Guerraoui, R., Schiper, A.: Software-Based Replication for Fault Tolerance. IEEE Comp. 30 (1997) 68–74.
Schneider, F.B.: Implementing Fault-Tolerant Services using the State-Machine Approach: A Tutorial. ACM Comp. Surveys 22 (1990) 299–319.
Skeen, D.: Determining the last process to fail. ACM Trans. on Comp. Syst. 3 (1985) 15–30.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Babaoğglu, Ö., Bartoli, A., Dini, G. (2000). Programming Partition-Aware Network Applications?. In: Krakowiak, S., Shrivastava, S. (eds) Advances in Distributed Systems. Lecture Notes in Computer Science, vol 1752. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46475-1_8
Download citation
DOI: https://doi.org/10.1007/3-540-46475-1_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67196-1
Online ISBN: 978-3-540-46475-4
eBook Packages: Springer Book Archive