Skip to content

generalize lemma for bound on busy window

Kimaya Bedarkar requested to merge kbedarka/rt-proofs:generalize into master

previously the lemma proving the soundness for the bound on the length of the busy window was proved separately in the edf and fifo RTAs. However, this lemma does not depend on the scheduling policy under consideration, and therefore has been moved to analysis.abstract.ideal_jlfp_rta

Merge request reports