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

Relation with TENSAT? #178

Open
ZakSingh opened this issue May 17, 2022 · 1 comment
Open

Relation with TENSAT? #178

ZakSingh opened this issue May 17, 2022 · 1 comment

Comments

@ZakSingh
Copy link

I'm new to the space and I'm trying to fit all the pieces together conceptually... TENSAT (https://github.com/uwplse/tensat) appears to operate in a closely related task. From my understanding, TENSAT is working at a higher level (performing subgraph substitutions of subgraphs of operators) whereas Glenside is a lower-level representation that can optimize the individual implementation of these operators.

Although (I think?) Glenside can process an entire computation graph at once, its rewrite rules focus it on a very different set of optimizations, and trying to shoe-horn in TENSAT's high level rewrites would, even if it is possible, blow up the search space too much for egg.

Conceptually, could the two approaches be combined in a hierarchical fashion in which TENSAT rewrites the computation graph, then Glenside could be used to optimize each operator in isolation?

@gussmith23
Copy link
Owner

gussmith23 commented May 17, 2022 via email

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

No branches or pull requests

2 participants