Optimized OR-sets without ordering constraints

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8314 LNCS, Issue , 2014, Pages 227-241

  Mukund, Madhavan ^a   Shenoy R , Gautham ^a   Suresh, S P ^a  

^a CHENNAI MATHEMATICAL INSTITUTE   (India)

Author keywords

[No Author keywords available]

Indexed keywords

COMPLEXITY BOUNDS; EVENTUAL CONSISTENCY; MATHEMATICAL STRUCTURE; MESSAGE DELIVERY; ORDERING CONSTRAINTS; OUT-OF-ORDER DELIVERIES; SPACE COMPLEXITY; STRONG CONSISTENCY;

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

DISTRIBUTED COMPUTER SYSTEMS;

EID: 84893068502     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-642-45249-9_15     Document Type: Conference Paper

References (14)

1. Gilbert, S., Lynch, N.A.: Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services. SIGACT News 33(2), 51-59 (2002)
2. Shapiro, M., Kemme, B.: Eventual consistency. In: Encyclopedia of Database Systems, pp. 1071-1072 (2009)
3. Saito, Y., Shapiro, M.: Optimistic replication. ACM Comput. Surv. 37(1), 42-81 (2005)
4. Vogels, W.: Eventually consistent. ACM Queue 6(6), 14-19 (2008)
5. Shapiro, M., Preguiça, N., Baquero, C., Zawirski, M.: A comprehensive study of Convergent and Commutative Replicated Data Types. Rapport de recherche RR-7506. INRIA (January 2011), http://hal.inria.fr/inria-00555588/ PDF/techreport.pdf
6. Bieniusa, A., Zawirski, M., Preguiça, N.M., Shapiro, M., Baquero, C., Balegas, V., Duarte, S.: An optimized conflict-free replicated set. CoRR abs/1210.3368 (2012)
7. Fischer, M.J., Lynch, N.A., Paterson, M.: Impossibility of distributed consensus with one faulty process. J. ACM 32(2), 374-382 (1985)
8. Shapiro, M., Preguiça, N., Baquero, C., Zawirski, M.: Conflict-free replicated data types. In: Défago, X., Petit, F., Villain, V. (eds.) SSS 2011. LNCS, vol. 6976, pp. 386-400. Springer, Heidelberg (2011)
9. Almeida, J.B., Almeida, P.S., Baquero, C.: Bounded version vectors. In: Guerraoui, R. (ed.) DISC 2004. LNCS, vol. 3274, pp. 102-116. Springer, Heidelberg (2004)
10. Malkhi, D., Terry, D.B.: Concise version vectors in WinFS. Distributed Computing 20(3), 209-219 (2007)
11. Mukund, M., Shenoy, G.R., Suresh, S.P.: Optimized or-sets without ordering constraints. Technical report, Chennai Mathematical Institute (2013), http://www.cmi.ac.in/~madhavan/papers/pdf/mss-tr-2013.pdf
12. Mukund, M., Shenoy, G.R., Suresh, S.P.: On bounded version vectors. Technical report, Chennai Mathematical Institute (2012), http://www.cmi.ac.in/ ~gautshen/pubs/BVV/on-bounded-version-vectors.pdf
13. Mukund, M., Sohoni, M.A.: Keeping track of the latest gossip in a distributed system. Distributed Computing 10(3), 137-148 (1997)
14. Mukund, M., Narayan Kumar, K., Sohoni, M.A.: Bounded time-stamping in message-passing systems. Theor. Comput. Sci. 290(1), 221-239 (2003)