IEICE TRANSACTIONS on Information
Symbolic Scheduling Techniques
Summary :
This paper describes an exact symbolic formulation of resource-constrained scheduling which allows speculative operation execution in arbitrary forward-branching control/data paths. The technique provides a closed-form solution set in which all satisfying schedules are encapsulated in a compressed OBDD-based representation. An iterative construction method is presented along with benchmark results. The experiments demonstrate the ability of the proposed technique to efficiently extract parallelism not explicitly specified in the input description.
- Publication
- IEICE TRANSACTIONS on Information Vol.E78-D No.3 pp.224-230
- Publication Date
- 1995/03/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Special Section PAPER (Special Issue on Synthesis and Verification of Hardware Design)
- Category
- High-Level Synthesis
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
Ivan P. RADIVOJEVI, Forrest BREWER, "Symbolic Scheduling Techniques" in IEICE TRANSACTIONS on Information,
vol. E78-D, no. 3, pp. 224-230, March 1995, doi: .
Abstract: This paper describes an exact symbolic formulation of resource-constrained scheduling which allows speculative operation execution in arbitrary forward-branching control/data paths. The technique provides a closed-form solution set in which all satisfying schedules are encapsulated in a compressed OBDD-based representation. An iterative construction method is presented along with benchmark results. The experiments demonstrate the ability of the proposed technique to efficiently extract parallelism not explicitly specified in the input description.
URL: https://global.ieice.org/en_transactions/information/10.1587/e78-d_3_224/_p
Copy
@ARTICLE{e78-d_3_224,
author={Ivan P. RADIVOJEVI, Forrest BREWER, },
journal={IEICE TRANSACTIONS on Information},
title={Symbolic Scheduling Techniques},
year={1995},
volume={E78-D},
number={3},
pages={224-230},
abstract={This paper describes an exact symbolic formulation of resource-constrained scheduling which allows speculative operation execution in arbitrary forward-branching control/data paths. The technique provides a closed-form solution set in which all satisfying schedules are encapsulated in a compressed OBDD-based representation. An iterative construction method is presented along with benchmark results. The experiments demonstrate the ability of the proposed technique to efficiently extract parallelism not explicitly specified in the input description.},
keywords={},
doi={},
ISSN={},
month={March},}
Copy
TY - JOUR
TI - Symbolic Scheduling Techniques
T2 - IEICE TRANSACTIONS on Information
SP - 224
EP - 230
AU - Ivan P. RADIVOJEVI
AU - Forrest BREWER
PY - 1995
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E78-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 1995
AB - This paper describes an exact symbolic formulation of resource-constrained scheduling which allows speculative operation execution in arbitrary forward-branching control/data paths. The technique provides a closed-form solution set in which all satisfying schedules are encapsulated in a compressed OBDD-based representation. An iterative construction method is presented along with benchmark results. The experiments demonstrate the ability of the proposed technique to efficiently extract parallelism not explicitly specified in the input description.
ER -
English
