Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleMarch 2022
Quorums over codes
Journal of Parallel and Distributed Computing (JPDC), Volume 161, Issue CPages 1–19https://doi.org/10.1016/j.jpdc.2021.11.002Highlights- Quorum systems over erasure coded data to guarantee sequential consistency.
- ...
We consider the design and analysis of quorum systems over erasure coded warm data (with low frequency of writes and accesses in general) to guarantee sequential consistency under a fail-stop model while supporting atomic read-modify-...
- invited-talkJanuary 2021
Asymmetric Distributed Trust
ICDCN '21: Proceedings of the 22nd International Conference on Distributed Computing and NetworkingPage 3https://doi.org/10.1145/3427796.3433933Quorum systems are a key abstraction in distributed fault-tolerant computing for capturing trust assumptions. They can be found at the core of many algorithms for implementing reliable broadcasts, shared memory, consensus and other problems. This talk ...
- short-paperNovember 2015
Anticipating Requests to Improve Performance and Reduce Costs in Cloud Storage
ACM SIGMETRICS Performance Evaluation Review (SIGMETRICS), Volume 43, Issue 3Pages 21–24https://doi.org/10.1145/2847220.2847226Clouds are a suitable place to store data with scalability and financial flexibility. However, it is difficult to ensure the reliability of the data stored in a cloud. Byzantine fault tolerance can improve reliability, but at a high cost. This paper ...
- articleMarch 2011
Nondominated local coteries for resource allocation in grids and clouds
Information Processing Letters (IPRL), Volume 111, Issue 8Pages 379–384https://doi.org/10.1016/j.ipl.2011.01.008The resource allocation problem is a fundamental problem in Grid and Cloud computing environments. This paper focuses on constructing nondominated (ND) local coteries to solve the problem in a distributed way. Distributed algorithms using coteries ...
- articleSeptember 2010
Refined quorum systems
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform fast if few failures occur, the system is synchronous and there is no ...
- articleJune 2010
Emulating shared-memory Do-All algorithms in asynchronous message-passing systems
Journal of Parallel and Distributed Computing (JPDC), Volume 70, Issue 6Pages 699–705https://doi.org/10.1016/j.jpdc.2009.12.002A fundamental problem in distributed computing is performing a set of tasks despite failures and delays. Stated abstractly, the problem is to perform N tasks using P failure-prone processors. This paper studies the efficiency of emulating shared-memory ...
- ArticleMarch 2023
Timed Quorum Systems for Large-Scale and Dynamic Environments
AbstractThis paper presents Timed Quorum System (TQS), a quorum system for large-scale and dynamic systems. TQS provides guarantees that two quorums, accessed at instances of time that are close together, intersect with high probability. We present an ...
- research-articleApril 1999
Minimizing the Maximum Delay for Reaching Consensus in Quorum-Based Mutual Exclusion Schemes
IEEE Transactions on Parallel and Distributed Systems (TPDS), Volume 10, Issue 4Pages 337–345https://doi.org/10.1109/71.762814The use of quorums is a well-known approach to achieving mutual exclusion in distributed computing systems. This approach works based on a coterie, a special set of node groups where any pair of the node groups shares at least one common node. Each node ...