Summary
|
For Full-Text PDF, please login, if you are a member of IEICE, or go to Pay Per View on menu list, if you are a nonmember of IEICE. |
|
Performance Evaluation of a Two-Processor Scheduling Method for Acyclic SWITCH-less Program Nets Qi-Wei GE Chen LI Mitsuru NAKATA Publication IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences Vol.E88-A No.6 pp.1502-1506 Publication Date: 2005/06/01 Online ISSN: DOI: 10.1093/ietfec/e88-a.6.1502 Print ISSN: 0916-8508 Type of Manuscript: Special Section LETTER (Special Section on Papers Selected from 2004 International Technical Conference on Circuits/Systems, Computers and Communications (ITC-CSCC 2004)) Category: Keyword: multiprocessor scheduling, program net, dynamic priority list, optimal schedule, GA scheduling, Full Text: PDF(143.6KB)>>
Summary: This paper investigates the usefulness of a new priority list for two-processor scheduling problem of program nets. Firstly, we discuss the weakness of a previously proposed priority list and then introduce a new priority list. Through simulation experiment we show that the new priority list is better than the previous one and can generate the same length of schedules as GA scheduling, which implies the new priority list can generate approximately optimal schedules. | ||||||||||
| ||||||||||
