Scheduling cooperative work: viewing distributed systems as both CSP and SCL

The authors propose to view cooperating tasks in distributed systems as both CSPs: (communicating sequential processes) and SCLs (sequential cooperating layers). This dual, complementary, view of distributed systems is based on the notion of communication closed layers. The same state-space abstraction and global assertions that were used for the design, development, verification, and testing of such systems are used as the guide and support for scheduling. With a given partition and a given mapping the scheduling guarantees the best performance. It takes advantage of the syntactic visibility of the logic behind task cooperation