Summary
This note examines and contrasts the choice of finite versus infinite histories as the framework for analysing the behaviour of an asynchronous multicache scheme.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Brown G: Asynchronous multicaches. Distrib Comput 4: 31–36 (1990)
Author information
Authors and Affiliations
Additional information
Mike Livesey is currently a Lecturer in Computer Science at the University of St. Andrews, Scotland. His research interests are centred on distributed systems, particularly the specification and verification of distributed protocols. Dr. Livesey received a BA in mathematics from Cambridge University in 1970, an MSc in computer science from Essex University in 1973 and a PhD in computer science form St. Andrews University in 1987. He has also taught at other universities in Britain and New Zealand, and been employed by Marconi-Elliott Computer Systems Ltd.
Rights and permissions
About this article
Cite this article
Livesey, M. A note on consistency in asynchronous multicaches. Distrib Comput 7, 111–114 (1993). https://doi.org/10.1007/BF02280840
Received:
Accepted:
Issue Date:
DOI: https://doi.org/10.1007/BF02280840