Coloured Petri Net modelling of task scheduling on a heterogeneous computational node

This paper presents the development of a Coloured Petri Net model for a concurrent application running on a heterogeneous multi/manycore node. The used software runtime (StarPu) allows the expression of the application as a DAG (Directed Acyclic Graph) of tasks and the partition of the heterogeneous hardware in worker units. The CPN modelling allows the rapid evaluation of the suitability of the implemented scheduling algorithms for a given problem and supports the process of new algorithms design and implementation. The scheduler models were validated through runs on the real architecture.