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

Alvar A. Dean

dblp:35/4519 · DBLP profile ↗
← Back
4ranked-venue papers
0as first author
0since 2021 · last 1991
—ORCID · none

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

Systems, architecture and hardware · 4

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.021991
Multistack optimization for data-path chip layout · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991
Multi-Stack Optimization for Data-Path Chip (Microprocessor) Layout · DAC 1989
Electronic design automation › physical design
floorplanning
0.011991
Multistack optimization for data-path chip layout · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991
Electronic design automation › physical design
placement and routing
0.011991
Multistack optimization for data-path chip layout · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1991
Electronic design automation › physical design › VLSI layout
datapath layout
0.011989
Multi-Stack Optimization for Data-Path Chip (Microprocessor) Layout · DAC 1989

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

multistack optimization · 0.0
YearPublicationVenuePosition
1991 Multistack optimization for data-path chip layout
abstract
A special multistack structure and optimization technique to partition, place, and wire the data-path macros in the form of the multistack structure are described, taking into account the connectivity of all the chip logic (data path, control logic, chip drivers, on-chip memory). The overall objective is: to fit the circuits within the chip boundary; to ensure data-path internal wirability; as well as external stack wirability to the other circuits; and to minimize wire lengths for wirability and timing. A tool for automatic multistack optimization has been implemented and applied successfully to layout high-density data path chips.>
Wing K. Luk, Alvar A. Dean
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.2
1990 Partitioning and floor-planning for data-path chip (microprocessor) layout
Wing K. Luk, Alvar A. Dean, John W. Mathews
Integr.2
1989 Multi-Stack Optimization for Data-Path Chip (Microprocessor) Layout
abstract
As data-path chips such as microprocessors and RISC chips become more complex, multiple stacks of data-path macros are required to implement the entire data-path. The physical decomposition of a chip into a single data-path stack, and control logic of random logic as in the past is not always feasible. This paper describes a special multi-stack structure, optimization techniques and algorithms to partition, place and wire the data-path macros in the form of the multi-stack structure, taking into account the connectivity of the entire chip logic (data-path, control logic, chip drivers, on-chip memory). The overall objective is: (1) to fit the circuits within the chip, (2) to ensure data-path wireability, including stack to random logic wireability, and (3) to minimize wire lengths for wireability and timing. A tool for automatic multi-stack optimization has been implemented and applied successfully to layout some high density data-path chips.
Wing K. Luk, Alvar A. Dean
DAC2
1989 Multi-terrain partitioning and floor-planning for data-path chip (microprocessor) layout
abstract
A method is presented for floorplanning data-path chips by a technique of multi-terrain partitioning with integrated global wiring to partition the objects into terrains, followed by multistack placement and standard-cell placement. Requirements on terrain size, terrain shape, wirability, and timing are considered. Results obtained for some chip designs are presented.>
Wing K. Luk, Alvar A. Dean, John W. Mathews
ICCAD2