IEICE TRANSACTIONS on Fundamentals
A New Proposal to Two-Processor Scheduling Problem for SWITCH-less Program Nets
Summary :
This paper provides a list-scheduling method for program nets executed with two processors. The program nets dealt with in this paper are acyclic and SWITCH-less, and the priority list proposed in this paper consists of both dynamic and static lists. First, we point out the weakness of a previously proposed priority list and propose a new priority list. Then we give properties of the new priority list and further prove this new priority list can generate optimal schedules for the program nets whose AND-nodes possess at most single input edge. Finally, we compare the new priority list with the previous one to show the new priority list can generate shorter schedules than the previous for the nets whose AND-nodes may have two input edges.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E87-A No.11 pp.2859-2867
- Publication Date
- 2004/11/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section on Concurrent Systems and Hybrid Systems)
- Category
- Concurrent Systems
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, "A New Proposal to Two-Processor Scheduling Problem for SWITCH-less Program Nets" in IEICE TRANSACTIONS on Fundamentals,
vol. E87-A, no. 11, pp. 2859-2867, November 2004, doi: .
Abstract: This paper provides a list-scheduling method for program nets executed with two processors. The program nets dealt with in this paper are acyclic and SWITCH-less, and the priority list proposed in this paper consists of both dynamic and static lists. First, we point out the weakness of a previously proposed priority list and propose a new priority list. Then we give properties of the new priority list and further prove this new priority list can generate optimal schedules for the program nets whose AND-nodes possess at most single input edge. Finally, we compare the new priority list with the previous one to show the new priority list can generate shorter schedules than the previous for the nets whose AND-nodes may have two input edges.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e87-a_11_2859/_p
Copy
@ARTICLE{e87-a_11_2859,
author={Qi-Wei GE, Chen LI, Mitsuru NAKATA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A New Proposal to Two-Processor Scheduling Problem for SWITCH-less Program Nets},
year={2004},
volume={E87-A},
number={11},
pages={2859-2867},
abstract={This paper provides a list-scheduling method for program nets executed with two processors. The program nets dealt with in this paper are acyclic and SWITCH-less, and the priority list proposed in this paper consists of both dynamic and static lists. First, we point out the weakness of a previously proposed priority list and propose a new priority list. Then we give properties of the new priority list and further prove this new priority list can generate optimal schedules for the program nets whose AND-nodes possess at most single input edge. Finally, we compare the new priority list with the previous one to show the new priority list can generate shorter schedules than the previous for the nets whose AND-nodes may have two input edges.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - A New Proposal to Two-Processor Scheduling Problem for SWITCH-less Program Nets
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2859
EP - 2867
AU - Qi-Wei GE
AU - Chen LI
AU - Mitsuru NAKATA
PY - 2004
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E87-A
IS - 11
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - November 2004
AB - This paper provides a list-scheduling method for program nets executed with two processors. The program nets dealt with in this paper are acyclic and SWITCH-less, and the priority list proposed in this paper consists of both dynamic and static lists. First, we point out the weakness of a previously proposed priority list and propose a new priority list. Then we give properties of the new priority list and further prove this new priority list can generate optimal schedules for the program nets whose AND-nodes possess at most single input edge. Finally, we compare the new priority list with the previous one to show the new priority list can generate shorter schedules than the previous for the nets whose AND-nodes may have two input edges.
ER -
English
