A Scheduling Method Using Boolean Equations in High-Level Synthesis
Summary :
This paper describes two algorithms based on Boolean formulations aimed at solving scheduling, the main subtask of data path synthesis. Using the first algorithm, all possible scheduling solutions can be obtained under a time constraint, something that cannot be accomplished with other available systems. The second algorithm produces feasible solutions without increasing the complexity of the problem. The effectiveness of the algorithms is confirmed through experimental studies.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E75-A No.12 pp.1728-1731
- Publication Date
- 1992/12/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section LETTER (Special Section on the 1992 IEICE Fall Conference)
- 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
Toshiaki MIYAZAKI, "A Scheduling Method Using Boolean Equations in High-Level Synthesis" in IEICE TRANSACTIONS on Fundamentals,
vol. E75-A, no. 12, pp. 1728-1731, December 1992, doi: .
Abstract: This paper describes two algorithms based on Boolean formulations aimed at solving scheduling, the main subtask of data path synthesis. Using the first algorithm, all possible scheduling solutions can be obtained under a time constraint, something that cannot be accomplished with other available systems. The second algorithm produces feasible solutions without increasing the complexity of the problem. The effectiveness of the algorithms is confirmed through experimental studies.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/e75-a_12_1728/_p
Copy
@ARTICLE{e75-a_12_1728,
author={Toshiaki MIYAZAKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={A Scheduling Method Using Boolean Equations in High-Level Synthesis},
year={1992},
volume={E75-A},
number={12},
pages={1728-1731},
abstract={This paper describes two algorithms based on Boolean formulations aimed at solving scheduling, the main subtask of data path synthesis. Using the first algorithm, all possible scheduling solutions can be obtained under a time constraint, something that cannot be accomplished with other available systems. The second algorithm produces feasible solutions without increasing the complexity of the problem. The effectiveness of the algorithms is confirmed through experimental studies.},
keywords={},
doi={},
ISSN={},
month={December},}
Copy
TY - JOUR
TI - A Scheduling Method Using Boolean Equations in High-Level Synthesis
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1728
EP - 1731
AU - Toshiaki MIYAZAKI
PY - 1992
DO -
JO - IEICE TRANSACTIONS on Fundamentals
SN -
VL - E75-A
IS - 12
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - December 1992
AB - This paper describes two algorithms based on Boolean formulations aimed at solving scheduling, the main subtask of data path synthesis. Using the first algorithm, all possible scheduling solutions can be obtained under a time constraint, something that cannot be accomplished with other available systems. The second algorithm produces feasible solutions without increasing the complexity of the problem. The effectiveness of the algorithms is confirmed through experimental studies.
ER -
English
