IEICE TRANSACTIONS on Fundamentals
Performance Evaluation of a Two-Processor Scheduling Method for Acyclic SWITCH-less Program Nets
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E88-A No.6 pp.1502-1506
- Publication Date
- 2005/06/01
- Publicized
- Online ISSN
- DOI
- 10.1093/ietfec/e88-a.6.1502
- 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
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Qi-Wei GE, Chen LI, Mitsuru NAKATA, "Performance Evaluation of a Two-Processor Scheduling Method for Acyclic SWITCH-less Program Nets" in IEICE TRANSACTIONS on Fundamentals,
vol. E88-A, no. 6, pp. 1502-1506, June 2005, doi: 10.1093/ietfec/e88-a.6.1502.
Abstract: 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.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e88-a.6.1502/_p
Copy
@ARTICLE{e88-a_6_1502,
author={Qi-Wei GE, Chen LI, Mitsuru NAKATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Performance Evaluation of a Two-Processor Scheduling Method for Acyclic SWITCH-less Program Nets},
year={2005},
volume={E88-A},
number={6},
pages={1502-1506},
abstract={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.},
keywords={},
doi={10.1093/ietfec/e88-a.6.1502},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Performance Evaluation of a Two-Processor Scheduling Method for Acyclic SWITCH-less Program Nets
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1502
EP - 1506
AU - Qi-Wei GE
AU - Chen LI
AU - Mitsuru NAKATA
PY - 2005
DO - 10.1093/ietfec/e88-a.6.1502
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E88-A
IS - 6
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - June 2005
AB - 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.
ER -
English
