Publications

Detailed Information

Methodology for Synthesizing Clock Spine Networks : 클락 스파인 네트워크 합성 방법론

DC Field Value Language
dc.contributor.advisor김태환-
dc.contributor.author김영찬-
dc.date.accessioned2018-05-28T16:23:15Z-
dc.date.available2018-05-28T16:23:15Z-
dc.date.issued2018-02-
dc.identifier.other000000151031-
dc.identifier.urihttps://hdl.handle.net/10371/140690-
dc.description학위논문 (박사)-- 서울대학교 대학원 : 공과대학 전기·컴퓨터공학부, 2018. 2. 김태환.-
dc.description.abstractClock distribution network is used to deliver a clock signal from clock source to clock sinks (flip-flops and latches) in synchronous digital systems. However, the process variation caused by the CMOS process technology scaling increases the global clock skew. This reduces the clock speed of circuits, often causing a circuit failure. Consequently, it is essential to minimize the clock skew or control the clock skew in a bound during the synthesis of clock networks. To mitigate the clock skew induced by process variation, clock mesh network is investigated. However, though the clock mesh network provides a high variation tolerance, the clock resource and power consumption on the mesh is unacceptably high. To compromise the clock resource with clock skew variation, the clock spine network can be used as an alternative. But there is not much works which addressed the clock spine network synthesis.
This dissertation addresses the problem of developing a synthesis method for clock spine networks, which is able to systematically explore the clock resource and clock skew variability. The main idea is to transform the problem of allocating and placing clock spines on a plane into a slicing floorplan optimization problem, in which every candidate of clock spine network structures is uniquely expressed into a postfix notation to enable a fast cost computation in the slicing floorplan optimization. Recursive bipartition method and tolerance metric for spine networks are proposed to reduce clock resource consumption while keeping tolerance to variation of clock spine network at a certain level. In addition, to explore the various types of clock spine structure, methodology for synthesizing crossed clock spines is proposed as well. With crossed clock spine structure, clock skew, clock resource usage, and power consumption of clock networks can be controlled. Finally, a clock spine synthesis method that supports clock gating at spine level is proposed. Experimental results demonstrate that our proposed method successfully further reduces the clock skew, clock resource, and power consumption over the networks produced by the previous work.
-
dc.description.tableofcontentsChapter 1 Introduction 1
1.1 Clock Distribution Network 1
1.2 The Effect of Process Variations on Clock Skew 2
1.3 Clock Network Topologies 5
1.4 Microprocessor Clock Distributions 8
1.5 Contributions of This Dissertation 16
Chapter 2 Algorithm for Synthesizing Clock Spine Networks 18
2.1 Introduction 18
2.2 Preliminaries and Motivation 20
2.2.1 Proposed Clock Spine Structure 20
2.2.2 The benefits of shorting intermediate stages in reducing clock skew 20
2.2.3 Smoothing Effect of Clock Spine 25
2.3 Overall Flow 27
2.4 Determination of the Number of Clock Spines 28
2.5 Transformation of Clock Spine Allocation and Placement Problem 29
2.5.1 Clock Spine Allocation and Placement Problem 29
2.5.2 Slicing Floorplan Optimization Problem 30
2.5.3 Single-line Clock Spine Allocation and Placement Problem 31
2.5.4 Other Considerations for Single Clock Spine Allocation
and Placement 37
2.6 Application of Slicing Floorplan Optimization Algorithm 40
2.6.1 Move Operations 40
2.6.2 Rules for Legal Postfix Expressions 43
2.6.3 Cost Function for Simulated Annealing 46
2.6.4 The Starting Values of N, m, n 46
2.7 Derivation of Solution for Clock Spine Network 46
2.8 Spine-based Recursive Bipartition 47
2.9 Refinement of Clock Spine Network 47
2.10 Experimental Results 49
2.10.1 Experimental Environments 49
2.10.2 Comparison with Clock Tree Structure 51
2.10.3 Comparison with Clock Mesh Structure 54
2.10.4 Skew-resource trade-off based on tolerance metric 55
2.10.5 Run Time Analysis 57
2.10.6 The Effect of Eliminating Isolated Flip-Flops 61
2.10.7 Analysis of Intermediate Results during Simulated Annealing
Process 65
2.11 Summary 66
Chapter 3 Extensions of Algorithm for Synthesizing Clock Spine
Networks 67
3.1 Crossed Clock Spine Allocation and Placement 67
3.1.1 Introduction 67
3.1.2 Proposed Method 68
3.1.3 Experimental Results 74
3.2 Application of Clock Gating 77
3.2.1 Introduction 77
3.2.2 Activity Pattern 79
3.2.3 Problem Definition 81
3.2.4 Proposed Method 81
3.2.5 Experimental Results 82
3.3 Summary 82
Chapter 4 Conclusion 85
Appendices 87
Appendix A The Experimental Results of ISPD2010 Benchmark Circuits with Different τ Values 88
초록 100
-
dc.formatapplication/pdf-
dc.format.extent13165210 bytes-
dc.format.mediumapplication/pdf-
dc.language.isoen-
dc.publisher서울대학교 대학원-
dc.subjectClock network-
dc.subjectclock spine-
dc.subjectclock skew-
dc.subjectdelay variation-
dc.subject.ddc621.3-
dc.titleMethodology for Synthesizing Clock Spine Networks-
dc.title.alternative클락 스파인 네트워크 합성 방법론-
dc.typeThesis-
dc.contributor.AlternativeAuthorYoungchan Kim-
dc.description.degreeDoctor-
dc.contributor.affiliation공과대학 전기·컴퓨터공학부-
dc.date.awarded2018-02-
Appears in Collections:
Files in This Item:

Altmetrics

Item View & Download Count

  • mendeley

Items in S-Space are protected by copyright, with all rights reserved, unless otherwise indicated.

Share