Title :
On optimality of a two-processor scheduling for program nets with combined OR-nodes
Author :
Ge, Qi Wei ; Tanaka, Akira
Author_Institution :
Fac. of Educ., Yamaguchi Univ., Japan
Abstract :
This paper deals with two-processor scheduling of acyclic SWITCH-less program nets that include two types of nodes: AND-node and OR-node. The execution times of nodes are 1 and 0 respectively for AND-nodes and OR-nodes. For such a class of program nets, we first propose a scheduling method using a hybrid priority list, and then show its optimality under a conjecture that has been tested true for a lot of example program nets
Keywords :
data flow computing; graph theory; processor scheduling; AND-nodes; acyclic SWITCH-less program nets; combined OR-nodes; conjecture; execution times; hybrid priority list; program nets; scheduling method; two-processor scheduling; Educational programs; Genetics; Hybrid power systems; Optimal scheduling; Processor scheduling; Switches; Testing;
Conference_Titel :
Circuits and Systems, 2001. ISCAS 2001. The 2001 IEEE International Symposium on
Conference_Location :
Sydney, NSW
Print_ISBN :
0-7803-6685-9
DOI :
10.1109/ISCAS.2001.921393
