2013
DOI: 10.1007/s10619-013-7136-4
|View full text |Cite
|
Sign up to set email alerts
|

Quality-aware schedulers for weak consistency key-value data stores

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2014
2014
2023
2023

Publication Types

Select...
4
1
1

Relationship

0
6

Authors

Journals

citations
Cited by 7 publications
(2 citation statements)
references
References 21 publications
0
2
0
Order By: Relevance
“…Ref. [20] used an on-demand selective method, Freshness/Tardiness (FIT), to maintain consistency and scalability using state-transfer updating. To manage the trade-off between latency and consistency, running transactions are selectively scheduled such that pending changes are applied.…”
Section: Related Workmentioning
confidence: 99%
See 1 more Smart Citation
“…Ref. [20] used an on-demand selective method, Freshness/Tardiness (FIT), to maintain consistency and scalability using state-transfer updating. To manage the trade-off between latency and consistency, running transactions are selectively scheduled such that pending changes are applied.…”
Section: Related Workmentioning
confidence: 99%
“…To find the committed delay for successful transactions, this work customizes the updating transaction to obtain the beginning time, ending time, and data. Using the beginning and ending time, the duration of the transaction can be retrieved with different throughputs (10,20,30,40,50,60,70,80) operation/sec at each node. Figure 6 depicts the results of the average duration with each throughput.…”
Section: Total Transaction Delaymentioning
confidence: 99%