An Effective Dynamic Priority List for 2-Processor Scheduling of Program Nets(Special Section of Selected Papers from the 13th Workshop on Circuits and Systems in Karuizawa)

概要

論文の詳細を見る
This paper aims at improving effectiveness of previously proposed hybrid priority lists, {L^*_i=L_dL_<si>}, that are applied in nonpreemptive 2-processor scheduling of general acyclic SWITCH-less program nets, where L_d and L_<si> are dynamic and static priority lists respectively. Firstly, we investigate the effectiveness of L_d through experiments. According to the experimental results, we reconstruct L_d to propose its improved list L^1_d. Then analyzing the construction methodology of the static priority lists {L_<si>}, we propose a substituted list L^2_d by taking into account of the factor: remaining firing numbers of nodes. Finally, we combine a part of L^1_d and L^2_d to propose a 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.
一般社団法人電子情報通信学会の論文
2001-03-01