IEICE TRANSACTIONS on Fundamentals
Assignment-Driven Loop Pipeline Scheduling and Its Application to Data-Path Synthesis
Summary :
In this paper, we study loop pipeline scheduling problem under given resource assignment (operation to functional unit assignments and data to register assignments), which is one of the key tasks in data-path synthesis based on the assignment solution space exploration. We show an approach using a precedence constraint graph with parametric disjunctive arcs generated from the specified assignment information, and derive a scheduling method using branch-and-bound exploration of the parameter space. As an application of the proposed scheduling method, it is incorporated with Simulated-Annealing (SA) based exploration of assignment solution space, and it is demonstrated that data-paths of the fifth-order elliptic wave filter are successfully synthesized.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E85-A No.4 pp.819-826
- Publication Date
- 2002/04/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Section of Selected Papers from the 14th Workshop on Circuits and Systems in Karuizawa)
- 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
Toshiyuki YOROZUYA, Koji OHASHI, Mineo KANEKO, "Assignment-Driven Loop Pipeline Scheduling and Its Application to Data-Path Synthesis" in IEICE TRANSACTIONS on Fundamentals,
vol. E85-A, no. 4, pp. 819-826, April 2002, doi: .
Abstract: In this paper, we study loop pipeline scheduling problem under given resource assignment (operation to functional unit assignments and data to register assignments), which is one of the key tasks in data-path synthesis based on the assignment solution space exploration. We show an approach using a precedence constraint graph with parametric disjunctive arcs generated from the specified assignment information, and derive a scheduling method using branch-and-bound exploration of the parameter space. As an application of the proposed scheduling method, it is incorporated with Simulated-Annealing (SA) based exploration of assignment solution space, and it is demonstrated that data-paths of the fifth-order elliptic wave filter are successfully synthesized.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e85-a_4_819/_p
Copy
@ARTICLE{e85-a_4_819,
author={Toshiyuki YOROZUYA, Koji OHASHI, Mineo KANEKO, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Assignment-Driven Loop Pipeline Scheduling and Its Application to Data-Path Synthesis},
year={2002},
volume={E85-A},
number={4},
pages={819-826},
abstract={In this paper, we study loop pipeline scheduling problem under given resource assignment (operation to functional unit assignments and data to register assignments), which is one of the key tasks in data-path synthesis based on the assignment solution space exploration. We show an approach using a precedence constraint graph with parametric disjunctive arcs generated from the specified assignment information, and derive a scheduling method using branch-and-bound exploration of the parameter space. As an application of the proposed scheduling method, it is incorporated with Simulated-Annealing (SA) based exploration of assignment solution space, and it is demonstrated that data-paths of the fifth-order elliptic wave filter are successfully synthesized.},
keywords={},
doi={},
ISSN={},
month={April},}
Copy
TY - JOUR
TI - Assignment-Driven Loop Pipeline Scheduling and Its Application to Data-Path Synthesis
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 819
EP - 826
AU - Toshiyuki YOROZUYA
AU - Koji OHASHI
AU - Mineo KANEKO
PY - 2002
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E85-A
IS - 4
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - April 2002
AB - In this paper, we study loop pipeline scheduling problem under given resource assignment (operation to functional unit assignments and data to register assignments), which is one of the key tasks in data-path synthesis based on the assignment solution space exploration. We show an approach using a precedence constraint graph with parametric disjunctive arcs generated from the specified assignment information, and derive a scheduling method using branch-and-bound exploration of the parameter space. As an application of the proposed scheduling method, it is incorporated with Simulated-Annealing (SA) based exploration of assignment solution space, and it is demonstrated that data-paths of the fifth-order elliptic wave filter are successfully synthesized.
ER -
English
