Skip to content
Book

WADO: A Distributed WORM Storage Service for Asynchronous Data Operations

Aug 2026 · International Conference on Statistical and Scientific Database Management · 0 citations · 5 references
Computer Science

TL;DR

WADO is presented, a distributed write-once-read-many (WORM) object-store runtime for data-centric workloads that closes this gap through three coordinated mechanisms: scope-centric processing, explicit pipeline decomposition, and interference-aware explicit parallelism.

Abstract

AI-driven scientific workloads increasingly depend on data-intensive input pipelines, where deep learning frameworks must ingest and transform large datasets from hierarchical HPC storage. Existing system-centric data services improve movement and locality between the parallel file system (PFS), node-local storage, and memory. However, they do not directly optimize how input pipeline operations execute across scopes, stage overlap, and resource-specific parallelism. As scale grows, this gap causes worker stalls, contention, and poor hardware utilization. We present WADO, a distributed write-once-read-many (WORM) object-store runtime for data-centric workloads that closes this gap through three coordinated mechanisms: scope-centric processing, explicit pipeline decomposition, and interference-aware explicit parallelism. WADO dynamically maps operations to execution scopes, overlaps stages such as I/O, communication, and transformations, and applies contention-aware concurrency control to match hardware behavior at runtime. Our evaluation shows three main findings: (1) scope-centric processing preserves throughput under scale, improving mixed-operation throughput by up to 1.65 × ; (2) explicit pipeline decomposition converts serialized wait into overlapped progress, delivering up to 2.16 × higher sustained bandwidth; and (3) interference-aware explicit parallelism improves effective bandwidth by up to 4.4 × by avoiding oversubscription collapse. On Unet3D model training, these mechanisms translate to end-to-end gains, improving data loading performance by 4.1 × compared to baseline PyTorch on Lustre, and 1.51 × compared to DYAD, enabled by deeper pipelining, adaptive parallelism, and near-data transformation offloading.

View source

Similar papers

Open access Sep 2026

Toward Disaggregated Analytical Database Systems in the AI Hardware Era

This paper identifies effective I/O-computation overlap as a key requirement for fully exploiting the AI data center stack, and outlines future research directions for next-generation analytical database architectures.

Ji-Gao Luo, Nils Boeschen, Muhammad El-Hindi et al. · 0 citations
Aug 2026

Enhancing Database Write Performance with the Write Operation Pushdown Framework

WOP leverages the redo-flush path to push down write operations and enhances the storage layer for semantic-aware execution and supports high pushdown capacity with minimal memory footprint through Lightweight Metadata Tracking.

Hao Wu, Lu-Tong Zhang, Xin-Ying Zheng et al. · 0 citations
Preprint Sep 2026

LLM Inference on IMC-NoC Architecture with Balanced Dataflow and Fine-Grained Parallelism

A hardware-software co-design framework that unifies distributed compute, memory, and communication into a seamless processing-communication fabric is presented and a prefill-decode disaggregation approach that dynamically reconfigures PE organizations to maximize resource utilization is presented.

Yimin Wang, Yue Jiet Chong, Xuan-Yao Fong · 0 citations
Book Open access Sep 2026

MEDO: Adaptive Multi-Stream Data Offloading for Efficient Management of Disaggregated Memory Pool

The scale of data-intensive workloads in intelligent datacenters has grown rapidly in recent years, intensifying the need for efficient data movement within disaggregated memory pools across memory and storage subsystems. However, most existing solutions focus primarily on optimizing communication between compute nodes...

Jing Wang, Han-Zhang Yang, Chao Li et al. · 0 citations
Jul 2026

NLock: A Scalable Lock for NUMA Architectures

The design of NLock enables an efficient local hand-over mechanism and in turn, achieves substantial performance advantages by co-optimizing lock design with modern NUMA architectures, and is evaluated against state-of-the-art locking mechanisms and concurrent data structures.

Brahmaiah Gandham, Praveen Alapati, Aman Iftekhar · 0 citations
Jul 2026

CrocSort: Resource-Efficient, Skew-Resilient Parallel External Merge Sort

CrocSort is presented, a byte-balanced parallel external merge sort with configurable memory and per-phase thread settings with practical resource-configuration rules for selecting these settings from input size, memory budget, and thread cap.

Riki Otaki, Charles Benello, Fuheng Zhao et al. · 0 citations

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