Virtual processing in ParMod

It is shown that scheduling is necessary for implementing programming languages which allow unbounded parallelism. On the other hand, programming of scheduling mechanisms and policies for parallel activities is desired in the parallel-programming language itself. ParMod supports user scheduling by means of suspension, region statements, sequence parts and pre parts. User scheduling restricts system scheduling. Nevertheless, there exist several system scheduling mechanisms and policies that guarantee a semantical correct implementation of user scheduling.<
>