Publication Type
Conference Proceeding Article
Version
publishedVersion
Publication Date
6-2016
Abstract
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.
Discipline
Programming Languages and Compilers | Software Engineering
Research Areas
Software and Cyber-Physical Systems
Publication
Proceedings of the 18th International Conference on Coordination Models and Languages (COORDINATION 2016), Heraklion, Crete, Greece, June 6-9
Volume
9686
First Page
227
Last Page
244
ISBN
978-3-319-39518-0
Identifier
10.1007/978-3-319-39519-7_14
Publisher
Springer
City or Country
Heraklion, Crete, Greece
Citation
SCHILL, Mischael; POSKITT, Christopher M.; and MEYER, Bertrand.
An interference-free programming model for network objects. (2016). Proceedings of the 18th International Conference on Coordination Models and Languages (COORDINATION 2016), Heraklion, Crete, Greece, June 6-9. 9686, 227-244.
Available at: https://ink.library.smu.edu.sg/sis_research/4908
Creative Commons License
This work is licensed under a Creative Commons Attribution-NonCommercial-No Derivative Works 4.0 International License.
Additional URL
https://doi.org/10.1007/978-3-319-39519-7_14