Skip to content
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

Tensor parallelism for multi-step scheduling #457

Merged
merged 2 commits into from
Nov 5, 2024

Conversation

tzielinski-habana
Copy link

This PR implements tensor parallelism for multi-step scheduling.

@@ -97,7 +98,10 @@ def subtuple(obj: object,
if to_override is None:
to_override = {}
fields = set(to_copy) | set(to_override.keys())
values = {f: to_override.get(f, getattr(obj, f)) for f in fields}
if type(obj) is dict:
values = {key: obj[key] for key in fields if key in obj}

Choose a reason for hiding this comment

The reason will be displayed to describe this comment to others. Learn more.

Is this method called often or sizes of object fields huge?

keys_in_obj = [key for key in fields if key in obj]
values = {key: obj[key] for key in keys_in_obj}

I think (based on obj size 1000 and fields 100 in timeit) prefiltering may decrease number of total iterations depending on the size of the obj.

@michalkuligowski michalkuligowski merged commit 653e56c into habana_main Nov 5, 2024
19 checks passed
@michalkuligowski michalkuligowski deleted the tp_for_mss branch November 5, 2024 09:03
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
None yet
Projects
None yet
Development

Successfully merging this pull request may close these issues.

2 participants