Abstract
In a previous paper, we developed an algebraic theory of threads,
interleaving of threads, and interaction of threads with services.
In the current paper, we assume that the threads and services are
distributed over the nodes of a network.
We extend the theory developed so far to the distributed case by
introducing distributed interleaving strategies that support explicit
thread migration and see to load balancing or capability searching by
implicit thread migration.
The extension to the distributed case provides insight into details of
multi-threading that come up in a networked environment.
Preprint available here.