Conversation
Owner
Author
|
Seems that this doesn't quite work for SMP just yet. Some more work needs to be done. |
Owner
Author
|
It looks like there's something still wrong with context switching (eventually registers get corrupted on a context switch?). This maybe can be fixed by just progressing through more changes for the scheduler, which when complete this can be safely merged in. |
This doesn't allow for actual swapping of threads, for now though.
…list implementation where possible
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.This suggestion is invalid because no changes were made to the code.Suggestions cannot be applied while the pull request is closed.Suggestions cannot be applied while viewing a subset of changes.Only one suggestion per line can be applied in a batch.Add this suggestion to a batch that can be applied as a single commit.Applying suggestions on deleted lines is not supported.You must change the existing code in this line in order to create a valid suggestion.Outdated suggestions cannot be applied.This suggestion has been applied or marked resolved.Suggestions cannot be applied from pending reviews.Suggestions cannot be applied on multi-line comments.Suggestions cannot be applied while the pull request is queued to merge.Suggestion cannot be applied right now. Please check back later.
This patch (roughly) implements the MuQSS scheduling algorithm, allowing for a more fair way to schedule between multiple processes.
Some things aren't quite done yet (TryAcquire for each local runqueue instead of an outright spinlock acquire), but this is much safer (and cleaner) than the prior round robin method.