Oliver Giersch
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Research Subjects
Oliver Giersch has a total of 11 co-authors. Here are the top co-authors by number of shared publications:
- Jörg Nolte
Brandenburgische Technische, Universität Cottbus-Senftenberg, Cottbus, Germany
4 shared publications - Wolfgang Schröder-Preikschat
Friedrich-Alexander-Universität Erlangen-Nürnberg, Erlangen, Germany
3 shared publications - Dustin Tien Nguyen
Friedrich-Alexander-Universität Erlangen-Nürnberg, Erlangen, Germany
2 shared publications - Timo Hönig
Ruhr-Universitat Bochum (RUB)
2 shared publications - Christian Eichler
Ruhr University Bochum, Bochum, Germany
1 shared publication - Dustin T. Nguyen
Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU)
1 shared publication
Latest Publications
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 174-188
Practical Whole-System Persistence
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 174-188
Open AccessPractical Whole-System Persistence
- Open Access
- 4 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Virtual Memory Revisited for Tiered Memory
The landscape of memory technologies has grown substantially more diverse and heterogeneous, with a number of special-purpose memory technologies reaching market maturity in recent years, such as NVRAM (Non-Volatile Memory), HBM (High-Bandwidth Memory) or the upcoming CXL.mem. Future computing systems will have to contend with byte-addressable and cache-coherent main memory that is highly diverse, either in terms of the fundamental performance characteristics of its underlying memory technology, or due to the fact that CXL.mem will allow accessing homogenous but remote memory. The VM (Virtual Memory) subsystems of today have been empirically optimized over decades, but were designed for a single tier of main memory only. While recent approaches that integrated tiered memory have focused on better memory access metrics to improve page placement strategies, we seek to leverage the proven heuristics that are already in place. In times of high load we assign pages from slower memory, demote inactive pages according to standard page replacement strategies and use lazy page promotions when sufficient resources are available again to retain the inherently high reactivity of demand paging with regard to working set changes. We integrate these mechanisms into the VM subsystem of a full-featured mainstream operating system (FreeBSD) with minimal adaptations. The resulting multi-tier VM system runs in a stable and efficient manner under high stress even with highly unfavorable work loads.
- 4 September 2024
- Published by Association for Computing Machinery (ACM)
- p. 1-7
Open AccessVirtual Memory Revisited for Tiered Memory
The landscape of memory technologies has grown substantially more diverse and heterogeneous, with a number of special-purpose memory technologies reaching market maturity in recent years, such as NVRAM (Non-Volatile Memory), HBM (High-Bandwidth Memory) or the upcoming CXL.mem. Future computing systems will have to contend with byte-addressable and cache-coherent main memory that is highly diverse, either in terms of the fundamental performance characteristics of its underlying memory technology, or due to the fact that CXL.mem will allow accessing homogenous but remote memory. The VM (Virtual Memory) subsystems of today have been empirically optimized over decades, but were designed for a single tier of main memory only. While recent approaches that integrated tiered memory have focused on better memory access metrics to improve page placement strategies, we seek to leverage the proven heuristics that are already in place. In times of high load we assign pages from slower memory, demote inactive pages according to standard page replacement strategies and use lazy page promotions when sufficient resources are available again to retain the inherently high reactivity of demand paging with regard to working set changes. We integrate these mechanisms into the VM subsystem of a full-featured mainstream operating system (FreeBSD) with minimal adaptations. The resulting multi-tier VM system runs in a stable and efficient manner under high stress even with highly unfavorable work loads.
- 26 August 2023
- Published by Springer Nature
- p. 153-167
Back to the Core-Memory Age: Running Operating Systems in NVRAM only
- 26 August 2023
- Published by Springer Nature
- p. 153-167
Back to the Core-Memory Age: Running Operating Systems in NVRAM only
- 19 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 33 (3) , 604-616
Fast and Portable Concurrent FIFO Queues With Deterministic Memory Reclamation
In this article we present an algorithm for a high performance, unbounded, portable, multi-producer/multi-consumer, lock-free FIFO (first-in first-out) queue. Aside from its competitive performance on current hardware, it is further characterized by its integrated memory reclamation mechanism, which is able to reliably and deterministically de-allocate nodes as soon as the final operation with a reference has concluded, similar to reference counting. This differentiates our approach from most other lock-free data structures, which usually require external (generic) memory reclamation or garbage collection mechanisms such as hazard pointers. Our deterministic memory reclamation mechanism completely prevents the build up of memory awaiting reclamation and is hence very memory efficient, yet it does not introduce any substantial performance overhead. By utilizing concrete knowledge about the internal structure and access patterns of our queue, we are able to construct and constrain the reclamation mechanism in such a way that keeps the overhead for memory management almost entirely out of the common fast path. The presented algorithm is portable to all modern 64-bit processor architectures, as it only relies on the commonly available and lock-free atomic synchronization primitives compare-and-swap and fetch-and-add.
- 19 July 2021
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 33 (3) , 604-616
Fast and Portable Concurrent FIFO Queues With Deterministic Memory Reclamation
In this article we present an algorithm for a high performance, unbounded, portable, multi-producer/multi-consumer, lock-free FIFO (first-in first-out) queue. Aside from its competitive performance on current hardware, it is further characterized by its integrated memory reclamation mechanism, which is able to reliably and deterministically de-allocate nodes as soon as the final operation with a reference has concluded, similar to reference counting. This differentiates our approach from most other lock-free data structures, which usually require external (generic) memory reclamation or garbage collection mechanisms such as hazard pointers. Our deterministic memory reclamation mechanism completely prevents the build up of memory awaiting reclamation and is hence very memory efficient, yet it does not introduce any substantial performance overhead. By utilizing concrete knowledge about the internal structure and access patterns of our queue, we are able to construct and constrain the reclamation mechanism in such a way that keeps the overhead for memory management almost entirely out of the common fast path. The presented algorithm is portable to all modern 64-bit processor architectures, as it only relies on the commonly available and lock-free atomic synchronization primitives compare-and-swap and fetch-and-add.