Xiaomi Mao

dblp:79/9552 · DBLP profile ↗
← Back
3ranked-venue papers
0as first author
0since 2021 · last 2012
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 3

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design
clock network synthesis
0.112012
Integrated Clock Mesh Synthesis With Incremental Register Placement · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2012
Electronic design automation › physical design › placement › cell placement
register placement
0.112012
Integrated Clock Mesh Synthesis With Incremental Register Placement · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2012
Electronic design automation
physical design
0.012012
Integrated Clock Mesh Synthesis With Incremental Register Placement · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2012
Electronic design automation › physical design
timing optimization
0.012012
Integrated Clock Mesh Synthesis With Incremental Register Placement · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2012

Methods — techniques the papers use, named apart from their topics

simulated annealing · 0.1electrostatics-based placement · 0.1
YearPublicationVenuePosition
2012 Clock mesh synthesis with gated local trees and activity driven register clustering
abstract
A clock mesh network synthesis method is proposed which enables clock gating on the local sub-trees in order to reduce the clock power dissipation. Clock gating is performed with a register clustering strategy that considers both i) the similarity of switching activities between registers in a local area and ii) the timing slack on every local data path in the design. This is the first work known in literature that encapsulates the efficient implementation of the gated local trees and activity driven register clustering with timing slack awareness for clock mesh synthesis. Experimental results show that with gated local tree and activity driven register clustering, the switching capacitance on the mesh network can be reduced by 22% with limited skew degradation. The proposed method has two synthesis modes as low power mode and high performance mode to serve different design purposes.
Jianchao Lu, Xiaomi Mao, Baris Taskin
ICCAD2
2012 Integrated Clock Mesh Synthesis With Incremental Register Placement
abstract
A clock mesh planning and synthesis method is proposed which significantly reduces the power dissipation on the network while considering the power density and timing slack simultaneously. The proposed method is performed at the postplacement stage and consists of three major steps: 1) feasible moving region construction of each register considering timing slack; 2) mesh grid wire generation and placement; and 3) incremental register placement for stub wire minimization considering power density and timing slack. The advantages of the proposed method are the reduced power dissipation-28% on average on the benchmark circuits-the optimized power density, and the guaranteed nonnegative timing slack. These advantages are possible through a decreased timing slack (1.1% of the clock period) and change in the logic wirelength (+5.9%) on the benchmark circuits.
Jianchao Lu, Xiaomi Mao, Baris Taskin
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
2011 Timing slack aware incremental register placement with non-uniform grid generation for clock mesh synthesis
abstract
A novel clock mesh network synthesis approach is proposed in this paper which generates an improved mesh size with registers placed incrementally considering the timing slack on the data paths and the non-uniform grid wire placement. The primary objective of the method is to reduce the power dissipation without a global skew degradation, which is achieved through a sparse and non-uniform mesh implementation with registers incrementally placed in close vicinity to the mesh grids. The incremental register placement is based on the timing information in order to preserve the timing slack of the circuit. Experimental results show that the total wirelength (mesh grid wires and stub wires) as well as the power dissipation is reduced significantly on the clock mesh network. Specifically, the wirelength of the mesh network and the power dissipation of the clock network are reduced by 52% and 48% on average, respectively. Moreover, the global clock skew and the non-negative timing slack are preserved.
Jianchao Lu, Xiaomi Mao, Baris Taskin
ISPD2