Abstract:
“Weak consistency” refers to a family of properties concerning the state of a distributed system. One of the key issues in their description is the way in which systems are specified. In this regard, a major advance is represented by the introduction of Replicated Data Types (rdts), in which the meaning of operators is given in terms of two relations, namely, visibility and arbitration. Concretely, a data type operation is defined as a function that maps visibility and arbitration into a return value. In this paper we recast such standard approaches into a denotational framework in which a data type is seen as a function that maps visibility into admissible arbitrations. This characterisation provides a more abstract view of RDTs that (i) highlights some of the implicit assumptions shared in operational approaches to specification; (ii) accommodates underspecification and refinement; (iii) enables a categorical presentation of RDT and the development of composition operators for specifications. © IFIP International Federation for Information Processing 2017.
Registro:
Documento: |
Artículo
|
Título: | A denotational view of replicated data types |
Autor: | Gadducci, F.; Melgratti, H.; Roldán, C.; Jacquet J.-M.; Massink M. |
Filiación: | Dipartimento di Informatica, Universitá di Pisa, Pisa, Italy Departamento de Computación, FCEyN, Universidad de Buenos Aires, Buenos Aires, Argentina CONICET, Buenos Aires, Argentina
|
Palabras clave: | Distributed computer systems; Specifications; Composition operators; Data type; Distributed systems; Key Issues; Replicated data; Return value; Underspecification; Weak consistency; Visibility |
Año: | 2017
|
Volumen: | 10319 LNCS
|
Página de inicio: | 138
|
Página de fin: | 156
|
DOI: |
http://dx.doi.org/10.1007/978-3-319-59746-1_8 |
Título revista: | 19th IFIP WG 6.1 International Conference on Coordination Models and Languages, COORDINATION 2017 - Held as Part of the 12th International Federated Conference on Distributed Computing Techniques, DisCoTec 2017
|
Título revista abreviado: | Lect. Notes Comput. Sci.
|
ISSN: | 03029743
|
Registro: | https://bibliotecadigital.exactas.uba.ar/collection/paper/document/paper_03029743_v10319LNCS_n_p138_Gadducci |
Referencias:
- Bonchi, F., Buscemi, M.G., Ciancia, V., Gadducci, F., A presheaf environment for the explicit fusion calculus (2012) J. Autom. Reasoning, 49 (2), pp. 161-183
- Burckhardt, S., Principles of eventual consistency (2014) Found. Trends Program. Lang, 1 (1-2), pp. 1-150
- Burckhardt, S., Gotsman, A., Yang, H., (2013) Understanding eventual consistency, , Technical Report MSR-TR-2013-39, Microsoft Research
- Burckhardt, S., Gotsman, A., Yang, H., Zawirski, M., Replicated data types: Specification, verification, optimality (2014) POPL 2014, pp. 271-284. , Jagannathan, S., Sewell, P. (eds.), ACM
- Cerone, A., Bernardi, G., Gotsman, A., A framework for transactional consistency models with atomic visibility (2015) CONCUR 2015. LIPIcs, 42. , Aceto, L., de Frutos-Escrig, D. (eds.), Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik
- Gilbert, S., Lynch, N., Brewer’s conjecture and the feasibility of consistent, available, partition-tolerant web services (2002) SIGACT News, 33 (2), pp. 51-59
- Gotsman, A., Yang, H., Composite replicated data types (2015) ESOP 2015. LNCS, 9032, pp. 585-609. , Vitek, J. (ed.), Springer, Heidelberg
- Gotsman, A., Yang, H., Ferreira, C., Najafzadeh, M., Shapiro, M., ‘Cause i’m strong enough: Reasoning about consistency choices in distributed systems (2016) POPL 2016, pp. 371-384. , Bodík, R., Majumdar, R. (eds.), ACM
- Joyal, A., Nielson, M., Winskel, G., Bisimulation and open maps (1993) LICS 1993, pp. 418-427. , IEEE
- Montanari, U., Sammartino, M., A network-conscious π-calculus and its coalgebraic semantics (2014) Theor. Comput. Sci., 546, pp. 188-224
- Pitts, A.M., (2013) Nominal Sets: Names and Symmetry in Computer Science, , Cambridge University Press, Cambridge
- Shapiro, M., Preguiça, N., Baquero, C., Zawirski, M., Conflict-free replicated data types (2011) SSS 2011. LNCS, 6976, pp. 386-400. , Défago, X., Petit, F., Villain, V. (eds.), Springer, Heidelberg
- Shapiro, M., Preguiça, N., Baquero, C., Zawirski, M., (2011) A comprehensive study of convergent and commutative replicated data types, , Technical Report RR-7506, Inria-Centre Paris-Rocquencourt
- Sivaramakrishnan, K.C., Kaki, G., Jagannathan, S., Declarative programming over eventually consistent data stores (2015) PLDI 2015, pp. 413-424. , Grove, D., Blackburn, S. (eds.), ACMA4 -
Citas:
---------- APA ----------
Gadducci, F., Melgratti, H., Roldán, C., Jacquet J.-M. & Massink M.
(2017)
. A denotational view of replicated data types. 19th IFIP WG 6.1 International Conference on Coordination Models and Languages, COORDINATION 2017 - Held as Part of the 12th International Federated Conference on Distributed Computing Techniques, DisCoTec 2017, 10319 LNCS, 138-156.
http://dx.doi.org/10.1007/978-3-319-59746-1_8---------- CHICAGO ----------
Gadducci, F., Melgratti, H., Roldán, C., Jacquet J.-M., Massink M.
"A denotational view of replicated data types"
. 19th IFIP WG 6.1 International Conference on Coordination Models and Languages, COORDINATION 2017 - Held as Part of the 12th International Federated Conference on Distributed Computing Techniques, DisCoTec 2017 10319 LNCS
(2017) : 138-156.
http://dx.doi.org/10.1007/978-3-319-59746-1_8---------- MLA ----------
Gadducci, F., Melgratti, H., Roldán, C., Jacquet J.-M., Massink M.
"A denotational view of replicated data types"
. 19th IFIP WG 6.1 International Conference on Coordination Models and Languages, COORDINATION 2017 - Held as Part of the 12th International Federated Conference on Distributed Computing Techniques, DisCoTec 2017, vol. 10319 LNCS, 2017, pp. 138-156.
http://dx.doi.org/10.1007/978-3-319-59746-1_8---------- VANCOUVER ----------
Gadducci, F., Melgratti, H., Roldán, C., Jacquet J.-M., Massink M. A denotational view of replicated data types. Lect. Notes Comput. Sci. 2017;10319 LNCS:138-156.
http://dx.doi.org/10.1007/978-3-319-59746-1_8