Clifford L. Gunion

dblp:73/11405 · DBLP profile ↗
← Back
1ranked-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 · 1

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 · 44% Parallel and multicore computing · 44% Integrated circuit design · 13%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › physical design
clock routing
0.112012
Subtractive Router for Tree-Driven-Grid Clocks · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2012
Parallel and multicore computing
skew mitigation
0.112012
Subtractive Router for Tree-Driven-Grid Clocks · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2012
Integrated circuit design › clocking
clock distribution
0.012012
Subtractive Router for Tree-Driven-Grid Clocks · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 2012

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

linear programming · 0.1combinatorial heuristics · 0.1
YearPublicationVenuePosition
2012 Subtractive Router for Tree-Driven-Grid Clocks
abstract
A tree-driven clock grid has become the choice of clock delivery for most microprocessors, due to its ability to achieve lower skew and lower variability than clock trees, and is becoming the choice of clock delivery for certain high-end application-specific integrated circuit designs. This paper reports on a clock routing tool that was used in designing multiple tree-driven clock grids in a 2.3 GHz processor system-on-chip, which achieved below 5 ps skew within 500$\mu{\rm m}$Manhattan distance and below 10 ps skew across each clock grid. This clock routing tool employs a nonsequential algorithm comprised of linear programming and combinatorial heuristics. Its robust length-matching capability enables flexible buffer placement, improved clock signal quality, and robustness to variations.
Haifeng Qian, Phillip J. Restle, Joseph N. Kozhaya, Clifford L. Gunion
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.4