Speculation techniques for high level synthesis of control intensive designs

Gupta, Sumit Kumar; Savoiu, Nick; Kim, Sunwoo; Dutt, Nikil; Gupta, Rajesh K.; Nicolau, Alex

doi:10.1145/378239.378481

Cited by 33 publications

(40 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, frequently there are situations in which there is a need to move operations into conditionals [2,3]. This may be done by reverse speculation, where operations before conditionals are moved into subsequent conditional blocks and executed conditionally, or it may be done by conditional speculation, in which an operation from after the conditional block is duplicated up into preceding conditional branches and executed conditionally.…”

Section: Speculative Code Motionsmentioning

confidence: 99%

“…These code motions enable the movement of operations through, across and into conditionals with the objective of maximising performance [2,3]. However, this means that the heuristics that guide these code motions have to manage the resource utilisation across several basic blocks.…”

Section: Introductionmentioning

confidence: 99%

“…The paper builds on our earlier presentations [2,3] in which we introduced the individual speculative code motions that can be applied for improving resource utilisation and hence synthesis results. It introduces the notion of dynamic branch balancing and the heuristics to guide the speculative code motions for improving the quality of synthesis results.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Dynamically increasing the scope of code motions during the high-level synthesis of digital circuits

Gupta

Dutt

Gupta

et al. 2003

IEE Proc., Comput. Digit. Tech.

View full text Add to dashboard Cite

The quality of high-level synthesis results for designs with complex and nested conditionals and loops can be improved significantly by employing speculative code motions. Two techniques are presented that add scheduling steps to the branch of a conditional construct with fewer scheduling steps. This 'balances' or equalises the number of scheduling steps in the conditional branches and increases the scope for application of speculative code motions. These branch balancing techniques have been applied 'dynamically' during scheduling. The authors have implemented algorithms for dynamic branch balancing techniques in a C-to-VHDL high-level synthesis framework called Spark. The utility of these techniques is demonstrated by experimental results on four designs derived from two moderately complex applications, namely, MPEG-1 and the GIMP image processing tool. These results show that the two branch balancing techniques can reduce the cycles on the longest path through the design by up to 38% and the number of states in the controller by up to 37%.

show abstract

Section: Speculative Code Motionsmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Dynamically increasing the scope of code motions during the high-level synthesis of digital circuits

Gupta

Dutt

Gupta

et al. 2003

IEE Proc., Comput. Digit. Tech.

View full text Add to dashboard Cite

show abstract

“…We demonstrate the utility of these techniques by presenting results for experiments performed on two large industrial strength designs derived from the multi-media and image processing domains. This paper builds upon our earlier presentations in [2,3] where we introduced the individual speculative code motions that can be applied for improved resource utilization. In this paper, we introduce the notion of dynamic branch balancing and the heuristics to guide the speculative code motions for improved quality of synthesis results.…”

Section: Introductionmentioning

confidence: 99%

“…These code motions enable the movement of operations through, beyond, and into conditionals with the objective of maximizing performance [1,2,3]. However, this means that the heuristics that guide these code motions have to carefully manage the resource utilization across several basic blocks.…”

Section: Introductionmentioning

confidence: 99%

Dynamic conditional branch balancing during the high-level synthesis of control-intensive designs

Cupta¹,

Dutt²,

Gupta³

et al.

2003 Design, Automation and Test in Europe Conference and Exhibition

View full text Add to dashboard Cite

We present two novel strategies to increase the scope for application of speculative code motions: (1) Adding scheduling steps dynamically during scheduling to conditional branches with fewer scheduling steps. This increases the opportunities to apply code motions such as conditional speculation that duplicate operations into the branches of a conditional block. (2) Determining if an operation can be conditionally speculated into multiple basic blocks either by using existing idle resources or by creating new scheduling steps. These strategies lead to balancing of the number of steps in the conditional branches without increasing the longest path through the conditional block. Algorithms for these strategies have been implemented within the Spark high-level synthesis framework that accepts a behavioral description in ANSI-C as input and produces synthesizable register-transfer level VHDL. Experiments on two moderately complex industrial-strength applications, namely, MPEG-1 and the GIMP image processing tool, demonstrate that conditional speculation is ineffective without using these strategies.

show abstract

Compiler-Directed ILP Extraction for Clustered VLIW/EPIC Machines

Pillai

Jacome

Embedded Software for SoC

View full text Add to dashboard Cite

Speculation techniques for high level synthesis of control intensive designs

Cited by 33 publications

References 11 publications

Dynamically increasing the scope of code motions during the high-level synthesis of digital circuits

Dynamically increasing the scope of code motions during the high-level synthesis of digital circuits

Dynamic conditional branch balancing during the high-level synthesis of control-intensive designs

Compiler-Directed ILP Extraction for Clustered VLIW/EPIC Machines

Contact Info

Product

Resources

About