Quorum-based Systems
Quorum-Based Systems is a coordination model in distributed computing that ensures fault-tolerant agreement by requiring a minimal subset of processes, known as a quorum, to participate in decision-making, thereby preventing conflicting operations through intersection properties of these subsets.
166
Publications
10.4K
Citations
308
Authors
133
Institutions
Publications per year
2017–2026
20
Parents
166
Consistent hashing and random trees
David R. Karger, Eric Lehman, Tom Leighton et al. · 1997 · 2K citations
Dahlia Malkhi, Michael K. Reiter · Distributed Computing · 1998 · 527 citations
HQ replication: a hybrid quorum protocol for byzantine fault tolerance
James Cowling, Daniel S. Myers, Barbara Liskov et al. · 2006 · 307 citations
1–5 of 166
308
16
h-index
9
h-index
9
h-index
8
h-index
6
h-index
1–5 of 308
133

Weizmann Institute of Science
Rehovot, Israel
12 h-index
23 publications
973 citations
Carnegie Mellon University
Pittsburgh, United States
8 h-index
16 publications
364 citations
National Tsing Hua University
Hsinchu, Taiwan
6 h-index
13 publications
372 citations
AT&T (United States)
Bedminster, United States
6 h-index
11 publications
1.6K citations
Kansas State University
Manhattan, United States
5 h-index
9 publications
222 citations
École Polytechnique Fédérale de Lausanne
Lausanne, Switzerland
5 h-index
9 publications
306 citations
National Taiwan Ocean University
Keelung, Taiwan
5 h-index
11 publications
403 citations
Georgia Institute of Technology
Atlanta, United States
4 h-index
11 publications
318 citations
1–8 of 133
TPDS · 12 publications · 513 citations
12
h-index
8 publications · 735 citations
8
h-index
5 publications · 402 citations
5
h-index
Repository · 4 publications · 69 citations
4
h-index
4 publications · 104 citations
4
h-index
1–5