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

[Unity][Dlight] Enabling Fast and Efficient Kernel Generation by leveraging Hardware information #16440

Draft
wants to merge 42 commits into
base: main
Choose a base branch
from

Conversation

LeiWang1999
Copy link
Contributor

@LeiWang1999 LeiWang1999 commented Jan 20, 2024

This pull request serves as an enhancement to Dlight. This update primarily focuses on incorporating hardware information to recommend tile candidates, which enables fast tuning.

Below is a brief summary of the major changes:

Related discussion: https://discuss.tvm.apache.org/t/dlight-enabling-fast-and-efficient-kernel-generation-by-leveraging-hardware-information/16273

TODO Items of this pull request:

  • provide related testing.
  • code style may need guidance (e.g. remove or replace the log print; refactor some python components to cpp)
  • leverage structural equal cache to avoid duplicated tuning.
  • implement mma schedule template with swizzling.
  • support dynamic symbolic tuning
  • bring it to mlc-llm (maybe should improve our design to support dynamic symbolic).

Ubospica and others added 28 commits November 13, 2023 09:43
@tqchen tqchen changed the base branch from unity to main January 21, 2024 20:49
Copy link
Contributor Author

Choose a reason for hiding this comment

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

we only had shared.dyn because the merge_shared_memory can only merge dynamic, currently we can also enable static shared memory merge.

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