Network flow-based simultaneous retiming and slack budgeting for low power design

Bei Yu, Sheqin Dong, Yuchun Ma, Tao Lin, Yu Wang, Song Chen, Satoshi Goto

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

Low power design has become one of the most significant requirements when CMOS technology entered the nanometer era. Therefore, timing budget is often performed to slow down as many components as possible so that timing slacks can be applied to reduce the power consumption while maintaining the performance of the whole design. Retiming is a procedure that involves the relocation of flip-flops (FFs) across logic gates to achieve faster clocking speed. In this paper we show that the retiming and slack budgeting problem can be formulated to a convex cost dual network flow problem. Both the theoretical analysis and experimental results show the efficiency of our approach which can not only reduce power consumption by 8.9%, but also speedup previous work by 500 times.

Original languageEnglish
Title of host publicationProceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC
Pages473-478
Number of pages6
DOIs
Publication statusPublished - 2011
Event2011 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011 - Yokohama
Duration: 2011 Jan 252011 Jan 28

Other

Other2011 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011
CityYokohama
Period11/1/2511/1/28

Fingerprint

Budget control
Electric power utilization
Relocation
Logic gates
Flip flop circuits
Costs

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Computer Science Applications
  • Computer Graphics and Computer-Aided Design

Cite this

Yu, B., Dong, S., Ma, Y., Lin, T., Wang, Y., Chen, S., & Goto, S. (2011). Network flow-based simultaneous retiming and slack budgeting for low power design. In Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC (pp. 473-478). [5722236] https://doi.org/10.1109/ASPDAC.2011.5722236

Network flow-based simultaneous retiming and slack budgeting for low power design. / Yu, Bei; Dong, Sheqin; Ma, Yuchun; Lin, Tao; Wang, Yu; Chen, Song; Goto, Satoshi.

Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. 2011. p. 473-478 5722236.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Yu, B, Dong, S, Ma, Y, Lin, T, Wang, Y, Chen, S & Goto, S 2011, Network flow-based simultaneous retiming and slack budgeting for low power design. in Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC., 5722236, pp. 473-478, 2011 16th Asia and South Pacific Design Automation Conference, ASP-DAC 2011, Yokohama, 11/1/25. https://doi.org/10.1109/ASPDAC.2011.5722236
Yu B, Dong S, Ma Y, Lin T, Wang Y, Chen S et al. Network flow-based simultaneous retiming and slack budgeting for low power design. In Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. 2011. p. 473-478. 5722236 https://doi.org/10.1109/ASPDAC.2011.5722236
Yu, Bei ; Dong, Sheqin ; Ma, Yuchun ; Lin, Tao ; Wang, Yu ; Chen, Song ; Goto, Satoshi. / Network flow-based simultaneous retiming and slack budgeting for low power design. Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC. 2011. pp. 473-478
@inproceedings{9d4859a58afa46679b8661c985db17ec,
title = "Network flow-based simultaneous retiming and slack budgeting for low power design",
abstract = "Low power design has become one of the most significant requirements when CMOS technology entered the nanometer era. Therefore, timing budget is often performed to slow down as many components as possible so that timing slacks can be applied to reduce the power consumption while maintaining the performance of the whole design. Retiming is a procedure that involves the relocation of flip-flops (FFs) across logic gates to achieve faster clocking speed. In this paper we show that the retiming and slack budgeting problem can be formulated to a convex cost dual network flow problem. Both the theoretical analysis and experimental results show the efficiency of our approach which can not only reduce power consumption by 8.9{\%}, but also speedup previous work by 500 times.",
author = "Bei Yu and Sheqin Dong and Yuchun Ma and Tao Lin and Yu Wang and Song Chen and Satoshi Goto",
year = "2011",
doi = "10.1109/ASPDAC.2011.5722236",
language = "English",
isbn = "9781424475155",
pages = "473--478",
booktitle = "Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC",

}

TY - GEN

T1 - Network flow-based simultaneous retiming and slack budgeting for low power design

AU - Yu, Bei

AU - Dong, Sheqin

AU - Ma, Yuchun

AU - Lin, Tao

AU - Wang, Yu

AU - Chen, Song

AU - Goto, Satoshi

PY - 2011

Y1 - 2011

N2 - Low power design has become one of the most significant requirements when CMOS technology entered the nanometer era. Therefore, timing budget is often performed to slow down as many components as possible so that timing slacks can be applied to reduce the power consumption while maintaining the performance of the whole design. Retiming is a procedure that involves the relocation of flip-flops (FFs) across logic gates to achieve faster clocking speed. In this paper we show that the retiming and slack budgeting problem can be formulated to a convex cost dual network flow problem. Both the theoretical analysis and experimental results show the efficiency of our approach which can not only reduce power consumption by 8.9%, but also speedup previous work by 500 times.

AB - Low power design has become one of the most significant requirements when CMOS technology entered the nanometer era. Therefore, timing budget is often performed to slow down as many components as possible so that timing slacks can be applied to reduce the power consumption while maintaining the performance of the whole design. Retiming is a procedure that involves the relocation of flip-flops (FFs) across logic gates to achieve faster clocking speed. In this paper we show that the retiming and slack budgeting problem can be formulated to a convex cost dual network flow problem. Both the theoretical analysis and experimental results show the efficiency of our approach which can not only reduce power consumption by 8.9%, but also speedup previous work by 500 times.

UR - http://www.scopus.com/inward/record.url?scp=79952905695&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=79952905695&partnerID=8YFLogxK

U2 - 10.1109/ASPDAC.2011.5722236

DO - 10.1109/ASPDAC.2011.5722236

M3 - Conference contribution

AN - SCOPUS:79952905695

SN - 9781424475155

SP - 473

EP - 478

BT - Proceedings of the Asia and South Pacific Design Automation Conference, ASP-DAC

ER -