patacongo commented on issue #2935: URL: https://github.com/apache/incubator-nuttx/issues/2935#issuecomment-802839785
> > > @patacongo thanks for including it in the os-tests. > > Yes, I agree, there should be a third thread scheduled with FIFO (like in my test setup) that eats up the remaining cycles. Proposed setup: > > ``` > user_main: Dual sporadic thread test > Sporadic 1: prio high 180, low 20, repl 100000000 ns > Sporadic 2: prio high 180, low 20, repl 100000000 ns > FIFO : prio 100, (busy loop, which does computation all the time) > ``` > > Then, a sporadic thread with a budget of e.g. 30 % shall also result in about 30% processing time, and not any value above 30%. I think with this setup you can properly verify the correctness of the sporadic server scheduling algorithm. I did this in a different way: I added two counts, one when the priority is high and one when the priority is low. The high priority count should be equal to the budget. Low priority counts will occur when the CPU is IDLE and has nothing else to do. Now, I can see the problem more clearly. I will edit this comment and report the results in a few minutes. -- This is an automated message from the Apache Git Service. To respond to the message, please log on to GitHub and use the URL above to go to the specific comment. For queries about this service, please contact Infrastructure at: us...@infra.apache.org
