An RTOS typically uses specialized scheduling algorithms in order to provide the real-time developer with the tools necessary to produce deterministic behavior in the final system.
The real key is designing the scheduler. Usually, the data structure of the ready list in the scheduler is designed to minimize the worst-case length of time spent in the scheduler's critical section, during which preemption is inhibited, and, in some cases, all interrupts are disabled.
| Test | Description |
|---|---|
| Context-Switch | This benchmark measures the overhead (in µs) required to deliver a signal and switch to the high-priority process varying the particular kernel configuration and the target architecture supported by BeRTOS. |
| Memory Footprint | This benchmark measures the memory footprint of the BeRTOS kernel + a simple minimalist user application. The purpose of this test is to give a measure of the required space in a generic flash memory to store a full-featured BeRTOS kernel. |
Submit your own tests!
- Submit to the support forum your own tests and benchmarks; we can optimize BeRTOS together!
Join us on Facebook —
Follow us on Twitter
