On optimality of a two-processor scheduling for program nets with combined OR-nodes.
Qi-Wei GeAkira TanakaPublished in: ISCAS (3) (2001)
Keyphrases
- multiprocessor systems
- parallel processors
- scheduling problem
- shortest path
- scheduling algorithm
- round robin
- parallel processing
- directed graph
- network structure
- end to end
- real time
- computer programs
- leaf nodes
- static analysis
- single chip
- bayesian networks
- parallel architecture
- interconnection networks
- information systems