An analysis of update ordering in a cluster of replicated servers
Zhou, Wanlei and Wang, Li 2002, An analysis of update ordering in a cluster of replicated servers, in Proceedings of the Fifth International Conference on Algorithms and Architectures for Parallel Processing, IEEE, Los Alamitos, Calif., pp. 28-35.
(Some files may be inaccessible until you login with your Deakin Research Online credentials)
This paper analyses update ordering and its impact on the performance of a cluster of replicated servers. We propose a model for update orderings and constraints and develop a number of algorithms for implementing different ordering constraints. A performance study is then carried out to analyse the update ordering model.
This material is presented to ensure timely dissemination of scholarly and technical work. Copyright and all rights therein are retained by authors or by other copyright holders. All persons copying this information are expected to adhere to the terms and constraints invoked by each author's copyright. In most cases, these works may not be reposted without the explicit permission of the copyright holder.
Unless expressly stated otherwise, the copyright for items in Deakin Research Online is owned by the author, with all rights reserved.
Every reasonable effort has been made to ensure that permission has been obtained for items included in DRO.
If you believe that your rights have been infringed by this repository, please contact email@example.com.