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. © 2012 Springer-Verlag.
CITATION STYLE
Abushnagh, Y., Brook, M., Sharp, C., Ushaw, G., & Morgan, G. (2012). Liana: A framework that utilizes causality to schedule contention management across networked systems short paper. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7566 LNCS, pp. 871–878). https://doi.org/10.1007/978-3-642-33615-7_30
Mendeley helps you to discover research relevant for your work.