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

[Feature] Improve scheduling algorithm for loops #34

Open
markoshorro opened this issue Nov 2, 2022 · 0 comments
Open

[Feature] Improve scheduling algorithm for loops #34

markoshorro opened this issue Nov 2, 2022 · 0 comments
Labels
enhancement New feature or request performance Issue realted with performance of the compiler refactor This issue is related with code

Comments

@markoshorro
Copy link
Member

Description of the problem or scenario potentially improvable:

Currently all code is generated ad-hoc, there is no much logic on the greedy algorithm that packs together the operations. This is because we're assuming that we know all the sizes of the loops, but there could be cases where we don't.

Description of the solution

Create a pass/stage for analyzing the code size/latency/cycles ONLY of the loop.

Side effects or any other known issues caused by this feature:

Better scheduling for the loop. This could slow down a lot if there are many loops, so this shouldn't be a long/heavy stage. Aim for parallelism whenever possible.

@markoshorro markoshorro added enhancement New feature or request refactor This issue is related with code performance Issue realted with performance of the compiler labels Nov 2, 2022
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Labels
enhancement New feature or request performance Issue realted with performance of the compiler refactor This issue is related with code
Projects
None yet
Development

No branches or pull requests

1 participant