-
Notifications
You must be signed in to change notification settings - Fork 2
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
Talk 11: Nilesh Mahajan #11
Comments
Put the communication on the slides! |
Watch where you're pointing with the laser pointer and be intentional! |
Kanor's syntax is hard to read for me. Is it possible to abstract over it maybe, or give pictoral explainations of these (clearly powerful) language constructs? |
Pictures! |
At the "Kanor Equivalent" slide I wonder whether the processing of sender and receiver pairs takes O(n^2) rather than O(n) time using Kanor, where n is the number of processors. |
Please enlarge the code snippets (perhaps inserting more line breaks) |
Why "Allgatherv" in the slide title? |
Also, please define the keywords? What does |
Showing the "formal syntax" is rarely useful -- show examples instead. |
I suspect that any point you try to make using a Formal Syntax slide is better made by example without showing any BNF production. |
@ccshan Jinx. |
Yes, that. Spend time on smaller examples before diving in, leading us through the language features we need to know before building the big ones. |
@samth I nearly typed "and the thing Sam is about to post about not showing the formal definition" ;) |
What guarantees do we have that communcation will always succeed? |
"Better than what"? You describe these properties and then say we can do better at runtime, but it's hard to tell what you're trying to improve there. |
Does the programmer define the communication knowledge of their application? Or is this a thing that crops up based on how you write the program, to be used as a general classification technique? |
For your algorithm, it may be better to gave two computation graphs, one where it holds and one where it doesn't, and talk through the algorithm with them, demonstrating how one fails and one succeeds. |
What sorts of compiler support are you shooting for? Why is it a problem? |
Color key for the tests, and maybe use fewer graphs. |
Have a thank you slide that includes your main points so that it's up during the question period. |
Feedback
|
|
No description provided.
The text was updated successfully, but these errors were encountered: