Achieving the shortest clock period by inserting the minimum amount of delay

Shangzhi Sun; David H.C. Du; Guoliang Xue

doi:10.1007/3-540-58325-4_236

Achieving the shortest clock period by inserting the minimum amount of delay

Shangzhi Sun, David H.C. Du, Guoliang Xue

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Scopus citations

Abstract

The performance of a circuit depends on its clock period. The shorter a valid clock period is, the better the performance is. The clock period is tightly related to the difference between the longest propagation delay and the shortest propagation delay from primary inputs to primaxy outputs. The objective of this paper is to minimize the amount of delay inserted while achieving the shortest clock period. Inserting delay buffers is done after traditional delay optimization. We propose an optimal algorithm based on a novel linear programming formulation. Our algorithm can also be used to solve similar delay buffer problems.

Original language	English (US)
Title of host publication	Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings
Editors	Ding-Zhu Du, Ding-Zhu Du, Xiang-Sun Zhang
Publisher	Springer Verlag
Pages	669-677
Number of pages	9
ISBN (Print)	9783540583257
DOIs	https://doi.org/10.1007/3-540-58325-4_236
State	Published - 1994
Externally published	Yes
Event	5th Annual International Symposium on Algorithms and Computation, ISAAC 1994 - Beijing, China Duration: Aug 25 1994 → Aug 27 1994

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	834 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Other

Other	5th Annual International Symposium on Algorithms and Computation, ISAAC 1994
Country/Territory	China
City	Beijing
Period	8/25/94 → 8/27/94

ASJC Scopus subject areas

Theoretical Computer Science
General Computer Science

Access to Document

10.1007/3-540-58325-4_236

Cite this

Sun, S., Du, D. H. C., & Xue, G. (1994). Achieving the shortest clock period by inserting the minimum amount of delay. In D.-Z. Du, D.-Z. Du, & X.-S. Zhang (Eds.), Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings (pp. 669-677). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 834 LNCS). Springer Verlag. https://doi.org/10.1007/3-540-58325-4_236

Achieving the shortest clock period by inserting the minimum amount of delay. / Sun, Shangzhi; Du, David H.C.; Xue, Guoliang.
Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings. ed. / Ding-Zhu Du; Ding-Zhu Du; Xiang-Sun Zhang . Springer Verlag, 1994. p. 669-677 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 834 LNCS).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Sun, S, Du, DHC & Xue, G 1994, Achieving the shortest clock period by inserting the minimum amount of delay. in D-Z Du, D-Z Du & X-S Zhang (eds), Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 834 LNCS, Springer Verlag, pp. 669-677, 5th Annual International Symposium on Algorithms and Computation, ISAAC 1994, Beijing, China, 8/25/94. https://doi.org/10.1007/3-540-58325-4_236

Sun S, Du DHC, Xue G. Achieving the shortest clock period by inserting the minimum amount of delay. In Du DZ, Du DZ, Zhang XS, editors, Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings. Springer Verlag. 1994. p. 669-677. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)). doi: 10.1007/3-540-58325-4_236

Sun, Shangzhi ; Du, David H.C. ; Xue, Guoliang. / Achieving the shortest clock period by inserting the minimum amount of delay. Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings. editor / Ding-Zhu Du ; Ding-Zhu Du ; Xiang-Sun Zhang . Springer Verlag, 1994. pp. 669-677 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).

@inproceedings{0bab6862b3ea4a82af645f4b7dbff75a,

title = "Achieving the shortest clock period by inserting the minimum amount of delay",

abstract = "The performance of a circuit depends on its clock period. The shorter a valid clock period is, the better the performance is. The clock period is tightly related to the difference between the longest propagation delay and the shortest propagation delay from primary inputs to primaxy outputs. The objective of this paper is to minimize the amount of delay inserted while achieving the shortest clock period. Inserting delay buffers is done after traditional delay optimization. We propose an optimal algorithm based on a novel linear programming formulation. Our algorithm can also be used to solve similar delay buffer problems.",

author = "Shangzhi Sun and Du, {David H.C.} and Guoliang Xue",

note = "Publisher Copyright: {\textcopyright} 1994, Springer Verlag. All rights reserved.; 5th Annual International Symposium on Algorithms and Computation, ISAAC 1994 ; Conference date: 25-08-1994 Through 27-08-1994",

year = "1994",

doi = "10.1007/3-540-58325-4_236",

language = "English (US)",

isbn = "9783540583257",

series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

publisher = "Springer Verlag",

pages = "669--677",

editor = "Ding-Zhu Du and Ding-Zhu Du and {Zhang }, Xiang-Sun",

booktitle = "Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings",

}

TY - GEN

T1 - Achieving the shortest clock period by inserting the minimum amount of delay

AU - Sun, Shangzhi

AU - Du, David H.C.

AU - Xue, Guoliang

PY - 1994

Y1 - 1994

N2 - The performance of a circuit depends on its clock period. The shorter a valid clock period is, the better the performance is. The clock period is tightly related to the difference between the longest propagation delay and the shortest propagation delay from primary inputs to primaxy outputs. The objective of this paper is to minimize the amount of delay inserted while achieving the shortest clock period. Inserting delay buffers is done after traditional delay optimization. We propose an optimal algorithm based on a novel linear programming formulation. Our algorithm can also be used to solve similar delay buffer problems.

AB - The performance of a circuit depends on its clock period. The shorter a valid clock period is, the better the performance is. The clock period is tightly related to the difference between the longest propagation delay and the shortest propagation delay from primary inputs to primaxy outputs. The objective of this paper is to minimize the amount of delay inserted while achieving the shortest clock period. Inserting delay buffers is done after traditional delay optimization. We propose an optimal algorithm based on a novel linear programming formulation. Our algorithm can also be used to solve similar delay buffer problems.

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

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

U2 - 10.1007/3-540-58325-4_236

DO - 10.1007/3-540-58325-4_236

M3 - Conference contribution

AN - SCOPUS:21844501847

SN - 9783540583257

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 669

EP - 677

BT - Algorithms and Computation - 5th International Symposium, ISAAC 1994, Proceedings

A2 - Du, Ding-Zhu

A2 - Zhang , Xiang-Sun

PB - Springer Verlag

T2 - 5th Annual International Symposium on Algorithms and Computation, ISAAC 1994

Y2 - 25 August 1994 through 27 August 1994

ER -

Achieving the shortest clock period by inserting the minimum amount of delay

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this