ADS Algorithm Partitioning Under Scheduling Budget Constraints

The patent segments algorithms into different priority levels (first priority for safety-critical functions, second priority for less critical functions). This segmentation allows the system to allocate computational resources preferentially to safety-critical algorithms, ensuring reliability while managing overall computational consumption within available budget constraints.

The patent implements dynamic allocation of computational resources based on runtime conditions and priority levels. The system can adaptively adjust which algorithms execute and at what frequency, allowing second-priority algorithms to run when resources are available while ensuring first-priority algorithms always receive sufficient resources. This dynamic approach enables the system to maintain high functionality while achieving resource efficiency.

The patent applies different execution frequencies to different algorithm priority levels. First-priority algorithms execute at the full set frequency to maintain real-time performance for safety-critical functions, while second-priority algorithms execute at lower frequencies when computational budget allows. This local differentiation of execution quality enables the system to maintain necessary real-time performance while staying within computational budget constraints.