Demo Data from EDBT 2026 / reviewers in the wild / expert
Carlos Escuin
dblp:318/1152
· DBLP profile ↗
2ranked-venue papers
2as first author
2since 2021 · last 2026
—ORCID · unresolved
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 first-author · 2 since 2021
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 |
Memory systems · 50% Processor architecture and microarchitecture · 35% Electronic design automation · 15% |
Topics — the 9 heaviest of 9, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Processor architecture and microarchitecture › register file
physical register file |
1.0 | 1 | 2026 | Tempranillo: Non-Speculative Early Register Release · HPCA 2026 |
Electronic design automation › high-level synthesis › resource binding
register allocation |
1.0 | 1 | 2026 | Tempranillo: Non-Speculative Early Register Release · HPCA 2026 |
Processor architecture and microarchitecture
register file |
1.0 | 1 | 2026 | Tempranillo: Non-Speculative Early Register Release · HPCA 2026 |
Memory systems › memory compression
cache compression |
0.7 | 1 | 2023 | Compression-Aware and Performance-Efficient Insertion Policies for Long-Lasting Hybrid LLCs · HPCA 2023 |
Memory systems
cache design |
0.7 | 1 | 2023 | Compression-Aware and Performance-Efficient Insertion Policies for Long-Lasting Hybrid LLCs · HPCA 2023 |
Memory systems › memory hierarchy › cache hierarchy
last-level cache |
0.7 | 1 | 2023 | Compression-Aware and Performance-Efficient Insertion Policies for Long-Lasting Hybrid LLCs · HPCA 2023 |
Memory systems
non-volatile memory |
0.7 | 1 | 2023 | Compression-Aware and Performance-Efficient Insertion Policies for Long-Lasting Hybrid LLCs · HPCA 2023 |
Memory systems › non-volatile memory › write reliability
write endurance |
0.7 | 1 | 2023 | Compression-Aware and Performance-Efficient Insertion Policies for Long-Lasting Hybrid LLCs · HPCA 2023 |
Processor architecture and microarchitecture › multithreading
simultaneous multithreading |
0.3 | 1 | 2026 | Tempranillo: Non-Speculative Early Register Release · HPCA 2026 |
Methods — techniques the papers use, named apart from their topics
set-dueling · 0.7data compression · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2026 | Tempranillo: Non-Speculative Early Register ReleaseabstractLimited by the breakdown of technology scaling, CPU architects are looking for creative solutions to deliver performance improvements while unable to traditionally scale up microarchitectural structures. One promising approach is engineering a microarchitecture that uses resources more efficiently, for example, by recycling them faster to relieve pressure on critical structures and making them look bigger than they are. The physical register file (PRF) is a key structure that faces severe area and power constraints that limit its (and the whole CPU's) scalability. Based on this observation, previous work proposed solutions to reduce the pressure on the PRF by reducing the time each register remains allocated. In this paper, we corroborate earlier findings that the early release of registers is a promising approach to reduce the occupancy of the PRF and we identify novel tight conditions for safely releasing registers. Based on this analysis, we design Tempranillo: an aggressive, non-speculative microarchitecture to release registers as early as possible without requiring additional recovery mechanisms. Tempranillo delivers up to 3.3 % and 11.8 % performance improvement over conventional release on singlethreaded and a 2 -way SMT CPUs, respectively. Additionally, Tempranillo requires modest storage overheads, translating into a performance improvement per KiB of storage of up to 2.6 % and 9.3 % for single-thread and 2-way SMT, respectively. Our evaluation shows that Tempranillo improves over both the state-of-the-art non-speculative and speculative proposals. Carlos Escuin, Paolo Salvatore Galfano, Davide B. Bartolini, Leeor Peled, Mehdi Alipour |
HPCA | 1 |
| 2023 | Compression-Aware and Performance-Efficient Insertion Policies for Long-Lasting Hybrid LLCsabstractEmerging non-volatile memory (NVM) technologies can potentially replace large SRAM memories such as the last-level cache (LLC). However, despite recent advances, NVMs suffer from higher write latency and limited write endurance. Recently, NVM-SRAM hybrid LLCs are proposed to combine the best of both worlds. Several policies have been proposed to improve the performance and lifetime of hybrid LLCs by intelligently steering the incoming LLC blocks into either the SRAM or NVM part, regarding the cache behavior of the LLC blocks and the SRAM/NVM device properties. However, these policies neither consider compressing the contents of the cache block nor using partially worn-out NVM cache blocks.This paper proposes new insertion policies for byte-level fault-tolerant hybrid LLCs that collaboratively optimize for lifetime and performance. Specifically, we leverage data compression to utilize partially defective NVM cache entries, thereby improving the LLC hit rate. The key to our approach is to guide the insertion policy by both the reuse properties of the block and the size resulting from its compression. A block is inserted in NVM only if it is a read-reuse block or its compressed size is lower than a threshold. It will be inserted in SRAM if the block is a write-reuse or its compressed size is greater than the threshold. We use set-dueling to tune the compression threshold at runtime. This compression threshold provides a knob to control the NVM write rate and, together with a rule-based mechanism, allows balancing performance and lifetime.Overall, our evaluation shows that, with affordable hardware overheads, the proposed schemes can nearly reach the performance of an SRAM cache with the same associativity while improving lifetime by 17× compared to a hybrid NVM-unaware LLC. Our proposed scheme outperforms the state-of-the-art insertion policies by 9% while achieving a comparative lifetime. The rule-based mechanism shows that by compromising, for instance, 1.1% and 1.9% performance, the NVM lifetime can be further increased by 28% and 44%, respectively. Carlos Escuin, Asif Ali Khan, Pablo Ibáñez 0001, Teresa Monreal Arnal, Jerónimo Castrillón, Víctor Viñals |
HPCA | 1 |