[scheduling] Use ASAP/ALAP bounds in the SDC scheduler#4489
Draft
copybara-service[bot] wants to merge 1 commit into
Draft
[scheduling] Use ASAP/ALAP bounds in the SDC scheduler#4489copybara-service[bot] wants to merge 1 commit into
copybara-service[bot] wants to merge 1 commit into
Conversation
85b4e35 to
ac18912
Compare
By providing tighter initial ranges for the cycle variables in the LP model, the solver saves (apparently significant) time. This also lets us use the ASAP scheduler to compute the minimum possible pipeline length, if we need it. If the ASAP scheduler fails to converge (which is possible for complex constraints, but rare), we fall back to using the SDC scheduler directly. PiperOrigin-RevId: 939372611
ac18912 to
5b593e7
Compare
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.
[scheduling] Use ASAP/ALAP bounds in the SDC scheduler
By providing tighter initial ranges for the cycle variables in the LP model, the solver saves (apparently significant) time. This also lets us use the ASAP scheduler to compute the minimum possible pipeline length, if we need it.
If the ASAP scheduler fails to converge (which is possible for complex constraints, but rare), we fall back to using the SDC scheduler directly.