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

Morgan Enos

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

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

Systems, architecture and hardware · 2 · 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
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 › circuit partitioning
bipartitioning
0.011999
Evaluation and optimization of replication algorithms for logic bipartitioning · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1999
Electronic design automation › physical design › circuit partitioning
logic partitioning
0.011999
Evaluation and optimization of replication algorithms for logic bipartitioning · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1999
Electronic design automation › physical design
logic replication
0.011999
Evaluation and optimization of replication algorithms for logic bipartitioning · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1999
Electronic design automation
physical design
0.011999
Evaluation and optimization of replication algorithms for logic bipartitioning · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1999

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

replication optimization · 0.0
YearPublicationVenuePosition
1999 Evaluation and optimization of replication algorithms for logic bipartitioning
abstract
Logic partitioning is an important area of very large scale integration computer aided design and there have been numerous approaches proposed. Logic replication, the duplication of logic in order to minimize communication between partitions, can be an effective component of a complete partitioning solution. In this paper we seek a better understanding of the important issues in logic replication. By adding new optimizations to existing algorithms we are able to significantly improve the quality of these techniques, achieving up to 13.9% better results than the best existing replication techniques. When integrated into our already state-of-the-art (nonreplication) partitioner, we improve overall cutsizes by 38.8%, while requiring the duplication of at most 7% of the logic.
Morgan Enos, Scott Hauck, Majid Sarrafzadeh
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.1
1997 Replication for logic bipartitioning
abstract
Logic replication, the duplication of logic in order to limit communication between partitions, is an effective part of a complete partitioning solution. In this paper we seek a better understanding of the important issues in logic replication. By developing new optimizations to existing algorithms we are able to significantly improve the quality of these techniques, achieving up to 12.5% better results than the best existing replication techniques. When integrated into our already state-of-the-art partitioner we improve overall cutsizes by 37.8%, while requiring the duplication of at most 7% of the logic.
Morgan Enos, Scott Hauck, Majid Sarrafzadeh
ICCAD1