An Interference-Free Programming Model for Network Objects
This addresses synchronization issues for developers in distributed systems, though it appears incremental as it builds on existing concurrency models.
The paper tackles the problem of synchronization pitfalls in distributed object-oriented programming by introducing D-SCOOP, a model that enables interference-free and transaction-like reasoning on network objects with automatic synchronization and failure management, achieving performance close to or better than explicit locking in Java RMI.
Network objects are a simple and natural abstraction for distributed object-oriented programming. Languages that support network objects, however, often leave synchronization to the user, along with its associated pitfalls, such as data races and the possibility of failure. In this paper, we present D-SCOOP, a distributed programming model that allows for interference-free and transaction-like reasoning on (potentially multiple) network objects, with synchronization handled automatically, and network failures managed by a compensation mechanism. We achieve this by leveraging the runtime semantics of a multi-threaded object-oriented concurrency model, directly generalizing it with a message-based protocol for efficiently coordinating remote objects. We present our pathway to fusing these contrasting but complementary ideas, and evaluate the performance overhead of the automatic synchronization in D-SCOOP, finding that it comes close to---or outperforms---explicit locking-based synchronization in Java RMI.