Meeting delay constraints in DSM by minimal repeater insertion

I-Min Liu; A. Aziz; D. F. Wong

doi:10.1145/343647.343814

Meeting delay constraints in DSM by minimal repeater insertion

I-Min Liu, A. Aziz, D. F. Wong

Office of the Provost

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

18 Citations (Scopus)

Abstract

We address the problem of inserting repeaters, selected from a library, at feasible locations in a placed and routed network to meet user-specified delay constraints for deep submicron (DSM) technology. We use minimal repeater area by taking advantage of slacks available in the network. Specifically, we transform the problem into an unconstrained optimization problem and solve it by iterative local refinement. We show that the optimal repeater locations and sizes that locally minimize the objective function in the unconstrained problem can be efficiently computed. We have implemented our algorithm and tested it on a set of benchmarks; experimental results are promising.

Original language	English
Title of host publication	Proceedings Design, Automation and Test in Europe Conference and Exhibition, DATE 2000
Publisher	IEEE
Pages	436-440
Number of pages	5
ISBN (Print)	0769505376, 9781581132441
DOIs	https://doi.org/10.1145/343647.343814 https://doi.org/10.1109/DATE.2000.840307
Publication status	Published - 27 Mar 2000
Event	2000 Design, Automation and Test in Europe Conference and Exhibition, DATE 2000 - Paris, France Duration: 27 Mar 2000 → 30 Mar 2000 https://ieeexplore.ieee.org/xpl/conhome/6761/proceeding (Conference proceedings) https://dl.acm.org/doi/proceedings/10.1145/343647 (Conference proceedings)

Publication series

Name	Proceedings Design, Automation and Test in Europe Conference and Exhibition, DATE

Conference

Conference	2000 Design, Automation and Test in Europe Conference and Exhibition, DATE 2000
Country/Territory	France
City	Paris
Period	27/03/00 → 30/03/00
Internet address	https://ieeexplore.ieee.org/xpl/conhome/6761/proceeding (Conference proceedings) https://dl.acm.org/doi/proceedings/10.1145/343647 (Conference proceedings)

Access to Document

Cite this

Liu, I.-M., Aziz, A., & Wong, D. F. (2000). Meeting delay constraints in DSM by minimal repeater insertion. In Proceedings Design, Automation and Test in Europe Conference and Exhibition, DATE 2000 (pp. 436-440). (Proceedings Design, Automation and Test in Europe Conference and Exhibition, DATE). IEEE. https://doi.org/10.1145/343647.343814, https://doi.org/10.1109/DATE.2000.840307

@inproceedings{01d870715d5b43089effc3e059eba931,

title = "Meeting delay constraints in DSM by minimal repeater insertion",

abstract = "We address the problem of inserting repeaters, selected from a library, at feasible locations in a placed and routed network to meet user-specified delay constraints for deep submicron (DSM) technology. We use minimal repeater area by taking advantage of slacks available in the network. Specifically, we transform the problem into an unconstrained optimization problem and solve it by iterative local refinement. We show that the optimal repeater locations and sizes that locally minimize the objective function in the unconstrained problem can be efficiently computed. We have implemented our algorithm and tested it on a set of benchmarks; experimental results are promising.",

author = "I-Min Liu and A. Aziz and Wong, {D. F.}",

year = "2000",

month = mar,

day = "27",

doi = "10.1145/343647.343814",

language = "English",

isbn = "0769505376",

series = "Proceedings Design, Automation and Test in Europe Conference and Exhibition, DATE",

publisher = "IEEE",

pages = "436--440",

booktitle = "Proceedings Design, Automation and Test in Europe Conference and Exhibition, DATE 2000",

address = "United States",

note = "2000 Design, Automation and Test in Europe Conference and Exhibition, DATE 2000 ; Conference date: 27-03-2000 Through 30-03-2000",

url = "https://ieeexplore.ieee.org/xpl/conhome/6761/proceeding, https://dl.acm.org/doi/proceedings/10.1145/343647",

}

Liu, I-M, Aziz, A & Wong, DF 2000, Meeting delay constraints in DSM by minimal repeater insertion. in Proceedings Design, Automation and Test in Europe Conference and Exhibition, DATE 2000. Proceedings Design, Automation and Test in Europe Conference and Exhibition, DATE, IEEE, pp. 436-440, 2000 Design, Automation and Test in Europe Conference and Exhibition, DATE 2000, Paris, France, 27/03/00. https://doi.org/10.1145/343647.343814, https://doi.org/10.1109/DATE.2000.840307

Meeting delay constraints in DSM by minimal repeater insertion. / Liu, I-Min; Aziz, A.; Wong, D. F.
Proceedings Design, Automation and Test in Europe Conference and Exhibition, DATE 2000. IEEE, 2000. p. 436-440 (Proceedings Design, Automation and Test in Europe Conference and Exhibition, DATE).

Research output: Chapter in book/report/conference proceeding › Conference proceeding › peer-review

TY - GEN

T1 - Meeting delay constraints in DSM by minimal repeater insertion

AU - Liu, I-Min

AU - Aziz, A.

AU - Wong, D. F.

PY - 2000/3/27

Y1 - 2000/3/27

N2 - We address the problem of inserting repeaters, selected from a library, at feasible locations in a placed and routed network to meet user-specified delay constraints for deep submicron (DSM) technology. We use minimal repeater area by taking advantage of slacks available in the network. Specifically, we transform the problem into an unconstrained optimization problem and solve it by iterative local refinement. We show that the optimal repeater locations and sizes that locally minimize the objective function in the unconstrained problem can be efficiently computed. We have implemented our algorithm and tested it on a set of benchmarks; experimental results are promising.

AB - We address the problem of inserting repeaters, selected from a library, at feasible locations in a placed and routed network to meet user-specified delay constraints for deep submicron (DSM) technology. We use minimal repeater area by taking advantage of slacks available in the network. Specifically, we transform the problem into an unconstrained optimization problem and solve it by iterative local refinement. We show that the optimal repeater locations and sizes that locally minimize the objective function in the unconstrained problem can be efficiently computed. We have implemented our algorithm and tested it on a set of benchmarks; experimental results are promising.

UR - https://dl.acm.org/doi/10.1145/343647.343814

UR - https://ieeexplore.ieee.org/document/840307

UR - https://www.scopus.com/record/display.uri?eid=2-s2.0-84893706459&origin=inward

U2 - 10.1145/343647.343814

DO - 10.1145/343647.343814

M3 - Conference proceeding

SN - 0769505376

SN - 9781581132441

T3 - Proceedings Design, Automation and Test in Europe Conference and Exhibition, DATE

SP - 436

EP - 440

BT - Proceedings Design, Automation and Test in Europe Conference and Exhibition, DATE 2000

PB - IEEE

T2 - 2000 Design, Automation and Test in Europe Conference and Exhibition, DATE 2000

Y2 - 27 March 2000 through 30 March 2000

ER -

Meeting delay constraints in DSM by minimal repeater insertion

Abstract

Publication series

Conference

Access to Document

Other files and links

Fingerprint

Cite this