Lower and upper bounds an the switching activity in scheduled data flow graphs

Kruse, L.; Schmidt, E.; Jochens, G.; Nebel, W.

doi:10.1109/lpe.1999.799425

“…In [6], the authors present an optimal algorithm for assigning operations to existing resources in the case of data flow graphs (DFGs) without loops. More recently, [14] shows that the case of DFGs with loops is NP-complete, and proposes an approximate algorithm. A key difference with our case is that in high-level synthesis, the assignment is done at synthesis time, so data values of operands are not available, but profile-data may be.…”

Section: Related Workmentioning

confidence: 99%

Dynamic Functional Unit Assignment for Low Power

Haga

¹

,

Reeves

²

,

Barua

³

et al. 2005

The Journal of Supercomputing

View full text Add to dashboard Cite

A hardware method for functional unit assignment is presented, based on the principle that a functional unit's power consumption is approximated by the switching activity of its inputs.Since computing the Hamming distance of the inputs in hardware is expensive, only a portion of the inputs are examined. Integers often have many identical top bits, due to sign extension, and floating points often have many zeros in the least significant digits, due to the casting of integer values into floating point, and other reasons. The accuracy of these approximations is studied and the results are used to develop a simple, but effective, hardware scheme.

show abstract

“…In [6], the authors present an optimal algorithm for assigning operations to existing resources in the case of data flow graphs (DFGs) without loops. More recently, [11] shows that the case of DFGs with loops is NP-complete, and proposes an approximate algorithm. The case of a modern superscalar processor employing out-of-order execution and speculation is much more complicated, however.…”

Section: Related Workmentioning

confidence: 99%

Dynamic functional unit assignment for low power

Haga¹,

Reeves²,

Barua³

et al.

2003 Design, Automation and Test in Europe Conference and Exhibition

5

0

View full text Add to dashboard Cite

A hardware method for functional unit assignment is presented, based on the principle that a functional unit's power consumption is approximated by the switching activity of its inputs.Since computing the Hamming distance of the inputs in hardware is expensive, only a portion of the inputs are examined. Integers often have many identical top bits, due to sign extension, and floating points often have many zeros in the least significant digits, due to the casting of integer values into floating point, and other reasons. The accuracy of these approximations is studied and the results are used to develop a simple, but effective, hardware scheme.

show abstract

“…In [6], the authors present an optimal algorithm for assigning operations to existing resources in the case of data flow graphs (DFGs) without loops. More recently, [14] shows that the case of DFGs with loops is NP-complete, and proposes an approximate algorithm. A key difference with our case is that in high-level synthesis, the assignment is done at synthesis time, so A runtime scheme for reducing power consumption in custom logic has been proposed [8] that reduces power in the case that operand bit-widths are often less that the maximum data width.…”

Section: Energy Modeling In Functional Unitsmentioning

confidence: 99%

Dynamic Functional Unit Assignment for Low Power

Haga¹,

Reeves²,

Barua³

et al.

Embedded Software for SoC

0

View full text Add to dashboard Cite

A hardware method for functional unit assignment is presented, based on the principle that a functional unit's power consumption is approximated by the switching activity of its inputs.Since computing the Hamming distance of the inputs in hardware is expensive, only a portion of the inputs are examined. Integers often have many identical top bits, due to sign extension, and floating points often have many zeros in the least significant digits, due to the casting of integer values into floating point, and other reasons. The accuracy of these approximations is studied and the results are used to develop a simple, but effective, hardware scheme.

show abstract

Lower and upper bounds an the switching activity in scheduled data flow graphs

Cited by 6 publications

References 0 publications

Dynamic Functional Unit Assignment for Low Power

Dynamic Functional Unit Assignment for Low Power

Dynamic functional unit assignment for low power

Dynamic Functional Unit Assignment for Low Power

Contact Info

Product

Resources

About