Skip to content

[ET][Memory planning] Improve greedy memory planning. #7995

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

Merged
merged 2 commits into from
Jan 28, 2025

Conversation

pytorchbot
Copy link
Collaborator

This PR was created by the merge bot to help merge the original PR into the main branch.
ghstack PR number: #7926
^ Please use this as the source of truth for the PR details, comments, and reviews
ghstack PR base: https://github.com/pytorch/executorch/tree/gh/kimishpatel/151/base
ghstack PR head: https://github.com/pytorch/executorch/tree/gh/kimishpatel/151/head
Merge bot PR base: https://github.com/pytorch/executorch/tree/gh/kimishpatel/150/orig
Merge bot PR head: https://github.com/pytorch/executorch/tree/gh/kimishpatel/151/orig
@diff-train-skip-merge

Pull Request resolved: #7925

ATT
ghstack-source-id: 263342054
@exported-using-ghexport

Differential Revision: [D68448333](https://our.internmc.facebook.com/intern/diff/D68448333/)
Pull Request resolved: #7926

This diff replaces the old greedy algorithm. Older algorithm resulted in 35%
worse compared to theoretical optimum. THis matter for long context even more
since additional overhead can be few hundred MB.
For example the theorical optimial for llama3_2 8B, 4-bit quantized modelw ith
context length of 2k needs about 1G of memory. This theoretcial max can be
observed by looking at the peaks in memory profile.

Current agorithm resulted in about 1.6GB of planned memory. New algorithm
reduce that to about 1.1G.
ghstack-source-id: 263342052
@exported-using-ghexport

Differential Revision: [D68448332](https://our.internmc.facebook.com/intern/diff/D68448332/)
Copy link

pytorch-bot bot commented Jan 28, 2025

🔗 Helpful Links

🧪 See artifacts and rendered test results at hud.pytorch.org/pr/pytorch/executorch/7995

Note: Links to docs will display an error until the docs builds have been completed.

❌ 1 New Failure

As of commit 510d795 with merge base d4a8f8f (image):

NEW FAILURE - The following job has failed:

This comment was automatically generated by Dr. CI and updates every 15 minutes.

@facebook-github-bot facebook-github-bot added the CLA Signed This label is managed by the Facebook bot. Authors need to sign the CLA before a PR can be reviewed. label Jan 28, 2025
Base automatically changed from gh/kimishpatel/150/orig to main January 28, 2025 16:17
@manuelcandales manuelcandales merged commit bdd3d9c into main Jan 28, 2025
43 of 44 checks passed
@manuelcandales manuelcandales deleted the gh/kimishpatel/151/orig branch January 28, 2025 17:27
YIWENX14 pushed a commit that referenced this pull request Jan 28, 2025
* Fix memory profiling for memory.view ops

Pull Request resolved: #7925

ATT
ghstack-source-id: 263342054
@exported-using-ghexport

Differential Revision: [D68448333](https://our.internmc.facebook.com/intern/diff/D68448333/)

* [ET][Memory planning] Improve greedy memory planning.

Pull Request resolved: #7926

This diff replaces the old greedy algorithm. Older algorithm resulted in 35%
worse compared to theoretical optimum. THis matter for long context even more
since additional overhead can be few hundred MB.
For example the theorical optimial for llama3_2 8B, 4-bit quantized modelw ith
context length of 2k needs about 1G of memory. This theoretcial max can be
observed by looking at the peaks in memory profile.

Current agorithm resulted in about 1.6GB of planned memory. New algorithm
reduce that to about 1.1G.
ghstack-source-id: 263342052
@exported-using-ghexport

Differential Revision: [D68448332](https://our.internmc.facebook.com/intern/diff/D68448332/)

---------

Co-authored-by: Kimish Patel <[email protected]>
zonglinpeng pushed a commit to zonglinpeng/executorch that referenced this pull request Jan 30, 2025
* Fix memory profiling for memory.view ops

Pull Request resolved: pytorch#7925

ATT
ghstack-source-id: 263342054
@exported-using-ghexport

Differential Revision: [D68448333](https://our.internmc.facebook.com/intern/diff/D68448333/)

* [ET][Memory planning] Improve greedy memory planning.

Pull Request resolved: pytorch#7926

This diff replaces the old greedy algorithm. Older algorithm resulted in 35%
worse compared to theoretical optimum. THis matter for long context even more
since additional overhead can be few hundred MB.
For example the theorical optimial for llama3_2 8B, 4-bit quantized modelw ith
context length of 2k needs about 1G of memory. This theoretcial max can be
observed by looking at the peaks in memory profile.

Current agorithm resulted in about 1.6GB of planned memory. New algorithm
reduce that to about 1.1G.
ghstack-source-id: 263342052
@exported-using-ghexport

Differential Revision: [D68448332](https://our.internmc.facebook.com/intern/diff/D68448332/)

---------

Co-authored-by: Kimish Patel <[email protected]>
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
CLA Signed This label is managed by the Facebook bot. Authors need to sign the CLA before a PR can be reviewed.
Projects
None yet
Development

Successfully merging this pull request may close these issues.

4 participants