Communications of the ACM
Research Archive
The Research archive provides access to all Research articles published in past issues of Communications of the ACM.
August 2022
From Communications of the ACM
Sampling Near Neighbors in Search for Fairness
We propose several efficient data structures for the exact and approximate variants of the fair near neighbor problem.
From Communications of the ACM
hXDP: Efficient Software Packet Processing on FPGA NICs
We present hXDP, a solution to run on FPGAs software packet processing tasks described with the eBPF technology and targeting the Linux's eXpress Data Path.
From Communications of the ACM
Technical Perspective: Can Data Structures Treat Us Fairly?
In "Sampling Near Neighbors in Search for Fairness," Aumüller et al. investigate a basic problem in similarity search called near neighbor in the context of fair data structures.
From Communications of the ACM
Technical Perspective: hXDP: Light and Efficient Packet Processing Offload
In "hXDP: Efficient Software Packet Processing on FPGA NICs," the authors offer an interesting solution to bridging the performance gap between the CPU and the home network.