Proceedings of the Fourteenth EuroSys Conference 2019 2019
DOI: 10.1145/3302424.3303987
|View full text |Cite
|
Sign up to set email alerts
|

Efficient, Consistent Distributed Computation with Predictive Treaties

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2020
2020
2023
2023

Publication Types

Select...
2
2

Relationship

0
4

Authors

Journals

citations
Cited by 4 publications
(2 citation statements)
references
References 39 publications
0
2
0
Order By: Relevance
“…Thereafter, it carefully adjusts the application data rate to match the available bandwidth, while maximizing the achievable accuracy. Besides, Magrino et al introduce predictive treaties to predict the evolution of the system state in distributed transaction processing [34]. This method can reduce the coordination of geo-distributed applications and improve their performance.…”
Section: Related Workmentioning
confidence: 99%
“…Thereafter, it carefully adjusts the application data rate to match the available bandwidth, while maximizing the achievable accuracy. Besides, Magrino et al introduce predictive treaties to predict the evolution of the system state in distributed transaction processing [34]. This method can reduce the coordination of geo-distributed applications and improve their performance.…”
Section: Related Workmentioning
confidence: 99%
“…The second type of consistency annotation we allow is application-centric, and makes use of Hydrologic's declarative formulation. Past work has demonstrated that invariants are a powerful way for developers to precisely specify what guarantees are necessary at application level [18,21,30,45,60,74,79,84]. These include motonicity invariants that guarantee convergent outcomes, or isolation invariants for predicates on visible states-e.g., positive bank accounts or referential integrity.…”
Section: Design Spacementioning
confidence: 99%