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
Dans cet article, nous étudions le problème de planification de pipeline en boucle sous une affectation de ressources donnée (opération sur les affectations d'unités fonctionnelles et données pour enregistrer les affectations), qui est l'une des tâches clés de la synthèse des chemins de données basée sur l'exploration spatiale des solutions d'affectation. Nous montrons une approche utilisant un graphe de contraintes de préséance avec des arcs disjonctifs paramétriques générés à partir des informations d'affectation spécifiées, et dérivons une méthode d'ordonnancement utilisant l'exploration de branchement et de liaison de l'espace des paramètres. En tant qu'application de la méthode de planification proposée, elle est incorporée à l'exploration de l'espace de solutions d'affectation basée sur le recuit simulé (SA), et il est démontré que les chemins de données du filtre à ondes elliptiques du cinquième ordre sont synthétisés avec succès.
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
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
Copier
@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},}
Copier
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 -