Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Johannes Weiner

dblp:314/7075 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
3since 2021 · last 2023
0009-0005-6697-8276ORCID · corroborated

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

Systems, architecture and hardware · 3 · 1 first-author · 3 since 2021Software engineering, systems software and programming languages · 3 · 1 first-author · 3 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
3 papers
Memory systems · 70% Cloud and datacenter computing · 30%
Software engineering, system software, and programming languages
2 papers
Operating systems · 100%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing › resource management
datacenter memory management
1.432023
TPP: Transparent Page Placement for CXL-Enabled Tiered-Memory · ASPLOS (3) 2023
TMO: transparent memory offloading in datacenters · ASPLOS 2022
Contiguitas: The Pursuit of Physical Memory Contiguity in Datacenters · ISCA 2023
Memory systems › memory management
fragmentation
0.712023
Contiguitas: The Pursuit of Physical Memory Contiguity in Datacenters · ISCA 2023
Memory systems
page placement
0.712023
TPP: Transparent Page Placement for CXL-Enabled Tiered-Memory · ASPLOS (3) 2023
Memory systems › tiered memory
tiered memory management
0.712023
TPP: Transparent Page Placement for CXL-Enabled Tiered-Memory · ASPLOS (3) 2023
Memory systems › memory management
virtual memory
0.712023
Contiguitas: The Pursuit of Physical Memory Contiguity in Datacenters · ISCA 2023
Operating systems › resource management › memory management
kernel memory management
0.612022
TMO: transparent memory offloading in datacenters · ASPLOS 2022
Memory systems
memory offloading
0.612022
TMO: transparent memory offloading in datacenters · ASPLOS 2022
Operating systems › resource management
memory management
0.212023
Contiguitas: The Pursuit of Physical Memory Contiguity in Datacenters · ISCA 2023
Operating systems › resource management › memory management
page migration
0.212023
Contiguitas: The Pursuit of Physical Memory Contiguity in Datacenters · ISCA 2023
Memory systems
non-volatile memory
0.212022
TMO: transparent memory offloading in datacenters · ASPLOS 2022

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

page migration · 1.3hardware-software co-design · 1.3TLB shootdown · 1.3real-time resource shortage measurement · 1.1workload characterization · 0.7
YearPublicationVenuePosition
2023 TPP: Transparent Page Placement for CXL-Enabled Tiered-Memory
abstract
The increasing demand for memory in hyperscale applications has led to memory becoming a large portion of the overall datacenter spend. The emergence of coherent interfaces like CXL enables main memory expansion and offers an efficient solution to this problem. In such systems, the main memory can constitute different memory technologies with varied characteristics. In this paper, we characterize memory usage patterns of a wide range of datacenter applications across the server fleet of Meta. We, therefore, demonstrate the opportunities to offload colder pages to slower memory tiers for these applications. Without efficient memory management, however, such systems can significantly degrade performance.
Hasan Al Maruf, Hao Wang 0011, Abhishek Dhanotia, Johannes Weiner, Niket Agarwal, Pallab Bhattacharya, Chris Petersen 0002, Mosharaf Chowdhury, Shobhit O. Kanaujia, Prakash Chauhan
ASPLOS (3)4
2023 Contiguitas: The Pursuit of Physical Memory Contiguity in Datacenters
abstract
The unabating growth of the memory needs of emerging datacenter applications has exacerbated the scalability bottleneck of virtual memory. However, reducing the excessive overhead of address translation will remain onerous until the physical memory contiguity predicament gets resolved. To address this problem, this paper presents Contiguitas, a novel redesign of memory management in the operating system and hardware that provides ample physical memory contiguity. We identify that the primary cause of memory fragmentation in Meta's datacenters is unmovable allocations scattered across the address space that impede large contiguity from being formed. To provide ample physical memory contiguity by design, Contiguitas first separates regular movable allocations from unmovable ones by placing them into two different continuous regions in physical memory and dynamically adjusts the boundary of the two regions based on memory demand. Drastically reducing unmovable allocations is challenging because the majority of unmovable pages cannot be moved with software alone given that access to the page cannot be blocked for a migration to take place. Furthermore, page migration is expensive as it requires a long downtime to (a) perform TLB shootdowns that scale poorly with the number of victim TLBs, and (b) copy the page. To this end, Contiguitas eliminates the primary source of unmovable allocations by introducing hardware extensions in the last-level cache to enable the transparent and efficient migration of unmovable pages even while the pages remain in use.
Kaiyang Zhao 0002, Ziqi Wang 0007, Dan Schatzberg, Leon Yang, Antonis Manousis, Johannes Weiner, Rik van Riel, Bikash Sharma, Chunqiang Tang, Dimitrios Skarlatos 0002
ISCA7
2022 TMO: transparent memory offloading in datacenters
abstract
The unrelenting growth of the memory needs of emerging datacenter applications, along with ever increasing cost and volatility of DRAM prices, has led to DRAM being a major infrastructure expense. Alternative technologies, such as NVMe SSDs and upcoming NVM devices, offer higher capacity than DRAM at a fraction of the cost and power. One promising approach is to transparently offload colder memory to cheaper memory technologies via kernel or hypervisor techniques. The key challenge, however, is to develop a datacenter-scale solution that is robust in dealing with diverse workloads and large performance variance of different offload devices such as compressed memory, SSD, and NVM. This paper presents TMO, Meta’s transparent memory offloading solution for heterogeneous datacenter environments. TMO introduces a new Linux kernel mechanism that directly measures in realtime the lost work due to resource shortage across CPU, memory, and I/O. Guided by this information and without any prior application knowledge, TMO automatically adjusts how much memory to offload to heterogeneous devices (e.g., compressed memory or SSD) according to the device’s performance characteristics and the application’s sensitivity to memory-access slowdown. TMO holistically identifies offloading opportunities from not only the application containers but also the sidecar containers that provide infrastructure-level functions. To maximize memory savings, TMO targets both anonymous memory and file cache, and balances the swap-in rate of anonymous memory and the reload rate of file pages that were recently evicted from the file cache. TMO has been running in production for more than a year, and has saved between 20-32% of the total memory across millions of servers in our large datacenter fleet. We have successfully upstreamed TMO into the Linux kernel.
Johannes Weiner, Niket Agarwal, Dan Schatzberg, Leon Yang, Hao Wang 0011, Blaise Sanouillet, Bikash Sharma, Tejun Heo, Chunqiang Tang, Dimitrios Skarlatos 0002
ASPLOS1