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

Qi-Wei GE  

Publication
IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E82-A   No.11   pp.2579-2583
Publication Date: 1999/11/25
Online ISSN: 
DOI: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section LETTER (Special Section on Concurrent Systems Technology)
Category: 
Keyword: 
program net,  two-processor scheduling,  hybrid priority list,  genetic algorithm,  performance evaluation,  

Full Text: PDF>>
Buy this Article




Summary: 
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 give a new priority list L**. Finally, we use genetic algorithm to do the performance evaluation for the schedules generated by L** and show these schedules are quite close to optimal ones.