Application-Aware Consistency: An Application to Social Network
Lewis Tseng, Alec Benzer, Nitin H. Vaidya

TL;DR
This paper proposes application-aware consistency models that weaken traditional models by incorporating dependency graphs reflecting application semantics, leading to potential performance improvements in social network systems.
Contribution
It introduces dependency graphs to weaken consistency models, creating application-aware consistency tailored for social network applications.
Findings
Dependency graphs specify important event relations.
Application-aware consistency respects semantics and improves performance.
Work in progress with initial ideas presented.
Abstract
This work weakens well-known consistency models using graphs that capture applications' characteristics. The weakened models not only respect application semantic, but also yield a performance benefit. We introduce a notion of dependency graphs, which specify relations between events that are important with respect to application semantic, and then weaken traditional consistency models (e.g., causal consistency) using these graphs. Particularly, we consider two types of graphs: intra-process and inter-process dependency graphs, where intra-process dependency graphs specify how events in a single process are related, and inter-process dependency graphs specify how events across multiple processes are related. Then, based on these two types of graphs, we define new consistency model, namely {\em application-aware} consistency. We also discuss why such application-aware consistency can be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsDistributed systems and fault tolerance · Software System Performance and Reliability · Cloud Computing and Resource Management
