The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Cet article vise à améliorer l'efficacité des listes de priorités hybrides proposées précédemment, {L*i=LdLsi}, qui sont appliqués dans la planification non préemptive à 2 processeurs des réseaux de programmes acycliques généraux sans SWITCH, où Ld et à la Lsi sont respectivement des listes de priorités dynamiques et statiques. Dans un premier temps, nous étudions l’efficacité de Ld à travers des expériences. D'après les résultats expérimentaux, nous reconstruisons Ld proposer sa liste améliorée L1d. Puis analyser la méthodologie de construction des listes de priorités statiques {Lsi}, nous proposons une liste substituée L2d en prenant en compte le facteur : nombre de nœuds restants à tirer. Enfin, nous combinons une partie de L1d et à la L2d proposer une nouvelle liste de priorités L**. Grâce à une simulation d'ordonnancement sur 400 réseaux de programmes, on retrouve la nouvelle liste de priorités L** peut générer des planifications plus courtes, proches de celles de la planification GA (algorithme génétique) qui s'est avérée extrêmement efficace mais coûte beaucoup de temps de calcul.
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.
Copier
Qi-Wei GE, Akira TANAKA, "An Effective Dynamic Priority List for 2-Processor Scheduling of Program Nets" in IEICE TRANSACTIONS on Fundamentals,
vol. E84-A, no. 3, pp. 755-762, March 2001, doi: .
Abstract: This paper aims at improving effectiveness of previously proposed hybrid priority lists, {L*i=LdLsi}, that are applied in nonpreemptive 2-processor scheduling of general acyclic SWITCH-less program nets, where Ld and Lsi are dynamic and static priority lists respectively. Firstly, we investigate the effectiveness of Ld through experiments. According to the experimental results, we reconstruct Ld to propose its improved list L1d. Then analyzing the construction methodology of the static priority lists {Lsi}, we propose a substituted list L2d by taking into account of the factor: remaining firing numbers of nodes. Finally, we combine a part of L1d and L2d to propose a new priority list L**. Through scheduling simulation on 400 program nets, we find the new priority list L** can generate shorter schedules, close to ones of GA (Genetic Algorithm) scheduling that has been shown exceedingly effective but costing much computation time.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e84-a_3_755/_p
Copier
@ARTICLE{e84-a_3_755,
author={Qi-Wei GE, Akira TANAKA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={An Effective Dynamic Priority List for 2-Processor Scheduling of Program Nets},
year={2001},
volume={E84-A},
number={3},
pages={755-762},
abstract={This paper aims at improving effectiveness of previously proposed hybrid priority lists, {L*i=LdLsi}, that are applied in nonpreemptive 2-processor scheduling of general acyclic SWITCH-less program nets, where Ld and Lsi are dynamic and static priority lists respectively. Firstly, we investigate the effectiveness of Ld through experiments. According to the experimental results, we reconstruct Ld to propose its improved list L1d. Then analyzing the construction methodology of the static priority lists {Lsi}, we propose a substituted list L2d by taking into account of the factor: remaining firing numbers of nodes. Finally, we combine a part of L1d and L2d to propose a new priority list L**. Through scheduling simulation on 400 program nets, we find the new priority list L** can generate shorter schedules, close to ones of GA (Genetic Algorithm) scheduling that has been shown exceedingly effective but costing much computation time.},
keywords={},
doi={},
ISSN={},
month={March},}
Copier
TY - JOUR
TI - An Effective Dynamic Priority List for 2-Processor Scheduling of Program Nets
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 755
EP - 762
AU - Qi-Wei GE
AU - Akira TANAKA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E84-A
IS - 3
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - March 2001
AB - This paper aims at improving effectiveness of previously proposed hybrid priority lists, {L*i=LdLsi}, that are applied in nonpreemptive 2-processor scheduling of general acyclic SWITCH-less program nets, where Ld and Lsi are dynamic and static priority lists respectively. Firstly, we investigate the effectiveness of Ld through experiments. According to the experimental results, we reconstruct Ld to propose its improved list L1d. Then analyzing the construction methodology of the static priority lists {Lsi}, we propose a substituted list L2d by taking into account of the factor: remaining firing numbers of nodes. Finally, we combine a part of L1d and L2d to propose a new priority list L**. Through scheduling simulation on 400 program nets, we find the new priority list L** can generate shorter schedules, close to ones of GA (Genetic Algorithm) scheduling that has been shown exceedingly effective but costing much computation time.
ER -