Introduction Modern stream processing engines are increasingly deployed on high-core-count servers with Non-Uniform Memory Access (NUMA) architectures, where the cost of inter-socket memory access poses a significant challenge to achieving low latency and high throughput. Existing approaches to operator placement either rely on static assignments that degrade under workload variations or employ dynamic migrations that incur excessive overhead due to blocking synchronization or global barriers.Methods This paper introduces a lock-free, NUMA-aware operator rebinding mechanism that dynamically reallocates operator tasks across threads with minimal disruption. The mechanism uses an autonomic controller to detect imbalance in per-thread queues and enacts rebinding via control messages and atomic updates, ensuring correctness without stalling execution. A two-level policy is proposed, combining NUMA-level partitioning with intra-node thread-level refinements, triggered by latency thresholds.Results Extensive experiments using a 300-query urban traffic analytics workload demonstrate that the proposed method achieves non-negligible throughput improvement and reduces latency compared to state-of-the-art static and METIS-based approaches. Furthermore, it reduces latency variance by an order of magnitude, illustrating the importance of fine-grained NUMA-aware scheduling in memory-bound stream processing.

Du, X., Piccione, A., Pimpini, A., Bortoli, S., Pellegrini, A., Knoll, A. (2026). Operator rebinding for stream processing on NUMA machines. SOFTWARE-PRACTICE & EXPERIENCE, 56(6), 687-708 [10.1002/spe.70064].

Operator rebinding for stream processing on NUMA machines

Pimpini, A.;Pellegrini, A.;
2026-01-01

Abstract

Introduction Modern stream processing engines are increasingly deployed on high-core-count servers with Non-Uniform Memory Access (NUMA) architectures, where the cost of inter-socket memory access poses a significant challenge to achieving low latency and high throughput. Existing approaches to operator placement either rely on static assignments that degrade under workload variations or employ dynamic migrations that incur excessive overhead due to blocking synchronization or global barriers.Methods This paper introduces a lock-free, NUMA-aware operator rebinding mechanism that dynamically reallocates operator tasks across threads with minimal disruption. The mechanism uses an autonomic controller to detect imbalance in per-thread queues and enacts rebinding via control messages and atomic updates, ensuring correctness without stalling execution. A two-level policy is proposed, combining NUMA-level partitioning with intra-node thread-level refinements, triggered by latency thresholds.Results Extensive experiments using a 300-query urban traffic analytics workload demonstrate that the proposed method achieves non-negligible throughput improvement and reduces latency compared to state-of-the-art static and METIS-based approaches. Furthermore, it reduces latency variance by an order of magnitude, illustrating the importance of fine-grained NUMA-aware scheduling in memory-bound stream processing.
2026
Pubblicato
Rilevanza internazionale
Articolo
Esperti anonimi
Settore IINF-05/A - Sistemi di elaborazione delle informazioni
English
Low-latency analytics
NUMA-aware scheduling
Operator rebinding
Stream processing
Du, X., Piccione, A., Pimpini, A., Bortoli, S., Pellegrini, A., Knoll, A. (2026). Operator rebinding for stream processing on NUMA machines. SOFTWARE-PRACTICE & EXPERIENCE, 56(6), 687-708 [10.1002/spe.70064].
Du, X; Piccione, A; Pimpini, A; Bortoli, S; Pellegrini, A; Knoll, A
Articolo su rivista
File in questo prodotto:
File Dimensione Formato  
Dux26.pdf

solo utenti autorizzati

Tipologia: Documento in Post-print
Licenza: Copyright dell'editore
Dimensione 2.91 MB
Formato Adobe PDF
2.91 MB Adobe PDF   Visualizza/Apri   Richiedi una copia

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/2108/463623
Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus ND
  • ???jsp.display-item.citation.isi??? 0
social impact