The Research archive provides access to all Research articles published in past issues of Communications of the ACM.
We propose several efficient data structures for the exact and approximate variants of the fair near neighbor problem.
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.
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.
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.