there will be some other tasks in the system that need time guarantees around when they get scheduled for very important (safety?) reasons. so when these higher priority tasks show up the lower priority tasks get suspended.

if they could guarantee hard bounds on how long low priority tasks take to complete they could implement your scheduling algorithm. but i think in reality the low priority tasks are either not boundable or they if they do have a provable bound the bound is too high.

It’s my understanding that this subsystem that failed only allocates codes but I could be wrong there.

It doesn’t make sense to have other non-code allocation things competing for queue space with code allocations.