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 L. Heck

dblp:81/3126 · DBLP profile ↗
← Back
2ranked-venue papers
0as first author
0since 2021 · last 1992
—ORCID · none

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

Systems, architecture and hardware · 2

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 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation
physical design
0.011988
BEAVER: a computational-geometry-based tool for switchbox routing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1988
Electronic design automation › physical design
routing
0.011988
BEAVER: a computational-geometry-based tool for switchbox routing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1988
Electronic design automation › physical design › routing › detailed routing
switchbox routing
0.011988
BEAVER: a computational-geometry-based tool for switchbox routing · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1988

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

priority queue routing · 0.0line sweep · 0.0delayed layering · 0.0
YearPublicationVenuePosition
1992 Examining routing solutions
abstract
A visualization tool, Examine, is presented to aid router development. Examine has the ability to display routing operations in a variety of ways (e.g., selective display of layers and nets). In addition, Examine has rudimentary animation facilities that enable a router developer to view a sequence of routing frames or a routing frame composite.>
S. Bapat, James P. Cohoon, Patrick L. Heck, A. Ju, L. J. Randall
Great Lakes Symposium on VLSI3
1988 BEAVER: a computational-geometry-based tool for switchbox routing
abstract
BEAVER combines a delayed layering scheme with computational geometry techniques to heuristically produce a switchbox solution that minimizes both via and usage and wire length, and maximizes the use of a preferred routing layer. Other important features are its use of priority queues to determine the order in which nets are routed, and its prioritized control of individual track and column usage to prevent routing conflicts. BEAVER consists of four tools that are run successively: a corner router, a line sweep router, a thread router, and a layerer. The corner router makes single-bend terminal-to-terminal connections. The line sweep router makes straight-line connections, single-bend connections, and two-bend connections. The thread router makes connections of arbitrary form. The layerer completes the switchbox by layering wires that have been assigned a location but not yet a layer. BEAVER has successfully routed all of the classic switchboxes. Its solution quality with respect to wire length was better than, or comparable to, the best previous solutions and its via usage was consistently the minimum.>
James P. Cohoon, Patrick L. Heck
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2