The architecture introduces two reusable system-level design principles: interrupt-independent notification via sequence counters, avoiding OS-mediated jitter as much as possible, and cache-aware core selection based on the non-uniform cache architecture (NUCA) to reduce the variability of access latency, thereby achieving a tighter transmission jitter distribution.
Abstract
Achieving periodic, low-latency data transfer with deterministic timing guarantees between I/O devices (e.g., Field-Programmable Gate Arrays (FPGAs)) and hosts remains a fundamental challenge in real-time domains, including automated driving, high-frequency trading, and hardware-in-the-loop systems. Unpredictable communication delays or jitter in these applications can directly compromise system correctness and safety. Conventional I/O data interaction mechanisms, which are typically built upon high-speed Network Interface Cards (NICs), USB protocols, and serial interfaces, fall short of meeting these stringent temporal constraints. These generic approaches introduce substantial jitter through heavy protocol overheads (e.g., TCP/UDP processing), mandatory data copies between kernel and user space, and unpredictable packet queuing dynamics, rendering them unsuitable for real-time host–device communication. To address this challenge, we propose a deterministic I/O data interaction architecture that bounds latency jitter through co-optimization across the hardware, driver, operating system, and application layers. The architecture introduces two reusable system-level design principles: interrupt-independent notification via sequence counters, avoiding OS-mediated jitter as much as possible, and cache-aware core selection based on the non-uniform cache architecture (NUCA) to reduce the variability of access latency, thereby achieving a tighter transmission jitter distribution. We systematically evaluate the performance of the proposed architecture under diverse conditions, including different non-uniform memory access (NUMA) nodes and various data direct I/O (DDIO) and cache allocation technology (CAT) configurations. Experimental results show that our approach achieves a peak jitter of approximately 70 ns at 2 µs transmission intervals, which is about 42% lower than the baseline jitter.
This study proposes the design and FPGA implementation of an Optimized Pipelined RISC-V Processor, designed as a high throughput controller for Ethernet networking environment that uses a pipelined data path based on the RV32I instruction set.
S. Rao, Satish S. Bhairannawar· International journal of com...· 0 citations
This survey provides a detailed examination of the practical capability boundaries of prominent programmable data plane technologies, including Protocol-Oblivious Forwarding (POF), Programming Protocol-independent Packet Processors (P4), the extended Berkeley Packet Filter (eBPF), and the Network Programming Language (...
Yaying Chen, S. Layeghy, Marius Portmann· IEEE Access· 0 citations
Vehicle-to-Infrastructure (V2I) communication systems demand ultra-low latency, high throughput, and reliable data delivery for safety-critical traffic applications, such as dynamic water level assessment and vehicle clearance evaluation at entryway barriers. Traditional wireless communication technologies, including W...
Yitao Li· Journal of computer science...· 0 citations
Industrial edge platforms increasingly consolidate real-time control and general-purpose workloads on a single system-on-chip (SoC) to reduce costs, power, and complexity. Conventional real-time virtual machine (RTVM) setups, however, typically rely on PREEMPT_RT Linux and commonly reserve at least two CPU cores to iso...
Chwee-Lin Choong, Yoong Siang Song, Xin Yuan et al.· IEEE International Conferenc...· 0 citations
Results show that standardizing the host-interface layer reduces both the engineering cost of PIM simulator development and the energy overhead of simulation-driven workload evaluation, while reducing host CPU utilization and package energy by up to 50% on transfer-intensive workloads.
The conventional threading model multiplexes software threads onto hardware cores. This model inherently suffers from the overhead of 1) context switching, 2) scheduling, and 3) system event notifications (e.g., I/O interrupts). As computing enters μs-scale, such overheads become the key bottleneck of a wide range of d...
Yi-Ming Yao, Xiao-He Qin, Yi Fan et al.· Proceedings of the ACM SIGOP...· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.