Demo Data from EDBT 2026 / reviewers in the wild / expert
Amir H. Hashemi
dblp:65/2784
· DBLP profile ↗
1ranked-venue papers
1as first author
0since 2021 · last 1997
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Software engineering, systems software and programming languages · 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.
| Computer architecture, parallel and distributed computing, and storage systems
1 paper |
Memory systems · 77% Processor architecture and microarchitecture · 23% | |
| Software engineering, system software, and programming languages
1 paper |
Compilers and program optimization · 100% |
Topics — the 2 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Compilers and program optimization › code layout optimization
code reordering |
0.0 | 1 | 1997 | Efficient Procedure Mapping Using Cache Line Coloring · PLDI 1997 |
Memory systems › cache
cache performance |
0.0 | 1 | 1997 | Efficient Procedure Mapping Using Cache Line Coloring · PLDI 1997 |
Methods — techniques the papers use, named apart from their topics
link-time optimization · 0.0call graph analysis · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Efficient Procedure Mapping Using Cache Line ColoringabstractAs the gap between memory and processor performance continues to widen, it becomes increasingly important to exploit cache memory effectively. Both hardware and software approaches can be explored to optimize cache performance. Hardware designers focus on cache organization issues, including replacement policy, associativity, block size and the resulting cache access time. Software writers use various optimization techniques, including software prefetching, data scheduling and code reordering. Our focus is on improving memory usage through code reordering compiler techniques. In this paper we present a link-time procedure mapping algorithm which can significantly improve the effectiveness of the instruction cache. Our algorithm produces an improved program layout by performing a color mapping of procedures to cache lines, taking into consideration the procedure size, cache size, cache line size, and call graph. We use cache line coloring to guide the procedure mapping, ind... Amir H. Hashemi, David R. Kaeli, Brad Calder |
PLDI | 1 |