Eventual consistency is a relaxation of strong consistency that guarantees that if no new updates are made to a replicated data object, then all replicas will converge. The conflict free replicated datatypes (CRDTs) of Shapiro et al. are data structures whose inherent mathematical structure guarantees eventual consistency. We investigate a fundamental CRDT called Observed-Remove Set (OR-Set) th...

This paper studies the semantics of sets under eventual consistency. The set is a pervasive data type, used either directly or as a component of more complex data types, such as maps or graphs. Eventual consistency of replicated data supports concurrent updates, reduces latency and improves fault tolerance, but forgoes strong consistency (e.g., linearisability). Accordingly, several cloud compu...

Object caching is often used to improve the performance of mobile applications, but the gain is often lessened by the additional load of maintaining consistency between an original object and its cached copy. This paper aims at reducing the consistency maintenance work and proposes a protocol that distinguishes between two classes of consistency (i.e. weak and strong) and treats them differentl...

Davari, M. 2017. Advances Towards Data-Race-Free Cache Coherence Through Data Classification. Digital Comprehensive Summaries of Uppsala Dissertations from the Faculty of Science and Technology 1521. 64 pp. Uppsala: Acta Universitatis Upsaliensis. ISBN 978-91-554-9925-9. Providing a consistent view of the shared memory based on precise and well-defined semantics —memory consistency model—has be...

Robust (M-) estimation in linear models generally involves statistical functional processes. For drawing statistical conclusions (in large samples), some (uniform) linear approximations are usually needed for such functionals. In this context, the role of Hadamard differentiability is critically examined in this dissertation. In particular, the concept of the second-order Hadamard differenti-ab...

In non-binary constraint satisfaction problems, the study of local consistencies that only prune values from domains has so far been largely limited to generalized arc consistency or weaker local consistency properties. This is in contrast with binary constraints where numerous such domain filtering consistencies have been proposed. In this paper we present a detailed theoretical, algorithmic a...

Over the past few years, cloud computing and the growth of global large scale computing systems have led to applications which require data management across multiple datacenters. Initially the models provided single row level transactions with eventual consistency. Although protocols based on these models provide high availability, they are not ideal for applications needing a consistent view ...

We prove the consistency of a strong uniformization principle for a subset of the Baire space of cardinality א1. As a consequence we get the consistency of a related group-theoretic principle. Date: January 18, 2015. 2010 Mathematics Subject Classification. Primary, Secondary.