wonks / ICFP_rehearsal_feedback

Temporary repository to collect feedback.
1 stars 2 forks source link

Talk 11: Nilesh Mahajan #11

Open rrnewton opened 8 years ago

cgswords commented 8 years ago

Put the communication on the slides!

ccshan commented 8 years ago

Watch where you're pointing with the laser pointer and be intentional!

cgswords commented 8 years ago

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?

samth commented 8 years ago

Pictures!

ccshan commented 8 years ago

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.

ccshan commented 8 years ago

Please enlarge the code snippets (perhaps inserting more line breaks)

ccshan commented 8 years ago

Why "Allgatherv" in the slide title?

cgswords commented 8 years ago

Also, please define the keywords? What does _at_ do? Maybe it does a lot of things?

samth commented 8 years ago

Showing the "formal syntax" is rarely useful -- show examples instead.

ccshan commented 8 years ago

I suspect that any point you try to make using a Formal Syntax slide is better made by example without showing any BNF production.

samth commented 8 years ago

@ccshan Jinx.

cgswords commented 8 years ago

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.

cgswords commented 8 years ago

@samth I nearly typed "and the thing Sam is about to post about not showing the formal definition" ;)

cgswords commented 8 years ago

What guarantees do we have that communcation will always succeed?

cgswords commented 8 years ago

"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.

cgswords commented 8 years ago

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?

cgswords commented 8 years ago

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.

cgswords commented 8 years ago

What sorts of compiler support are you shooting for? Why is it a problem?

cgswords commented 8 years ago

Color key for the tests, and maybe use fewer graphs.

samth commented 8 years ago

Have a thank you slide that includes your main points so that it's up during the question period.

samth commented 8 years ago

Feedback

ccshan commented 8 years ago