Milner’s scheduler

This real-time version of Milner’s scheduler schedules N processes arranged in a ring of nodes. Each nodes receives a start signal from the previous node to start the job and in the mean time forward the token to the next node within a given time interval. To this purpose, a node N[i] has three ports rec[i], w[i], and rec[i+1] (modulo N). the model of a node is displayed in the figure below:

Node in a Milner’s scheduler

This example is studied here. We can check in PyECDAR the robust consistency of the system composed by different number of nodes. The results are displayed in the table below: