On the Semantics of Distributed Reactive Programming: The Cost of Consistency
- 4 May 2018
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Software Engineering
- Vol. 44 (7) , 689-711
Abstract
The reactive programming paradigm aims to simplify the development of reactive systems. It provides abstractions to define time-changing values that are automatically updated by the runtime according to their dependencies. The benefits of reactive programming in distributed settings have been recognized for long. Yet, existing solutions for distributed reactive programming enforce the same semantics as in single processes, introducing communication and synchronization costs that hamper scalability. Establishing suitable abstractions for distributed reactive programming demands for a deeper investigation of the semantics of change propagation. This paper takes a foundational approach and defines precise propagation semantics in terms of consistency guarantees that constrain the order and isolation of value updates. We study the benefits and costs of these consistency guarantees both theoretically and empirically, using case studies and synthetic benchmarks.Keywords
Funding Information
- H2020 European Research Council (321217)
- German Research Foundation
- DFG (SA 2918/2-1)
- AWS Cloud Credits
This publication has 69 references indexed in Scilit:
- A survey on reactive programmingACM Computing Surveys, 2013
- Your mouse is a databaseCommunications of the ACM, 2012
- MapReduceCommunications of the ACM, 2008
- Total order broadcast and multicast algorithmsACM Computing Surveys, 2004
- Aurora: a new model and architecture for data stream managementThe VLDB Journal, 2003
- Exploiting punctuation semantics in continuous data streamsIEEE Transactions on Knowledge and Data Engineering, 2003
- The synchronous languages 12 years laterProceedings of the IEEE, 2003
- Memory consistency modelsACM SIGOPS Operating Systems Review, 1993
- Distributed snapshotsACM Transactions on Computer Systems, 1985
- On optimistic methods for concurrency controlACM Transactions on Database Systems, 1981