Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Patrick McGuinness

dblp:53/3329 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 2008
—ORCID · none

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

Systems, architecture and hardware · 3 · 1 first-authorTheory of computation · 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.

Theoretical computer science
1 paper
Graph algorithms and graph theory · 50% Algorithms and data structures · 50%

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

TopicWeightPapersLastEvidence papers
Graph algorithms and graph theory
graph minors
0.011992
Sequential and Parallel Algorithms to Find a K5 Minor · SODA 1992
Algorithms and data structures
parallel algorithms
0.011992
Sequential and Parallel Algorithms to Find a K5 Minor · SODA 1992
YearPublicationVenuePosition
2008 Variations, margins, and statistics
abstract
Design margining is used to account for design uncertainties in the measurement of performance, and thereby ensures that actual manufactured parts will operate in within predicted bounds. As process and environmental variations become increasingly severe and complex in nanometer process technology, design margining overheads have increased correspondingly. This paper describes the types of process and environmental variations, their impact on performance, and the traditional design margining process used to account for these uncertainties. We consider statistical timing (SSTA) in the context of its ability to reduce timing margins through more accurate modeling of variations, and quantify potential benefits of SSTA for setup and hold time margin reduction. Combining SSTA with complementary techniques for systematic variation-aware and voltage-variation-aware timing provides meaningful design margin reduction. We introduce the concept of activity based operating condition as a supporting construct for variation-aware STA flows
Patrick McGuinness
ISPD1
2005 Practical techniques to reduce skew and its variations in buffered clock networks
abstract
Clock skew is becoming increasingly difficult to control due to variations. Link based non-tree clock distribution is a cost-effective technique for reducing clock skew variations. However, previous works based on this technique were limited to unbuffered clock networks and neglected spatial correlations in the experimental validation. In this work, we overcome these shortcomings and make the link based non-tree approach feasible for realistic designs. The short circuit risk and multi-driver delay issues in buffered non-tree clock networks are investigated. Our approach is validated with SPICE based Monte Carlo simulations, considering spatial correlations among variations. The experimental results show that our approach can reduce the maximal skew by 47%, improve the skew yield from 15% to 73% on average with a decrease on the total wire and buffer capacitance.
Ganesh Venkataraman, Nikhil Jayakumar, Jiang Hu 0001, Peng Li 0001, Sunil P. Khatri, Anand Rajaram, Patrick McGuinness, Charles J. Alpert
ICCAD7
1998 An effective datapath design methodology for high-frequency design
abstract
We present a flow for effective high performance datapath design, and describe the results of this flow on a high-performance chip. This structured custom design flow combines custom logic design techniques with a timing-driven cell-based layout flow that is tuned specifically for datapath.
Carina Ben-Zvi, Patrick McGuinness, Franklin Lassandro
ICCD2
1992 Sequential and Parallel Algorithms to Find a K5 Minor
André E. Kézdy, Patrick McGuinness
SODA2