Manuel E. Benitez

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

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

Software engineering, systems software and programming languages · 2 · 2 first-authorSystems, architecture and hardware · 1 · 1 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.

Software engineering, system software, and programming languages
2 papers
Compilers and program optimization · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Processor architecture and microarchitecture · 100%

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

TopicWeightPapersLastEvidence papers
Compilers and program optimization
code generation
0.021991
Code Generation for Streaming: An Access/Execute Mechanism · ASPLOS 1991
A Portable Global Optimizer and Linker · PLDI 1988
Compilers and program optimization
intermediate representation
0.011988
A Portable Global Optimizer and Linker · PLDI 1988
Compilers and program optimization › interprocedural optimization
link-time optimization
0.011988
A Portable Global Optimizer and Linker · PLDI 1988
Processor architecture and microarchitecture › execution model
decoupled access/execute architecture
0.011991
Code Generation for Streaming: An Access/Execute Mechanism · ASPLOS 1991
Compilers and program optimization › compiler optimization
optimization phase ordering
0.011988
A Portable Global Optimizer and Linker · PLDI 1988

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

access/execute mechanism · 0.0global optimization · 0.0
YearPublicationVenuePosition
1991 Code Generation for Streaming: An Access/Execute Mechanism
Manuel E. Benitez, Jack W. Davidson
ASPLOS1
1988 A Portable Global Optimizer and Linker
abstract
To reduce complexity and simplify their implementation, most compilers are organized as a set of passes or phases. Each phase performs a particular piece of the compilation process. In an optimizing compiler, the assignment of function and order of application of the phases is a critical part of the design. A particularly difficult problem is the arrangement of the code generation and optimization phases so as to avoid phase ordering problems caused by the interaction of the phases. In this paper, we discuss the implementation of a compiler/linker that has been designed to avoid these problems. The key aspect of this design is that the synthesis phases of the compiler and the system linker share the same intermediate program representation. This results in two benefits. It permits the synthesis phases of the compiler to be performed in any order and repeatedly, thus eliminating potential phase ordering problems. Second, it permits code selection to be invoked at any point during the synthesis phases as well as at link time. The ability to perform code selection at link time presents many opportunities for additional optimizations. Measurements about the effectiveness of using this approach in a C compiler on two different machines are presented.
Manuel E. Benitez, Jack W. Davidson
PLDI1