Libra uses eBPF to perform selective metadata copying in sockets, reducing kernel-user data movement for L7 proxies and delivering up to 4.2x plaintext throughput with over 90% lower P99 tail latency.
Title resolution pending
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
verdicts
UNVERDICTED 3roles
background 1polarities
background 1representative citing papers
Algorithms for all maximal palindromes with wildcards and k-mismatches, including linear-space methods and time-memory tradeoffs.
A survey of string covering techniques including covers and seeds, with proposals for future research directions in combinatorial string algorithms.
citing papers explorer
-
Libra: Accelerating Socket I/O via Programmable Selective Data Copying
Libra uses eBPF to perform selective metadata copying in sockets, reducing kernel-user data movement for L7 proxies and delivering up to 4.2x plaintext throughput with over 90% lower P99 tail latency.
-
On Time-Memory Tradeoffs for Maximal Palindromes with Wildcards and $k$-Mismatches
Algorithms for all maximal palindromes with wildcards and k-mismatches, including linear-space methods and time-memory tradeoffs.
-
String Covering: A Survey
A survey of string covering techniques including covers and seeds, with proposals for future research directions in combinatorial string algorithms.