Thanks for the detailed write-up. My only concern with your choice is whether these two function pointers, get_highest_ready and get_lowest_ready, will get called along other paths when there hasn't been a task arrival/departure? This shouldn't cause a correctness problem, but it may cause a performance problem.
A bit relatedly, are there other task arrivals/departures that you should understand to make sure you are covering things completely? Do they all traverse the Scheduler_Unblock/Scheduler_Block? If not, then it would be a correctness problem. Gedare On Tue, Aug 4, 2020 at 8:20 AM Richi Dubey <richidu...@gmail.com> wrote: > > Hi, > > Implementing the Strong APA scheduler requires finding places to put the two > most important algorithms (pages 5 and 6 from the paper) in the current RTEMS > SMP scheduler framework. > > I have chosen get_highest_ready and get_lowest_ready to implement these > function and my reasoning behind doing so is documented in the blog > post-https://rtemswithrichi.wordpress.com/adding-strong-apa-to-rtems-identifying-relevant-functions/. > > I would love to hear your insights about the post. > Thanks, > Richi. > _______________________________________________ > devel mailing list > devel@rtems.org > http://lists.rtems.org/mailman/listinfo/devel _______________________________________________ devel mailing list devel@rtems.org http://lists.rtems.org/mailman/listinfo/devel
