Go backward to Example Go up to Top Go forward to Scheduler

Programming Model

• Functional Parallelism
  • Task Creation: t = dist[start](f, ...).
  • Synchronization: r = dist[wait](t).
• Non-Determinism
  • Selection: (i, r) = dist[select](tlist).
  • Abortion: dist[delete](t).
• Shared Data Objects
  • Create empty object: d = dist[data]().
  • Write data: dist[put](d, v).
  • Wait for data: v = dist[get](d).

Derived from functional/logic/dataflow models.