Lookup NU author(s): Matthew Brook,
Dr Craig Sharp,
Dr Graham Morgan
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
Normal 0 false false false EN-GB JA X-NONE Distributed applications that allow replicated state to deviate in favour of increasing throughput still need to ensure such state achieves consistency at some point. This is achieved via compensating conflicting updates or undoing some updates to resolve conflicts. When causal relationships exist across updates that must be maintained then conflicts may result in previous updates also needing to be undone or compensated for. Therefore, an ability to manage contention across the distributed domain to pre-emptively lower conflicts as a result of causal infringements without hindering the throughput achieved from weaker consistency is desirable. In this paper we present such a system. We exploit the causality inherent in the application domain to improve overall system performance. We demonstrate the effectiveness of our approach with simulated benchmarked performance results.
Author(s): Brook M, Sharp C, Morgan G
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: 13th International IFIP Conference on Distributed Applications and Interoperable Systems (DAIS 2013)
Year of Conference: 2013
Publisher: Springer Berlin Heidelberg
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science