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

Mark Hirsch

dblp:70/51 · DBLP profile ↗
← Back
3ranked-venue papers
2as 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 · 3 · 2 first-author

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
2 papers
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
0.021992
The effect of placement of automatically extracted structure · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1992
The Min-cut Shuffle: Toward a Solution for the Global Effect Problem of Min-cut Placement · DAC 1988
Electronic design automation › physical design
placement
0.021992
The effect of placement of automatically extracted structure · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1992
The Min-cut Shuffle: Toward a Solution for the Global Effect Problem of Min-cut Placement · DAC 1988
Electronic design automation › physical design › placement › partitioning-based placement
min-cut placement
0.011988
The Min-cut Shuffle: Toward a Solution for the Global Effect Problem of Min-cut Placement · DAC 1988
Electronic design automation
logic synthesis
0.011992
The effect of placement of automatically extracted structure · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1992

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

seeding · 0.0clustering · 0.0bit-slice optimization · 0.0
YearPublicationVenuePosition
1992 The effect of placement of automatically extracted structure
abstract
A tool capable of extracting structure from a logical design was implemented, and the effect of structure on placement was studied. Results demonstrate that structure can reduce the problem complexity of a traditional placement tool when the structured portion of a design is clustered and/or seeded, thereby giving the traditional placement tool fewer cells to place. The reduction in complexity depends on the amount of structure in the logic design. In addition, placing structure may lead to better circuit performance by reducing bit-slice length, the distance a signal must travel as it traverses the combinational logic of a bit slice. The number of layer changes for clock lines and control signals can be reduced by aligning the modules connected by these signals. By strategically placing the drivers of key control signals, the lengths of their longest stubs can be reduced, thereby improving clock speed. Experiments demonstrate that structurally directed placement can reduce bit-slice length by up to 96% and clock stub length by up to 67% with negligible impact on traditional routing metrics, such as track count and wirelength.>
Mark Hirsch, Daniel P. Siewiorek
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1988 The Min-cut Shuffle: Toward a Solution for the Global Effect Problem of Min-cut Placement
Inderpal S. Bhandari, Mark Hirsch, Daniel P. Siewiorek
DAC2
1988 Automatically extracting structure from a logical design
abstract
An algorithm for extracting structure from a logical design is presented. It uses a data structure which explicitly represents not only connectivity, but also a variety of information that is generated during logical design. The algorithm is applied to a small design and used to determine the layout. Work is in progress to increase the number of functional cluster types that can be extracted and to develop additional heuristics for automatically mapping the structure onto the chip.>
Mark Hirsch, Daniel P. Siewiorek
ICCAD1