1 - 5 of 5 articles
We provide efficient constructions and tight bounds for shared memory systems accessed by n processes, up to t of which may exhibit Byzantine failures, in a model previously explored by Malkhi et al. . We show that sticky bits are universal in the Byzantine failure model for n ≥ 3t + 1, an...
A quorum system is a set of sets such that every two sets in the quorum system intersect. Quorum systems are well known building blocks for maintaining information in a distributed system while providing high availability and good load balance. Probabilistic Quorum Systems (PQS) are variants of...
We present a new approach, the GeoQuorums approach, for implementing atomic read/write shared memory in mobile ad hoc networks. Our approach is based on associating abstract atomic objects with certain geographic locations. We assume the existence of focal points, geographic areas that are...
In a system with limited-scope failure detectors, there are q disjoint clusters of processes such that some correct process in each cluster is never suspected by any process in that cluster. The failure detector class S
satisfies this property all the time, while ⋄S
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Sign Up Log In
To subscribe to email alerts, please log in first, or sign up for a DeepDyve account if you don’t already have one.
To get new article updates from a journal on your personalized homepage, please log in first, or sign up for a DeepDyve account if you don’t already have one.