On the Behaviour of General-Purpose Applications on Cloud Storages
Managing data over cloud infrastructures raises novel challenges with respect to existing and well studied approaches such as ACID and long running transactions. One of the main requirements is to provide availability and partition tolerance in a scenario with replicas and distributed control. This comes at the price of a weaker consistency, usually called eventual consistency. These weak memory models have proved to be suitable in a number of scenarios, such as the analysis of large data with Map-Reduce. However, due to the widespread availability of cloud infrastructures, weak storages are used not only by specialised applications but also by general purpose applications. We provide a formal approach, based on process calculi, to reason about the behaviour of programs that rely on cloud stores. For instance, one can check that the composition of a process with a cloud store ensures ‘strong’ properties through a wise usage of asynchronous message-passing.
We thank the anonymous reviewers of WS-FM 2013 and Emilio Tuosto for their insightful and helpful comments on the previous version of this paper.
- 3.Boudol, G., Petri, G.: Relaxed memory models: an operational approach. In: Shao, Z., Pierce, B.C. (ed.) POPL, pp. 392–403. ACM (2009)Google Scholar
- 8.Goto, M., Jagadeesan, R., Ptcher, C., Riely, J.: Types for relaxed memory models. In: Proceedings of the 8th ACM SIGPLAN workshop on Types in language design and implementation, TLDI ’12, pp. 25–38. ACM, New York (2012)Google Scholar
- 9.Kossmann, D., Kraska, T., Loesing, S.: An evaluation of alternative architectures for transaction processing in the cloud. In: Elmagarmid, A.K., Agrawal, D. (ed.) SIGMOD Conference, pp. 579–590. ACM (2010)Google Scholar
- 12.Milner, R.: A Calculus of Communicating Systems. Springer-Verlag New York Inc., Secaucus (1982)Google Scholar
- 16.Sevcík, J., Vafeiadis, V., Nardelli, F.Z., Jagannathan, S., Sewell, P.: Relaxed-memory concurrency and verified compilation. In: Ball, T., Sagiv, M. (ed.) POPL, pp. 43–54. ACM (2011)Google Scholar
- 19.Shapiro, M., Kemme, B.: Eventual consistency. In: Özsu, M.T., Liu, L. (eds.) Encyclopedia of Database Systems (Online and Print). Springer, New York (2009) Google Scholar
- 22.von Gleissenthall, K., Rybalchenko, A.: An epistemic perspective on consistency of concurrent computations. CoRR, abs/1305.2295 (2013)Google Scholar