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

Paul K. Rodman

dblp:65/6378 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2004
—ORCID · none

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

Systems, architecture and hardware · 5 · 1 first-authorSoftware engineering, systems software and programming languages · 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.

Computer architecture, parallel and distributed computing, and storage systems
5 papers
Electronic design automation · 78% Processor architecture and microarchitecture · 17% Integrated circuit design · 5%
Software engineering, system software, and programming languages
2 papers
Compilers and program optimization · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation
physical design
0.012004
Forest vs. trees: where's the slack? · DAC 2004
Electronic design automation › physical design
timing optimization
0.012004
Forest vs. trees: where's the slack? · DAC 2004
Electronic design automation › CAD framework
design tool interoperability
0.012002
Tools or users: which is the bigger bottleneck? · DAC 2002
Processor architecture and microarchitecture › instruction-level parallelism
VLIW
0.031990
Architecture and implementation of a VLIW supercomputer · SC 1990
A VLIW Architecure for a Trace Scheduling Compiler · IEEE Trans. Computers 1988
A VLIW Architecture for a Trace Scheduling Compiler · ASPLOS 1987
Electronic design automation
logic synthesis
0.012004
Forest vs. trees: where's the slack? · DAC 2004
Electronic design automation › logic synthesis
technology mapping
0.012004
Forest vs. trees: where's the slack? · DAC 2004
Processor architecture and microarchitecture
instruction-level parallelism
0.031990
Architecture and implementation of a VLIW supercomputer · SC 1990
A VLIW Architecure for a Trace Scheduling Compiler · IEEE Trans. Computers 1988
A VLIW Architecture for a Trace Scheduling Compiler · ASPLOS 1987
Compilers and program optimization
instruction scheduling
0.011988
A VLIW Architecure for a Trace Scheduling Compiler · IEEE Trans. Computers 1988
Processor architecture and microarchitecture › superscalar processor
wide-issue
0.011988
A VLIW Architecure for a Trace Scheduling Compiler · IEEE Trans. Computers 1988
Compilers and program optimization › instruction scheduling
trace scheduling
0.011987
A VLIW Architecture for a Trace Scheduling Compiler · ASPLOS 1987

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

load/store architecture · 0.0compiler-controlled resource usage · 0.0trace scheduling · 0.0
YearPublicationVenuePosition
2004 Forest vs. trees: where's the slack?
abstract
Timing closure has been a headache, is still a headache, and always will be a headache.The fast - track evolution of consumer electronics (especially) acts to keep our pain level high: if timing closure isn't currently painful, the push for quality of result (QOR) will soon make it painful again. All of the metrics below can be traded off against each other:.QOR Metrics
Paul K. Rodman
DAC1
2002 Tools or users: which is the bigger bottleneck?
abstract
As chip design becomes ever more complex, fewer design teams are succeeding. Who's to blame? On one hand, tools are hard to use, buggy, not interoperable, and have missing functionality. On the other hand, there is a wide range of engineering skills within the user population, and tools can be abused within flawed methodologies. This panel will quantify and prioritize the key gaps, including interoperability, that must be addressed on both sides.
Andrew B. Kahng, Ronald Collett, Patrick Groeneveld, Lavi Lev, Nancy Nettleton, Paul K. Rodman, Lambert van den Hoven
DAC6
1990 Architecture and implementation of a VLIW supercomputer
abstract
Very-long-instruction-word (VLIW) computers achieve high performance by exploiting the fine-grain parallelism present in sequential or vectorizable code. Multiflow's /200 and /300 VLIW systems yielded near-supercomputer performance by this means despite the relatively slow (65 ns) clocks. With its much faster clock period (15 ns) and architectural improvements, the new /500 system attains approximately 4-9* the performance of its predecessors. The authors describe the /500 architecture and implementation (i.e. TRACE/500), with special attention paid to the tradeoffs involved in designing very-high-speed VLIWs.>
Robert P. Colwell, W. Eric Hall, Chandra S. Joshi, David B. Papworth, Paul K. Rodman, James E. Tornes
SC5
1988 A VLIW Architecure for a Trace Scheduling Compiler
abstract
A VLIW (very long instruction word) architecture machine called the TRACE has been built along with its companion Trace Scheduling compacting compiler. This machine has three hardware configurations, capable of executing 7, 14, or 28 operations simultaneously. The 'seven-wide' achieves a performance improvement of a factor of five or six for a wide range of scientific code, compared to machines of higher cost and fast chip implementation technology (such as the VAX 8700). The TRACE extends some basic reduced-instruction-set computer (RISC) precepts: the architecture is load/store, the microarchitecture is exposed to the compiler, there is no microcode, and there is almost no hardware devoted to synchronization, arbitration, or interlocking of any kind (the compiler has sole responsibility for run-time resource usage). The authors discuss the design of this machine and present some initial performance results.>
Robert P. Colwell, Robert P. Nix, John J. O'Donnell, David B. Papworth, Paul K. Rodman
IEEE Trans. Computers5
1987 A VLIW Architecture for a Trace Scheduling Compiler
abstract
Very Long Instruction Word (VLIW) architectures were promised to deliver far more than the factor of two or three that current architectures achieve from overlapped execution. Using a new type of compiler which compacts ordinary sequential code into long instruction words, a VLIW machine was expected to provide from ten to thirty times the performance of a more conventional machine built of the same implementation technology.Multiflow Computer, Inc., has now built a VLIW called the TRACETM along with its companion Trace SchedulingTM compacting compiler. This new machine has fulfilled the performance promises that were made. Using many fast functional units in parallel, this machine extends some of the basic Reduced-Instruction-Set precepts: the architecture is load/store, the microarchitecture is exposed to the compiler, there is no microcode, and there is almost no hardware devoted to synchronization, arbitration, or interlocking of any kind (the compiler has sole responsibility for runtime resource usage).This paper discusses the design of this machine and presents some initial performance results.
Robert P. Colwell, Robert P. Nix, John J. O'Donnell, David B. Papworth, Paul K. Rodman
ASPLOS5