Skip to content

This issue was moved to a discussion.

You can continue the conversation there. Go to discussion →

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.

Sign up for GitHub

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

Jump to bottom

[Optimisation, Optimization] : reduce graph size #212

Closed
emil14 opened this issue Mar 8, 2023 · 1 comment
Closed

[Optimisation, Optimization] : reduce graph size #212

emil14 opened this issue Mar 8, 2023 · 1 comment
Labels
Optimisation

Comments

@emil14
Copy link
Collaborator

emil14 commented Mar 8, 2023 •
edited
Loading

Actual computation is routines. Can we somehow calculate the smallest possible graph at optimization pass? This should probably be under some -o flag or just be simply disabled with run cmd not to loose ability to debug your program as is
@emil14
Copy link
Collaborator Author

emil14 commented Mar 9, 2023 •
edited
Loading

Givers count

Imagine there's 2 givers that both sends the same (equal?) msg but to different places. It's possible to leave just 1 giver with 2 connections instead of having 2 givers with 1 connection each.

This is the reason why we don't need msg refs at runtime

@emil14 emil14 changed the title Optimisation: reduce graph size [Optimisation, Optimization] : reduce graph size Mar 9, 2023
@emil14 emil14 mentioned this issue Apr 23, 2023
Closed
@nevalang nevalang locked and limited conversation to collaborators Dec 10, 2023
@emil14 emil14 converted this issue into discussion #403 Dec 10, 2023

This issue was moved to a discussion.

You can continue the conversation there. Go to discussion →

Assignees
No one assigned
Labels
Optimisation
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@emil14