Reactors: a data-oriented synchronous/asynchronous programming model for distributed applications

  • Authors:

  • John Field;Maria-Cristina Marinescu;Christian Stefansen

  • Affiliations:

  • IBM T.J. Watson Research Center;IBM T.J. Watson Research Center;Department of Computer Science, University of Copenhagen

  • Venue:
  • COORDINATION'07 Proceedings of the 9th international conference on Coordination models and languages
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

Our aim is to define the kernel of a simple and uniform programming model--the reactor model--suitable for building and evolving internet-scale programs. A reactor consists of two principal components: mutable state, in the form of a fixed collection of relations, and code, in the form of a fixed collection of rules in the style of datalog. A reactor's code is executed in response to an external stimulus, which takes the form of an attempted update to the reactor's state. As in classical process calculi, the reactor model accommodates collections of distributed, concurrently executing processes. However, unlike classical process calculi, our observable behaviors are sequences of states, rather than sequences of messages. Similarly, the interface to a reactor is simply its state, rather than a collection of message channels, ports, or methods. One novel feature of our model is the ability to compose behaviors both synchronously and asynchronously. Also, our use of datalog-style rules allows aspect-like composition of separately-specified functional concerns in a natural way.