ERights Home elib 
Back to: Capability Computation 1st child: Overview: Concurrency in E On to: Distributed Programming

Concurrency
Deadlock-Free Distributed
Consistency Maintanence


Concurrency Overview Why threads are evil.
Pipelined Send Diagram Event Loop Philosophy: What would F.A. Hayek (the economist) say?
Semi-Transparency: Distributed programming is different, but not too different.
The Vat: Process-like aggregate of objects. Fails separately.
Distributed Queuing: Message-flow within and between vats.
Reference Mechanics: How do I designate thee? Let me count the ways.
Message Passing: Call-return and the eventually operator.
Vat Turns: Atomic micro-transactions
Partial Ordering: Just enough distributed sequentiality.

The Four Layers of When

  1. References as Observables
  2. The When* Reactors
  3. The when-catch Syntactic Shorthand
  4. Joining Multiple Resolutions
EIO: You mean I can't block on a read? What kind of I/O library is that?

Besides local concurrency, this section sets the ground for the next -- distributed programming.

 
Unless stated otherwise, all text on this page which is either unattributed or by Mark S. Miller is hereby placed in the public domain.
ERights Home elib 
Back to: Capability Computation 1st child: Overview: Concurrency in E On to: Distributed Programming
Download    FAQ    API    Mail Archive    Donate

report bug (including invalid html)

Golden Key Campaign Blue Ribbon Campaign