Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2611.00891

Beyond Source Compatibility: WebAssembly as a Stable ABI for ARINC 653 Applications

Wanja Zaeske·Patrick Siegl·Florian Hartung·Fabian Bauriedl·Nicolaus Bär·Umut Durak
View original source ↗Read source document ↗Export metadata ↓

Abstract

Thirty years ago, ARINC 653 was introduced to provide a vendor-independent platform for software applications in Integrated Modular Avionics (IMA). A platform is characterized by a well-defined interface abstracting over implementation details; in the case of ARINC 653 this is an Application Programming Interface (API), defined on the source-code level. However, several aspects of this API - such as the memory layout and partially also the integer bit width of data types - remain implementation dependent, so portability across Operating Systems (OSs) requires recompilation, and often also source code adaptation. Our contribution is three-fold; first, we refine the ARINC 653 header file, eliminating remaining ambiguities. Second, building on WebAssembly (Wasm), we define an OS- and processor-architecture-agnostic Application Binary Interface (ABI) at the object-code level, resolving differences in data layout, endianness, and function-pointer representation between host and guest environments. Third, we demonstrate a Wasm-VM-agnostic shim-library that executes ARINC 653 partitions, compiled to Wasm bytecode and following our ABI, on multiple processor architectures using two independent Wasm runtimes.

Explore related subjects

cs.OS

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Wanja Zaeske, Patrick Siegl, Florian Hartung, Fabian Bauriedl, Nicolaus Bär, Umut Durak. 2026-10-31. Beyond Source Compatibility: WebAssembly as a Stable ABI for ARINC 653 Applications. https://arxiv.org/abs/2611.00891

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

UMLoad: Fast On-Demand Model Loading on Unified Memory Architecture

On-demand model loading dominates response latency for interactive on-device AI, yet unified memory architectures (UMAs), now common on edge devices, should make it cheap by placing weights in memory the GPU already sees. However, frameworks still use the loading flow built for discrete GPUs, leaving significant inefficiencies. This paper presents UMLoad, a system-level model-loading accelerator that decouples a framework's logical allocations from their physical page backing. UMLoad uses on-demand reconstruction to eliminate the weight copy while preserving copy independence, and GPU-assisted page zeroing to accelerate runtime allocation while preserving its security guarantee. Implemented on Intel, AMD, and NVIDIA UMA platforms and evaluated with llama.cpp, PyTorch, and vLLM across six models, UMLoad reduces average loading time by 36.6%-71.9% over vanilla and 19.9%-62.7% over pipelined loaders, and cuts mean LLM-routing time to first token (TTFT) by 51.3%-59.3% and model-backed tool completion latency by 10.2%-31.6%.

cs.OS↗
arXiv2026

ToolSched: Resource-Efficient Tool Scheduling for Shared-Host LLM Agents

Local LLM agents often work on shared hosts. Unlike multi-tenant cloud clusters, these hosts often have tightly bounded memory, CPU, and I/O resources. Concurrent agents frequently suffer from resource contention, leading to failures such as OOM and reduced resource efficiency. Considering that agents' resource demands are bursty and shell command delay is imperceptible to agents, there is a huge scheduling opportunity to arrange when and in what order commands are actually executed. Thus, we present ToolSched, a Shell MCP Server for shared local hosts that serves multiple agents and schedules their operations. ToolSched embeds a resource model into the MCP interface: agents estimate resource demands along with command requests. These hints, together with real-time host resource conditions, determine when commands are actually executed. Internally, ToolSched applies a scheduling algorithm to stagger commands, reducing contention and improving resource utilization. Prediction correction and checkpoint-based recovery mitigate estimation bias and resource errors. Our evaluation on Terminal Bench shows that, compared with unscheduled execution, ToolSched improves resource utilization by 148.4% and end-to-end command throughput by 29.4%, demonstrating its effectiveness and practicality.

cs.OS↗
arXiv2026

High-Throughput Private Information Retrieval with on-CPU Accelerators

Private information retrieval (PIR) hides which record a client retrieves by scanning the entire database, and batching is an effective technique to improve throughput by sharing this scan across queries. However, existing CPU-based solutions gain little from batching because each query still requires its own multiplications, and vector instructions perform only a few at a time. GPUs and other discrete accelerators can accelerate these computations, but require extra hardware and can constrain database size due to their limited memory capacity. In this paper, we present AltoPIR, the first PIR system that leverages on-CPU matrix accelerators such as Intel AMX. AltoPIR keeps the accelerator fed from the CPU caches, reading each database byte from memory once for all queries in a batch and never writing intermediate products to memory. This enables high-performance PIR through efficient batching without requiring discrete accelerators. Our evaluation shows that AltoPIR achieves up to 50.1x higher throughput than existing CPU-based solutions and serves databases larger than a GPU's memory.

cs.OS↗