![]() |
Re: periodic tasks in autonomous independent
For simplicity, the LV queue has been described generically as a Queue. In reality, it is implemented as a priority Q. OS threads are lazily allocated to service the head of each priority in use -- by default a few threads per CPU core per priority in use. This means that if tasks at different priorities become available, the OS scheduler is aware of the requests and will schedule accordingly.
Not being on the VxWorks RT team, I can't say exactly how the threads were created or how the Queue is implemented for the OS. I can't say exactly how VxWorks is expected to behave in the case of competing priorities, inversions, etc. So, I'm being vague about the implementations I don't know in great detail. If I had a cRIO available, I could write tests that measure the response, however. Greg McKaskle |
Re: periodic tasks in autonomous independent
Quote:
~ |
Re: periodic tasks in autonomous independent
Quote:
|
Re: periodic tasks in autonomous independent
I'm going to go ahead and answer my own questions here, based on what I've learned since my questions were posted, for the benefit of any other readers who may have been wanting the answers to the same questions.
Caveat: Don't take my word as authoritative. And a note to gurus: If I get any of this wrong please slap me upside the head: Quote:
Quote:
Quote:
~ |
Re: periodic tasks in autonomous independent
A+ on the quiz.
Greg McKaskle |
| All times are GMT -5. The time now is 09:44. |
Powered by vBulletin® Version 3.6.4
Copyright ©2000 - 2017, Jelsoft Enterprises Ltd.
Copyright © Chief Delphi