@inproceedings{4de3d2f88b1b490c81597888c8c42b67,
title = "MAINTAINING WEAKLY-CONSISTENT REPLICATED DATA ON DYNAMIC GROUPS OF COMPUTERS.",
abstract = "Algorithms that sacrifice serializability can attain high availability of weakly consistent copies of data. Previous work for static groups of computers is extended by showing how to maintain replicated data on dynamic groups with changing membership sets. A dynamic group is more suited to large, unreliable communication networks than is a static group. It is explained how to organized dynamic groups using mainly synchronous messages. Each member maintains a list of currently known group members as replicated data. Group members exchange messages frequently enough to keep their local copies consistent. A similar mechanism can easily maintain replicated user data on a dynamic group.",
author = "Frank, {Ariel J.} and Wittie, {Larry D.} and Bernstein, {Arthur J.}",
year = "1985",
language = "אנגלית",
isbn = "0818606371",
series = "Proceedings of the International Conference on Parallel Processing",
publisher = "IEEE",
pages = "155--162",
editor = "Douglas DeGroot",
booktitle = "Proceedings of the International Conference on Parallel Processing",
}