Extending WebAssembly for Deep-Learning Inference Across the Cloud Continuum
Bibliographic record
Abstract
Recent advancements in serverless computing and the cloud-edge continuum have increased interest in WebAssembly (WASM). This technology enables portability and interoperability across diverse computing environments while achieving near-native execution speeds. Currently, WASM supports Single Instruction Multiple Data (SIMD), which allows for data-level parallelism that is particularly beneficial for vectorizable operations such as general matrix-matrix multiplication (GEMM) and convolutional layers. However, WASM lacks native integration with specialized hardware accelerators like GPUs, TPUs, and NPUs, as well as the ability to benefit from multi-core processing capabilities, which are critical for efficiently running Deep-Learning (DL) workloads. In contrast, despite these gains, WASM still lacks native support for heterogeneous accelerators such as GPUs, TPUs, and NPUs, as well as full multi-core parallelism capabilities that are critical for meeting the latency and throughput requirements of modern DL inference services. To bridge this gap, WASI-NN was developed, enabling WASM to integrate with external runtimes such as OpenVINO and ONNX Runtime, which leverage hardware acceleration. However, these current integrations often introduce performance overhead on certain devices, restricting their usability across the CECC. To address these challenges, we propose a new integration focusing on TVM as an external runtime for WASI-NN to enhance WASM’s performance and expand support to a broader range of devices. Additionally, we integrate this solution into Knative, a serverless framework, to provide a scalable and flexible platform for DL deployment. Using WASM technology, we evaluate our TVM-based solution through comparative studies. Results on AMD CPUs demonstrate the effectiveness of our approach, achieving 58% overall gain over other WASI-NN integrations (e.g., ONNX Runtime and OpenVINO) for CNN-based models while also achieving optimal performance on different platforms, such as Intel GPUs. These findings highlight the effectiveness of our solution.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.005 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.002 | 0.000 |
| Scholarly communication | 0.001 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".