A recent insight is that it is possible to design non-trivial and generally useful data types whose concurrent operations commute. These Commutative Replicative Data Types (CRDTs) ensure EC in a simple and sound way, with no synchronisation and no roll-backs. Our challenges so far have been to design a library of useful and interesting CRDTs, and to characterise sufficient conditions for consistency. Many research questions remain open: how do we build interesting, large-scale applications using CRDTs? Is the CRDT approach sufficient, or is some synchronisation always necessary; and if so, how much, and how do we fit the two together? What are the theoretical and practical limits of CRDTs? What complexity bounds and real performance? How do CRDTs relate to commutativity theory, monotonic languages, self-stabilisation, or the consensus hierarchy? How to ensure security and confidentiality while at the same time sharing state?
We wish to recruit a post-doc interested in pursuing this topic. Candidates should have an excellent academic record. Candidates must have a strong interest in distributed systems. We are especially interested in candidates with a dual expertise in a complementary area, e.g., programming languages, verification, or security.
Please provide a CV, the list of Masters or PhD courses and your marks, an essay relevant to the topic (1 to 4 pages), and at least two references (whom we will contact ourselves for a recommendation). Contacts:
More papers available here.
This research is funded by ANR Project ConcoRDanT.