-
-
Notifications
You must be signed in to change notification settings - Fork 42
Refine resource's queue discipline #20
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Comments
ideally different levels of priorities e.g.
|
woops, didn't mean to close it 😬 |
Nice! BTW, merge the latest developments of the master branch in your tree, please. For instance, I introduced the Boost library and I created a new header devoted to standardise the use of efficient containers (vector, queues, map, set...) through macros. |
nice^2 I'll try to do the merge this evening |
check 8a23121 for a start with testing FIFO processing (and implementation) |
moved compare func into the struct (tx, a lot more elegant) e2d2822 haven't had time to look into in in detail but couldn't get your suggestion working on the simple FIFO ordering when priorities are equal (for example, std::sort also doesn't guarantee preserving order of equal elements). |
merging initial priority queue developments into dev-main (#20)
You are right. Definitely, we need the Now, what about preemption? It is a far more complex task. 😬 I'm going to merge the current changes into the master branch before continuing with this. |
Latest developments on #20 and some fixes
Let's close this and discuss the preemption (which will be a far bigger challenge 😀) in #34 |
The text was updated successfully, but these errors were encountered: