A Case for Transforming Parallel Runtimes Into Operating System Kernels

Hale, Kyle C.; Dinda, Peter A.

doi:10.1145/2749246.2749264

Cited by 19 publications

(5 citation statements)

References 25 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Nautilus was designed with the goal of supporting hybrid run-times (HRTs). An HRT is a mashup of an extremely lightweight OS kernel framework, such as Nautilus, and a parallel run-time system [35,36]. Nautilus can help a parallel run-time ported to an HRT achieve very high performance by providing streamlined kernel primitives such as synchronization and threading facilities.…”

Section: Softwarementioning

confidence: 99%

CARAT CAKE: replacing paging via compiler/kernel cooperation

Suchy

Ghosh

Kersnar

et al. 2022

Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems

View full text Add to dashboard Cite

Virtual memory, specifically paging, is undergoing significant innovation due to being challenged by new demands from modern workloads. Recent work has demonstrated an alternative softwareonly design that can result in simplified hardware requirements, even supporting purely physical addressing. While we have made the case for this Compiler-And Runtime-based Address Translation (CARAT) concept, its evaluation was based on a user-level prototype. We now report on incorporating CARAT into a kernel, forming Compiler-And Runtime-based Address Translation for CollAborative Kernel Environments (CARAT CAKE). In our implementation, a Linux-compatible x64 process abstraction can be based either on CARAT CAKE, or on a sophisticated paging implementation. Implementing CARAT CAKE involves kernel changes and compiler optimizations/transformations that must work on all code in the system, including kernel code. We evaluate CARAT CAKE in comparison with paging and find that CARAT CAKE is able to achieve the functionality of paging (protection, mapping, and movement properties) with minimal overhead. In turn, CARAT CAKE allows significant new benefits for systems including energy savings, larger L1 caches, and arbitrary granularity memory management.

show abstract

Section: Softwarementioning

confidence: 99%

CARAT CAKE: replacing paging via compiler/kernel cooperation

Suchy

Ghosh

Kersnar

et al. 2022

Proceedings of the 27th ACM International Conference on Architectural Support for Programming Languages and Operating Systems

View full text Add to dashboard Cite

show abstract

“…This would reduce the overhead to be closer to that of kernel-level delivery, but we would still bear the cost of crossing the kernel-user boundary. A more aggressive option would be to incorporate FPVM into a pure-kernel execution model, such as in the hybrid run-time (HRT) model [27,28]. By discarding kernel-user crossings altogether, the baseline overhead for FPVM would be similar to the "Kernel Trap Delivery" variants in Figure 14.…”

Section: Kernel-level Supportmentioning

confidence: 99%

FPVM

Dinda

Wanninger

et al. 2022

Proceedings of the 31st International Symposium on High-Performance Parallel and Distributed Computing

View full text Add to dashboard Cite

Alternatives to IEEE floating point arithmetic have become all the rage. Some extract more representational power out of the available bits. Others offer the potential for lower or higher precision than is available in IEEE-compatible hardware. Even an "interface to the real numbers" has recently been proposed. Using such alternative arithmetic systems within an existing scientific or other significant codebase is a major challenge, however. We explore how to address this challenge through virtualizing the IEEE floating point hardware, specifically on x64. The goal of the floating point virtual machine (FPVM) is to allow an existing application binary to be seamlessly extended to support the desired alternative arithmetic system with overheads determined by that system and not the virtualization mechanisms. We describe the prospects, issues, and tradeoffs for four different approaches for building FPVM: trap-and-emulate, trap-and-patch, binary transformation, and IR transformation. We then describe the design and implementation of our current design, which combines static binary analysis/translation and trap-and-emulate execution. We evaluate our FPVM implementation on several benchmarks, virtualizing them to use posits and MPFR. Finally, we comment on kernel-and hardwarelevel innovations that could further reduce overheads for floating point virtualization.

show abstract

“…Multiverse builds on the previously described Nautilus AeroKernel and Hybrid Virtual Machine [18], [17], which were developed to support the hybrid runtime (HRT) model. We describe the key salient findings and components here.…”

Section: Hrt and Hvmmentioning

confidence: 99%

“…Runtime systems can gain significant benefits from executing in a tailored software environment, such as our Hybrid Runtime (HRT) [18]. In an HRT, a light-weight kernel framework (called an AeroKernel), a runtime, and an application coalesce into a single kernel-level entity.…”

Section: Introductionmentioning

confidence: 99%

Multiverse: Easy Conversion of Runtime Systems into OS Kernels via Automatic Hybridization

Hale

Hetland²,

Dinda³

2017

2017 IEEE International Conference on Autonomic Computing (ICAC)

Self Cite

View full text Add to dashboard Cite

The hybrid runtime (HRT) model offers a path towards high performance and efficiency. By integrating the OS kernel, runtime, and application, an HRT allows the runtime developer to leverage the full feature set of the hardware and specialize OS services to the runtime's needs. However, conforming to the HRT model currently requires a port of the runtime to the kernel level, for example to the Nautilus kernel framework, and this requires knowledge of kernel internals. In response, we developed Multiverse, a system that bridges the gap between a built-from-scratch HRT and a legacy runtime system. Multiverse allows unmodified applications and runtimes to be brought into the HRT model without any porting effort whatsoever by splitting the execution of the application between the domains of a legacy OS and an HRT environment. We describe the design and implementation of Multiverse and illustrate its capabilities using the massive, widely-used Racket runtime system.

show abstract

A Case for Transforming Parallel Runtimes Into Operating System Kernels

Cited by 19 publications

References 25 publications

CARAT CAKE: replacing paging via compiler/kernel cooperation

CARAT CAKE: replacing paging via compiler/kernel cooperation

FPVM

Multiverse: Easy Conversion of Runtime Systems into OS Kernels via Automatic Hybridization

Contact Info

Product

Resources

About