A Revised and Verified Proof of the Scalable Commutativity Rule

PDF Code Project

Type Aware Transactions for Faster Concurrent Code

PDF Code Project


The Scalable Commutativity Rule

The scalable commutativity rule states that whenever interface operations commute, they have a conflict-free implementation. The initial SOSP 2013 paper included a full formal treatment of the rule, a detailed explanation of Commuter (an automated scalability testing tool), and how we applied the rule and Commuter to build a POSIX file system and virtual memory system. We are now exploring further the relationship between commutativity and scalability driven by the insights we gained from verifying the SCR.

enClosure: Group Communication via Encounter Closures

New applications enabled by personal smart devices and the Internet-of-Things (IoT) require communication in the context of periods of spatial co-location. This work is inspired by two insights: (1) encounters also enable group communication among devices connected by paths in the encounter graph that is contextual, spontaneous, secure, and does not require users to reveal identifying or linkable information; and (2) addressing communication partners using encounter closures subject to causal, spatial, and temporal constraints enables powerful new forms of group communication.

STO: Software Transactional Objects

STO is a Software Transactional Memory (STM) that improves performance by tracking abstract operations instead of memory words.