Physical aware clock skew rescheduling

Multi-parameter clock skew scheduling

“…In order to illustrate the efficiency of the proposed algorithm, we compared it with a linear programming (LP) solver for the clock period and timing slack optimization problem (13) in Section 5.1. Then we compared it with a convex programming (CP) solver for the clock period and yield-driven optimization problem (20) in Section 5.2.…”

“…The clock period and timing slack optimization problem is formulated in Problem (13). The weight of slack w s was assigned as 5.…”

“…The motivation behind MDCSS is that traditional clock skew scheduling requires the arbitrarily wide range of clock skews, which often make the clock tree hard to be implemented at the later stage of design. As a result, more buffers are needed to be inserted and hence more dynamic power is required [13].…”

Register relocation to optimize clock network for multi-domain clock skew scheduling

“…M. Saitoh et al [6] even modified previous clock schedule to have more registers with the similar required clock latency in a close area. Wei et al [7] found nearby points by Delaunay triangle in Voronoi diagram, and turned physical relations into limited constraints called geometry skew constraints during yield-oriented clock skew scheduling.…”

“…In the literature, there are two ways to follow: physical location-aware clock skew scheduling [4,5,7] and clock skew scheduling-aware placement [8].…”