Actor model implementation

In computer science, Actor model implementation concerns implementation issues for the Actor model.

Cosmic Cube
The Caltech Cosmic Cube was developed by Chuck Seitz et al. at Caltech providing architectural support for Actor systems. A significant difference between the Cosmic Cube and most other parallel processors is that this multiple instruction multiple-data machine uses message passing instead of shared variables for communication between concurrent processes. This computational model is reflected in the hardware structure and operating system, and is also the explicit message passing communication seen by the programmer. According to Seitz [1985]:


 * It was a premise of the Cosmic Cube experiment that the internode communication should scale well to very large numbers of nodes. A direct network like the hypercube satisfies this requirement, with respect to both the aggregate bandwidth achieved across the many concurrent communication channels and the feasibility of the implementation. The hypercube is actually a distributed variant of an indirect logarithmic switching network like the Omega or banyan networks: the kind that might be used in shared-storage organizations. With the hypercube, however, communication paths traverse different numbers of channels and so exhibit different latencies. It is possible, therefore, to take advantage of communication locality in placing processes in nodes.

J–Machine
The J–Machine was developed by Bill Dally et al. at MIT providing architectural support suitable for Actors. This included the following: Concurrent Smalltalk (which can be modeled using Actors) was developed to program the J Machine.
 * Asynchronous messaging
 * A uniform space of Actor addresses to which messages could be sent concurrently regardless of whether the recipient Actor was local or nonlocal
 * A form of Actor pipelining (see Actor model)

Prototype Actor Programming Language
Hewitt [2006] presented a prototype Actor programming language in the sense that it directly expresses important aspects of the behavior of Actors. Messages are expressed in XML using the notation :&lt;tag&gt;[&lt;element&gt;1 ... &lt;element&gt;] for
 * “&lt;”&lt;tag&gt;“&gt;” &lt;element&gt;1 ... &lt;element&gt;n “&lt;”/&lt;tag&gt;“&gt;”

The semantics of the programming language are defined by defining each program construct as an Actor with its own behavior. Execution is modeled by having Eval messages passed among program constructs during execution.

Environment Actors
Each Eval message has the address of an Actor that acts as an environment with the bindings of program identifiers. Environment Actors are immutable, i.e., they do not change. When Request[Bind[identifier value] customer] is received by an Actor Environment, a new environment Actor is created such that when the new environment Actor receives Request[Lookup[identifier’] customer’] then if identifier is the same as identifier’ send customer’ Returned[value], else send Environment Request[Lookup[identifier’] customer’]. The above builds on an Actor EmptyEnvironment which when it receives Request[Lookup[identifier] customer], sends customer Thrown[NotFound[identifier]]. When it receives a Bind request EmptyEnvironment acts like Environment above.

Expressions
The prototype programming language has expressions of the following kinds:


 * &lt;identifier&gt;
 * When Request[Eval[environment] customer] is received, send environment Request[Lookup[&lt;identifier&gt;] customer]


 * send &lt;recipient&gt; &lt;communication&gt;
 * When Request[Eval[environment] customer] is received, send &lt;recipient&gt; Request[Eval[environment] evalCustomer1] where evalCustomer1  is a new Actor such that
 * when evalCustomer1 receives the communication Returned[theRecipient], then send &lt;communication&gt;
 * Request[Eval[environment] evalCustomer2] where evalCustomer2 is a new actor such that
 * when evalCustomer2 receives the communication Returned[theCommunication], then send theRecipient theCommunication.


 * &lt;recipient&gt;.&lt;message&gt;
 * When Request[Eval[environment] customer] is received, send &lt;recipient&gt; Request[Eval[environment] evalCustomer1] such that
 * when evalCustomer1 receives the communication Returned[theRecipient],  then send &lt;message&gt;  Request[Eval[environment] evalCustomer2] such that
 * when evalCustomer2 receives the communication Returned[theMessage], then send theRecipient
 * Request[theMessage customer]


 * receiver ... &lt;pattern&gt;i &lt;expression&gt;i ...
 * When Request[Eval[environment] customer] is received, send customer a new actor theReceiver such that
 * when theReceiver receives a communication com, then create a new bindingCustomer and send environment
 * Request[Bind[&lt;pattern&gt;i com] bindingCustomer] and
 * if bindingCustomer receives Returned[environment’], send &lt;expression&gt;i
 * Request[Eval[environment’]]
 * otherwise if bindingCustomer receives Thrown[...], try &lt;pattern&gt;i+1


 * behavior ... &lt;pattern&gt;i &lt;expression&gt;i ...
 * When Request[Eval[environment] customer] is received, send customer a new actor theReceiver such that
 * when theReceiver receives Request[message customer’], then create a new bindingCustomer and send environment
 * Request[bind[&lt;pattern&gt;i message] customer’] and
 * if bindingCustomer receives Returned[environment’], send &lt;expression&gt;i
 * Request[Eval[environment’] customer’]
 * otherwise if bindingCustomer receives Thrown[...], try &lt;pattern&gt;i+1


 * {&lt;expression&gt;1, &lt;expression&gt;2}
 * When Request[Eval[environment] customer] is received, send &lt;expression&gt;1 Request[Eval[environment]] and concurrently send &lt;expression&gt;2  Request[Eval[environment]] customer].


 * let &lt;identifier&gt; = &lt;expression&gt;value in &lt;expression&gt;body
 * When message[Eval[environment] customer] is received, then create a new evalCustomer and send &lt;expression&gt;value
 * Request[Eval[environment] evalCustomer1.
 * When evalCustomer receives Returned[theValue], create a new bindingCustomer and send environment
 * Request[bind[&lt;identifier&gt; theValue] bindingCustomer]
 * When bindingCustomer receives Returned[environment’], send &lt;expression&gt;body Request[Eval[environment’] customer]


 * serializer &lt;expression&gt;
 * When Request[Eval[environment] customer] is received, then send customer Returned[theSerializer] where theSerializer is a new actor such that communications sent to theSerializer are processed in FIFO order with a behavior Actor that is initially &lt;expression&gt;.Eval[environment] and
 * When communication com is received by theSerializer, then send the behavior Actor Request[com customer’] where customer’ is a new actor such that
 * when customer’ receives Returned[theNextBehavior] then theNextBehavior is used as the behavior Actor for the next communication received by theSerializer.

Example program
An example program for a simple storage cell that can contain any Actor address is as follows:


 * Cell ≡
 * receiver
 * Request[Create[initial] customer]
 * send customer Returned[serializer ReadWrite(initial)]

The above program which creates a storage cell makes use of the behavior ReadWrite which is defined as follows:


 * ReadWrite(contents) ≡
 * behavior
 * Request[read[] customer]
 * {send customer Returned[contents], ReadWrite(contents)}
 * Request[write[x] customer]
 * {send customer Returned[], ReadWrite(x)}

The above behavior is pipelined, i.e., the behavior might still be processing a previous read or write message while it is processing a subsequent read or write message.. For example, the following expression creates a cell x with initial contents 5 and then concurrently writes to it with the values 7 and 9.


 * let x = Cell.Create[5] in {x.write[7], x.write[9], x.read[]}

The value of the above expression is 5, 7 or 9.