Scheduler composability with arena-based data structures
summary
Progress on BPF arenas shows they bypass the BPF verifier enough to implement recursive data structures (trees, priority queues, hash tables) in-prog, removing the need to extend kernel DSQ primitives and avoiding costly workarounds like linear DSQ traversal for task removal. Prototype arena task queues (ATQs) are already in use (P2DQ, LAVD, LAD, CPU‑max), and libfilter holds queuing, topology and CPU‑mask code. Caveats: cannot store privileged kernel fields or pass arena pointers into kfuncs, so kernel calls remain for enforcement.
AI-written summary · about