Name
Abstract | ||
|---|---|---|
Quorum consensus protocols execute requests in parallel and proceed once K out of N responses are received. The performance of a system depends on the value of K, the dis- tributions of the quorum response delays, and on the use of system resources by the N concurrent requests. An analytic approximation is given for the delay to achieve the quorum, which also accounts for the contention and delay caused by the (N - K) delayed responses. Compared to simula- tion results, our approximation gives reasonable accuracy; about 5% in most cases. Our method is shown to be rapid and scalable. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1109/QEST.2007.31 | QEST |
Keywords | Field | DocType |
quorum response delay,performance modeling,system resource,n concurrent request,quorum pattern,reasonable accuracy,layered service systems,n response,tion result,quorum consensus protocol,analytic approximation,delayed response,service system,parallel processing | Computer science,Parallel processing,Scalability,Distributed computing | Conference |
ISBN | Citations | PageRank |
0-7695-2883-X | 5 | 0.52 |
References | Authors | |
30 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Tariq Omari | 1 | 23 | 3.22 |
| Salem Derisavi | 2 | 478 | 26.96 |
| Greg Franks | 3 | 409 | 29.08 |
| Murray Woodside | 4 | 1215 | 81.20 |