Real-Time Scheduling and Batching in GNU Radio for Bounded Response Times
Abstract
This paper investigates the application of real-time scheduling algorithms and theory to GNU Radio. The existing GNU Radio scheduler includes heuristics aimed at improving throughput, but such heuristics can also lead to temporal non-determinism and conflict with real-time scheduling analysis techniques. This paper shows how to apply the Linux SCHED_DEADLINE real-time scheduler, and how to more predictably batch processing of multiple samples or blocks to reduce system overheads and enable the application of real-time scheduling theory. This enables the analytical calculation of latency bounds while also serving as a tool to understand tradeoffs in how much processing can be supported on a given platform without overloading it. The paper presents two batching methods: Intra-block batching processes fixed-size sample batches within a block, while inter-block batching merges different blocks to reduce context switches and improve data locality. Experimental results demonstrate significant improvements in overheads due to batching. Batching-based real-time models are presented that reflect these effects, and analytical evaluations are conducted to show tradeoffs between batching and latency bounds. Finally, these concepts are demonstrated in GNU Radio with a simple NBFM receiver.
Downloads
Published
Issue
Section
License
- I grant gnuradio.org a perpetual, non-exclusive license to distribute this article.
- I certify that I have the right to grant this license.
- I understand that submissions cannot be completely removed once accepted.
- I understand that gnuradio.org reserves the right to reclassify or reject any submission.