-
Notifications
You must be signed in to change notification settings - Fork 15
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
[Autoshard] Auto-parallelism solver #96
Open
chhzh123
wants to merge
36
commits into
awslabs:main
Choose a base branch
from
chhzh123:solver
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
Conversation
This file contains 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.
Description
This PR introduces an auto-parallelism solver that finds the optimal sharding scheme for a given model. Basically, it models the parallelism scheme of each tensor as the combination of "R" and "S" specs, where R represents "replicated", and S denotes "sharded". We can explicitly calculate the computation and resharding cost (#95) of each operator, and sum all the costs together to form an optimization problem.
The problem is then encoded as a program synthesis problem and solved by a z3 solver using counter-example guided synthesis. Detailed process can be found in the
solver.py
file.A sample output of a two-layer MLP is shown below. It shows how the solver finds the optimal scheme step by step. The cost of each scheme is also dumped for users to better reason about the tradeoff.
Checklist
The autosharder is still in early shape and requires more rigorous testing, but I would like to first gather more suggestions on the interface and code organizations.
cc @comaniac @zarzen @whbldhwj