A Two-Processor Scheduling Method for a Class of Program Nets with Unity Node Firing Time

  • Qi-Wei
  • Published 1999
This paper deals with two-processor scheduling for a class of program nets, that are acyclic and SWITCH-less, and of which each node has unity node firing time. Firstly, we introduce a hybrid priority list L∗ that generates optimal schedules for the nets whose AND-nodes possess at most single input edge. Then we extend L∗ to suit for general program nets to… (More)