Advertisement

Liana: A Framework That Utilizes Causality to Schedule Contention Management across Networked Systems

Short Paper
  • Yousef Abushnagh
  • Matthew Brook
  • Craig Sharp
  • Gary Ushaw
  • Graham Morgan
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7566)

Abstract

In this paper we tackle the problem of improving overall throughput for shared data access across networked systems. We are concerned with those systems that must maintain the causal ordering of events across participating nodes in a network. By utilising the causality inherent within such systems we create a scheduler that can inform contention management schemes in such a way as to reduce the rollback associated to conflicting access of shared data.

Keywords

message ordering contention management causal ordering 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Chockler, G., Malkhi, D., Reiter, M.K.: Backoff Protocols for Distributed Mutual Exclusion and Ordering. In: 21st IEEE International Conference on Distributed Computing Systems, pp. 11–20. IEEE Press, New York (2001)Google Scholar
  2. 2.
    Felber, P., Schiper, A.: Optimistic Active Replication. In: 21st IEEE International Conference on Distributed Computing Systems, pp. 333–341. IEEE Press, New York (2001)Google Scholar
  3. 3.
    Saito, Y., Shapiro, M.: Optimistic Replication. ACM Computing Surveys 37, 42–81 (2005)CrossRefGoogle Scholar
  4. 4.
    Vogels, W.: Eventually Consistent. Communications of the ACM 52, 40–44 (2009)CrossRefGoogle Scholar
  5. 5.
    Lakshman, A., Malik, P.: Cassandra: A Decentralized Structured Storage System. ACM SIGOPS Operating Systems Review 44, 35–40 (2010)CrossRefGoogle Scholar
  6. 6.
    DeCandia, G., Hastorun, D., Jampani, M., Kakulapati, G., Lakshman, A., Pilchin, A., Sivasubramanian, S., Vosshall, P.: Dynamo: Amazon’s Highly Available Key-Value Store. In: 21st ACM SIGOPS Symposium on Operating Systems Principles, pp. 205–220. ACM, New York (2007)CrossRefGoogle Scholar
  7. 7.
    Terry, D.B., Theimer, M.M., Petersen, K., Demers, A.J., Spreitzer, M.J., Hauser, C.H.: Managing Update Conflicts in Bayou, a Weakly Connected Replicated Storage System. In: 15th ACM Symposium on Operating Systems Principles, pp. 172–182. ACM, New York (1995)Google Scholar
  8. 8.
    Kermarrec, A., Rowstron, A., Shapiro, M., Druschel, P.: The IceCube Approach to the Reconciliation of Divergent Replicas. In: 20th Annual ACM Symposium on Principles of Distributed Computing, pp. 210–218. ACM, New York (2001)Google Scholar
  9. 9.
    Preguiça, N., Shapiro, M., Matheson, C.: Semantics-Based Reconciliation for Collaborative and Mobile Environments. In: Meersman, R., Schmidt, D.C. (eds.) CoopIS/DOA/ODBASE 2003. LNCS, vol. 2888, pp. 38–55. Springer, Heidelberg (2003)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Yousef Abushnagh
    • 1
  • Matthew Brook
    • 1
  • Craig Sharp
    • 1
  • Gary Ushaw
    • 1
  • Graham Morgan
    • 1
  1. 1.School of Computing ScienceNewcastle UniversityUK

Personalised recommendations