NDLI: Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost

Content Provider	IEEE Xplore Digital Library
Author	Weiping Shi Zhuo Li Alpert, C.J.
Copyright Year	2004
Description	Author affiliation: Texas A&M University (Weiping Shi)
Abstract	As gate delays d e e m faster than wire delays for each teehnolagy generation, buffer insertion hecomes a popular method to reduce the interconnecI delay. Several modem huffer insertion algorithms (e.g.. 17.6.151) are based on van Ginneken¿s dynamic programming paradigm [141. However, van Ginneken¿s original algorithm does not control buffering resources and tends to over-buffering, thereby wasting area and power. It has been a major open prohlem whether it is possible to optimize slack and at the same time minimize the buffer usage. This paper settles this open problem by showing that for arbitrary integer cost functions, the problem is NP-complete. We also extend the prr-buffer slack technique (121 to minimize the buffer cost. This technique can significantly reduce the running time and memory in buffer cost miniminition problem. The experimental results show that our algorithm can speed up the running time up to 17 times and reduces the memory to 1/30 of traditional best know algorithm. Finally, we show how to efficiently deal with multiway merge in buffer insertion.
Sponsorship	IEEE Circuits and Syst. Soc. ACM SIGDA Inst. of Electron., Information and Commun. Eng. Information Processing Soc. of Japan
Starting Page	609
Ending Page	614
File Size	384540
Page Count	6
File Format	PDF
ISBN	0780381750
DOI	10.1109/ASPDAC.2004.1337664
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2004-01-27
Publisher Place	Japan
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Cost function Delay Timing Wire Repeaters Polynomials Modems Dynamic programming Explosions Steiner trees
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost (2004)

Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost

Comptexity analysis and speedup techniques for optimal buffer insertion with minimum cost

Rectilinear Steiner Trees with Minimum Elmore Delay

A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion

An O(mn) time algorithm for optimal buffer insertion of nets with m sinks

Optimal wire sizing and buffer insertion for low power and a generalized delay model

Layout-Aware Gate Duplication and Buffer Insertion

Performance-Driven Routing Tree Construction with Buffer Insertion, Wire Sizing under RLC Delay Model

Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost

Similar Documents

Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost (2004)

Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost

Comptexity analysis and speedup techniques for optimal buffer insertion with minimum cost

Rectilinear Steiner Trees with Minimum Elmore Delay

A fully polynomial time approximation scheme for timing driven minimum cost buffer insertion

An O(mn) time algorithm for optimal buffer insertion of nets with m sinks

Optimal wire sizing and buffer insertion for low power and a generalized delay model

Layout-Aware Gate Duplication and Buffer Insertion

Performance-Driven Routing Tree Construction with Buffer Insertion, Wire Sizing under RLC Delay Model

Complexity analysis and speedup techniques for optimal buffer insertion with minimum cost