It is super cool. I wonder if it could be expanded to find the bottleneck for NFs? for example if the NF is CPU bound or memory bound. There was a work that predicted the performance of eBPF programs based on memory access or cache miss metric (had performance interface in the name). This tool could help actually find the bottleneck at runtime
It is super cool. I wonder if it could be expanded to find the bottleneck for NFs? for example if the NF is CPU bound or memory bound. There was a work that predicted the performance of eBPF programs based on memory access or cache miss metric (had performance interface in the name). This tool could help actually find the bottleneck at runtime
Link to paper: https://dl.acm.org/doi/pdf/10.1145/3748355.3748367