Hubertus Franke
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Hubertus Franke has a total of 127 co-authors. Here are the top co-authors by number of shared publications:
- Chung-Sheng Li
Operations, Accenture, San Jose, California United States 95113
3 shared publications - Hani Jamjoom
IBM Research, Yorktown Heights, NY, USA
3 shared publications - Tianyin Xu
University of Illinois Urbana-Champaign, Champaign, USA
3 shared publications - Wanjiun Liao
National Taiwan University
3 shared publications - Andrew Cheng
Computer Science, Columbia University
2 shared publications - Angelo Ruocco
IBM Research, Yorktown Heights, USA
2 shared publications
Latest Publications
- Open Access
- 28 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 580-599
TuxBot: Semantic-Aware Online OS Tuning with LLMs
- 28 September 2026
- Published by Association for Computing Machinery (ACM)
- p. 580-599
Open AccessTuxBot: Semantic-Aware Online OS Tuning with LLMs
- Open Access
- 4 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
Rex: Safe kernel extensions can also be usable
Safe kernel extensions have gained significant traction, evolving from simple packet filters to large, complex programs that customize storage, networking, and scheduling. Existing kernel extension mechanisms like eBPF rely on in-kernel verifiers to ensure the safety of kernel extensions by static verification using symbolic execution. We identify significant usability issues—safe extensions being rejected by the verifier—due to the language-verifier gap , a mismatch between developers’ expectation of program safety provided by a contract with the programming language, and the verifier’s expectation. We present Rex, a new kernel extension framework that closes the language-verifier gap and improves the usability of kernel extensions in terms of programming experience and maintainability. Rex builds upon language-based safety to provide safety properties desired by kernel extensions, along with a lightweight extralingual runtime for properties that are unsuitable for static analysis, including safe exception handling, stack safety, and termination. With Rex, kernel extensions are written in safe Rust and interact with the kernel via a safe interface provided by Rex’s kernel crate. No separate static verification is needed. Rex addresses usability issues of eBPF kernel extensions without compromising performance.
- 4 September 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
Open AccessRex: Safe kernel extensions can also be usable
Safe kernel extensions have gained significant traction, evolving from simple packet filters to large, complex programs that customize storage, networking, and scheduling. Existing kernel extension mechanisms like eBPF rely on in-kernel verifiers to ensure the safety of kernel extensions by static verification using symbolic execution. We identify significant usability issues—safe extensions being rejected by the verifier—due to the language-verifier gap , a mismatch between developers’ expectation of program safety provided by a contract with the programming language, and the verifier’s expectation. We present Rex, a new kernel extension framework that closes the language-verifier gap and improves the usability of kernel extensions in terms of programming experience and maintainability. Rex builds upon language-based safety to provide safety properties desired by kernel extensions, along with a lightweight extralingual runtime for properties that are unsuitable for static analysis, including safe exception handling, stack safety, and termination. With Rex, kernel extensions are written in safe Rust and interact with the kernel via a safe interface provided by Rex’s kernel crate. No separate static verification is needed. Rex addresses usability issues of eBPF kernel extensions without compromising performance.
- Open Access
- 11 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
cache_ext: Customizing and Tracing the Page Cache with eBPF
The OS page cache is central to the performance of many applications, by reducing excessive accesses to storage. However, its one-size-fits-all eviction policy performs poorly in many workloads. While the systems community has experimented with a plethora of new and adaptive eviction policies in non-OS settings (e.g., key-value stores, CDNs), it is very difficult to implement such policies in the page cache, due to the complexity of modifying kernel code. To address these shortcomings, we design a flexible eBPF-based framework for the Linux page cache, called cache_ext , that allows developers to customize the page cache without modifying the kernel. cache_ext enables applications to customize the page cache policy for their specific needs, while also ensuring that different applications’ policies do not interfere with each other. Additionally, we introduce an observability tool, cachestream , which enables fine-grained tracing of the page cache, allowing precise refinement of applications and cache_ext policies. We demonstrate the flexibility of cache_ext ’s interface by using it to implement eight different policies. Our evaluation shows that it is indeed beneficial for applications to customize the page cache to match their workloads’ unique properties, and that they can achieve up to 70% higher throughput and 58% lower tail latency.
- 11 June 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
Open Accesscache_ext: Customizing and Tracing the Page Cache with eBPF
The OS page cache is central to the performance of many applications, by reducing excessive accesses to storage. However, its one-size-fits-all eviction policy performs poorly in many workloads. While the systems community has experimented with a plethora of new and adaptive eviction policies in non-OS settings (e.g., key-value stores, CDNs), it is very difficult to implement such policies in the page cache, due to the complexity of modifying kernel code. To address these shortcomings, we design a flexible eBPF-based framework for the Linux page cache, called cache_ext , that allows developers to customize the page cache without modifying the kernel. cache_ext enables applications to customize the page cache policy for their specific needs, while also ensuring that different applications’ policies do not interfere with each other. Additionally, we introduce an observability tool, cachestream , which enables fine-grained tracing of the page cache, allowing precise refinement of applications and cache_ext policies. We demonstrate the flexibility of cache_ext ’s interface by using it to implement eight different policies. Our evaluation shows that it is indeed beneficial for applications to customize the page cache to match their workloads’ unique properties, and that they can achieve up to 70% higher throughput and 58% lower tail latency.
- Open Access
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 125-133
CPU-Limits kill Performance: Time to rethink Resource Control
- 19 November 2025
- Published by Association for Computing Machinery (ACM)
- p. 125-133
Open AccessCPU-Limits kill Performance: Time to rethink Resource Control
- Open Access
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 217-231
Chameleon: Adaptive Caching and Scheduling for Many-Adapter LLM Inference Environments
- 17 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 217-231
Open AccessChameleon: Adaptive Caching and Scheduling for Many-Adapter LLM Inference Environments
- Open Access
CPU-Limits kill Performance: Time to rethink Resource Control
Research in compute resource management for cloud-native applications is dominated by the problem of setting optimal CPU limits -- a fundamental OS mechanism that strictly restricts a container's CPU usage to its specified CPU-limits . Rightsizing and autoscaling works have innovated on allocation/scaling policies assuming the ubiquity and necessity of CPU-limits . We question this. Practical experiences of cloud users indicate that CPU-limits harms application performance and costs more than it helps. These observations are in contradiction to the conventional wisdom presented in both academic research and industry best practices. We argue that this indiscriminate adoption of CPU-limits is driven by erroneous beliefs that CPU-limits is essential for operational and safety purposes. We provide empirical evidence making a case for eschewing CPU-limits completely from latency-sensitive applications. This prompts a fundamental rethinking of auto-scaling and billing paradigms and opens new research avenues. Finally, we highlight specific scenarios where CPU-limits can be beneficial if used in a well-reasoned way (e.g. background jobs).
Open AccessCPU-Limits kill Performance: Time to rethink Resource Control
Research in compute resource management for cloud-native applications is dominated by the problem of setting optimal CPU limits -- a fundamental OS mechanism that strictly restricts a container's CPU usage to its specified CPU-limits . Rightsizing and autoscaling works have innovated on allocation/scaling policies assuming the ubiquity and necessity of CPU-limits . We question this. Practical experiences of cloud users indicate that CPU-limits harms application performance and costs more than it helps. These observations are in contradiction to the conventional wisdom presented in both academic research and industry best practices. We argue that this indiscriminate adoption of CPU-limits is driven by erroneous beliefs that CPU-limits is essential for operational and safety purposes. We provide empirical evidence making a case for eschewing CPU-limits completely from latency-sensitive applications. This prompts a fundamental rethinking of auto-scaling and billing paradigms and opens new research avenues. Finally, we highlight specific scenarios where CPU-limits can be beneficial if used in a well-reasoned way (e.g. background jobs).
- Open Access
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 462-478
cache_ext: Customizing the Page Cache with eBPF
- 12 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 462-478
Open Accesscache_ext: Customizing the Page Cache with eBPF
- Open Access
- 2 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 19-27
Position Paper: From Confidential Computing to Zero Trust, Come Along for the (Bumpy?) Ride
- 2 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 19-27
Open AccessPosition Paper: From Confidential Computing to Zero Trust, Come Along for the (Bumpy?) Ride
- Open Access
- 31 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Semiconductor Manufacturing
- Vol. 37 (4) , 481-488
Reducing Datacenter Compute Carbon Footprint by Harnessing the Power of Specialization: Principles, Metrics, Challenges and Opportunities
Computing is an indispensable tool in addressing climate change, but it also contributes to a significant and steadily increasing carbon footprint, partly due to the exponential growth in energy-demanding workloads, such as artificial intelligence (AI). While hardware specialization has become the primary driver of operational energy efficiency improvements, it introduces new challenges including increased embodied emission, and a rise in complexity of operations of heterogeneous and dynamic datacenters. We posit that while specialization is necessary for sustainable computing, to fully harness its power, the academic and technical community must address the specific challenges arising from embracing it. We enumerate and analyze key challenges that specialization introduces across software, system design, and operations, and their potential impact on carbon cost, and propose a way forward for each identified area. Furthermore, we argue that intricate relationships exist across the life-cycle of compute systems, which must be understood, modeled, and analyzed to identify the most beneficial Pareto frontiers for carbon life-cycle efficiency. We analyze these trade-offs and offer an approach to address them using a unified metric and framework.
- 31 July 2024
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Semiconductor Manufacturing
- Vol. 37 (4) , 481-488
Open AccessReducing Datacenter Compute Carbon Footprint by Harnessing the Power of Specialization: Principles, Metrics, Challenges and Opportunities
Computing is an indispensable tool in addressing climate change, but it also contributes to a significant and steadily increasing carbon footprint, partly due to the exponential growth in energy-demanding workloads, such as artificial intelligence (AI). While hardware specialization has become the primary driver of operational energy efficiency improvements, it introduces new challenges including increased embodied emission, and a rise in complexity of operations of heterogeneous and dynamic datacenters. We posit that while specialization is necessary for sustainable computing, to fully harness its power, the academic and technical community must address the specific challenges arising from embracing it. We enumerate and analyze key challenges that specialization introduces across software, system design, and operations, and their potential impact on carbon cost, and propose a way forward for each identified area. Furthermore, we argue that intricate relationships exist across the life-cycle of compute systems, which must be understood, modeled, and analyzed to identify the most beneficial Pareto frontiers for carbon life-cycle efficiency. We analyze these trade-offs and offer an approach to address them using a unified metric and framework.
- Open Access
Enabling Performant and Secure EDA as a Service in Public Clouds Using Confidential Containers
Increasingly, business opportunities available to fabless design teams in the semiconductor industry far exceed those addressable with on-prem compute resources. An attractive option to capture these electronic design automation (EDA) design opportunities is through public cloud bursting. However, security concerns with public cloud bursting arise from having to protect process design kits, third party intellectual property, and new design data for semiconductor devices and chips. One way to address security concerns for public cloud bursting is to leverage confidential containers for EDA workloads. Confidential containers add zero trust computing elements to significantly reduce the probability of intellectual property escapes. A key concern that often follows security discussions is whether EDA workload performance will suffer with confidential computing. In this work we demonstrate a full set of EDA confidential containers and their deployment and characterize performance impacts of confidential elements of the flow including storage and networking. A complete end-to-end confidential container-based EDA workload exhibits 7.13% and 2.05% performance overheads over bare-metal container and VM based solutions, respectively.
Open AccessEnabling Performant and Secure EDA as a Service in Public Clouds Using Confidential Containers
Increasingly, business opportunities available to fabless design teams in the semiconductor industry far exceed those addressable with on-prem compute resources. An attractive option to capture these electronic design automation (EDA) design opportunities is through public cloud bursting. However, security concerns with public cloud bursting arise from having to protect process design kits, third party intellectual property, and new design data for semiconductor devices and chips. One way to address security concerns for public cloud bursting is to leverage confidential containers for EDA workloads. Confidential containers add zero trust computing elements to significantly reduce the probability of intellectual property escapes. A key concern that often follows security discussions is whether EDA workload performance will suffer with confidential computing. In this work we demonstrate a full set of EDA confidential containers and their deployment and characterize performance impacts of confidential elements of the flow including storage and networking. A complete end-to-end confidential container-based EDA workload exhibits 7.13% and 2.05% performance overheads over bare-metal container and VM based solutions, respectively.