Demo Data from EDBT 2026 / reviewers in the wild / expert
Kosta Stojiljkovic
dblp:334/1105
· DBLP profile ↗
1ranked-venue papers
0as first author
1since 2021 · last 2023
0009-0002-3163-1561ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1 · 1 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
1 paper |
Memory systems · 75% Storage systems · 25% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Storage systems › flash and SSD › flash memory management › flash translation layer
address mapping |
0.7 | 1 | 2023 | Utopia: Fast and Efficient Address Translation via Hybrid Restrictive & Flexible Virtual-to-Physical Address Mappings · MICRO 2023 |
Memory systems › memory management › virtual memory
address translation |
0.7 | 1 | 2023 | Utopia: Fast and Efficient Address Translation via Hybrid Restrictive & Flexible Virtual-to-Physical Address Mappings · MICRO 2023 |
Memory systems › memory management › virtual memory › address translation
TLB |
0.7 | 1 | 2023 | Utopia: Fast and Efficient Address Translation via Hybrid Restrictive & Flexible Virtual-to-Physical Address Mappings · MICRO 2023 |
Memory systems › memory management
virtual memory |
0.7 | 1 | 2023 | Utopia: Fast and Efficient Address Translation via Hybrid Restrictive & Flexible Virtual-to-Physical Address Mappings · MICRO 2023 |
Methods — techniques the papers use, named apart from their topics
hybrid restrictive and flexible mapping · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2023 | Utopia: Fast and Efficient Address Translation via Hybrid Restrictive & Flexible Virtual-to-Physical Address MappingsabstractConventional virtual memory (VM) frameworks enable a virtual address to flexibly map to any physical address. This flexibility necessitates large data structures to store virtual-to-physical mappings, which leads to high address translation latency and large translation-induced interference in the memory hierarchy, especially in data-intensive workloads. On the other hand, restricting the address mapping so that a virtual address can only map to a specific set of physical addresses can significantly reduce address translation overheads by making use of compact and efficient translation structures. However, restricting the address mapping flexibility across the entire main memory severely limits data sharing across different processes and increases data accesses to the swap space of the storage device even in the presence of free memory. Konstantinos Kanellopoulos, Rahul Bera, Kosta Stojiljkovic, Nisa Bostanci, Can Firtina, Rachata Ausavarungnirun, Rakesh Kumar 0003, Nastaran Hajinazar, Mohammad Sadrosadati, Nandita Vijaykumar, Onur Mutlu |
MICRO | 3 |