Search Results for author:
Found 5 papers, 3 papers with code
A coordination-free, convergent, and safe replicated tree
We provide mechanized proof that the data structure is convergent and maintains the tree invariant.
Distributed, Parallel, and Cluster Computing
Towards application-specific query processing systems
We demonstrate the expressiveness of this approach by applying it to the design of a query system that can flexibly place its state in the data center or at the edge, and show that state placement decisions affect the trade-off between query response time and query result freshness.
Persistent Memory Programming Abstractions in Context of Concurrent Applications
This memory technology is considered to have the performance like that of DRAM and persistence like that of disks.
Distributed, Parallel, and Cluster Computing
Extending Eventually Consistent Cloud Databases for Enforcing Numeric Invariants
Despite this, the inability to enforce numeric invariants across all replicas still remains a key shortcoming of relying on the limited guarantees of eventual consistency storage.
Distributed, Parallel, and Cluster Computing
CRDTs: Consistency without concurrency control
A CRDT is a data type whose operations commute when they are concurrent.
Distributed, Parallel, and Cluster Computing
