-
Notifications
You must be signed in to change notification settings - Fork 3.9k
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
New version of the VATS algorithm (Largest Dependency Set First) #115
Conversation
…chema.show_sanity.
what is different about the new implementation? |
Hi, thank you for your contribution. Please confirm this code is submitted under the terms of the OCA (Oracle's Contribution Agreement) you have previously signed by cutting and pasting the following text as a comment: |
Hi, Daniel. In this new implementation we look at the sub-tree of each lock instead of just looking at the arrival time in the system. This gives us a more accurate yet efficient enough way of deciding which transaction to schedule first. |
I confirm the code being submitted is offered under the terms of the OCA, and that I am authorized to contribute it. |
@sensssz , great, keep up the good work! 👍 |
Hi, thank you for your contribution. Your code has been assigned to an internal queue. Please follow |
This pull request uses a new version of the VATS algorithm under version 5.7.