Skip to content
Book Open access

Enabling Floating Point Virtualization With Tiny Numbers

Jul 2026 · IEEE International Symposium on High-Performance Parallel Distributed Computing · pp. 98-111 · 0 citations · 38 references
Computer Science

TL;DR

This work focuses specifically on the ubiquitous x64 architecture through a hardware/software co-design that leverages x64 functionality that currently lays fallow that combines (a) instruction traps via lazy FPU abduction, and (b) simplified memory management by tiny value boxing.

Abstract

Floating point virtualization allows existing, unmodified application binaries to be run using an alternative arithmetic system. Such virtualization is geared to alternative numbers that are “larger” (require more bits) than the IEEE 754 numbers (e.g., 64 bit doubles) they replace. In this work, we approach the challenge of virtualizing with “smaller” numbers (requiring fewer bits), which is of increasing interest given the explosion of low-precision hardware targeting AI. We focus specifically on the ubiquitous x64 architecture through a hardware/software co-design that leverages x64 functionality that currently lays fallow. The design combines (a) instruction traps via lazy FPU abduction, and (b) simplified memory management by tiny value boxing. We also develop an example tiny alternative arithmetic system that allows smaller IEEE 754 numbers, down to 3 bits, with the exact precision able to be specified on a per-value or per-instruction basis at runtime. Our prototype system is evaluated using validation and performance tests based on running NAS and other benchmarks with a range of lower precision numbers.

Read PDF

Similar papers

Book Open access Sep 2026

Quantifying the Code-Size Overhead of eBPF JIT Compilation

eBPF allows user-defined programs to safely extend Linux kernel functionality at runtime, but its final machine code comes from a compilation pipeline that differs from native targets, and how efficient that pipeline is has no clear reference point. Our work constructs one: using the standard LLVM x86 backend as an app...

Hoang Duong, Hao Sun, Zhen-Dong Su · 0 citations
Open access Oct 2026

When FPGA Meets Dataflow Analysis: An Explorative Step

Set-based (a.k.a. bit-vector-based) dataflow analysis is a fundamental building block for many static analysis tasks, and significant effort has been devoted to accelerating it. Existing acceleration approaches address the problem from a software perspective, leveraging various general-purpose computing platforms, such...

Fan-Juan Wei, Qin-Lin Chen, Nai-Ren Zhang et al. · 0 citations
Conference Sep 2026

CIA: Composable Instruction-Based Accelerators

The use of custom instructions is a common approach to accelerate domain-specific problems. However, it is difficult to reuse instruction-based accelerators in new systems — for example, if multiple accelerators from past systems are merged into a single SoC, they may have colliding opcodes. Fixing this requires opcode...

Brandon Freiberger, Joseph Maheshe, J. Gray et al. · 0 citations
Open access Sep 2026

LithOS Bare-Metal: an unusual path for an RTOS

This paper presents LithOS Bare-Metal (LithOS-BM), a Real-Time Operating System (RTOS) partially compliant with the ARINC 653 APEX standard, designed for small embedded systems where partitioning or virtualization is unnecessary or infeasible, and rapid response times are critical.Integrated Modular Avionics consolidat...

Miguel Gotor-Ramos, Carlos Cuesta-Martínez, Miguel Masmano-Tello et al. · 0 citations
Preprint Aug 2026

GPU implementation of a resource-constrained virtual machine

This paper presents an OpenMP-style parallelism API for Uxntal, the stack-based assembly-style language for the Uxn platform, and demonstrates that exemplar code using this API can run at comparable performance even on an integrated GPU.

S. Li, Vladislav Brusokas, Andrei Ghita et al. · 0 citations
Preprint Sep 2026

Quantifying the Effect of HCLs on a Fixed-Microarchitecture MXFP4 Accelerator

This paper compares the most widely used HCLs using the same fixed design, the OCP MXFP4 block dot product, a quantization primitive at the heart of edge Physical-AI inference, implemented as a single 12-stage, II=1 pipeline.

D. Passaretti, Sajjad Tamimi, Nicola Dall'Ora · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.