Four Solutions to a Trivial Problem - Guy Steele Jr.

Channel:Google TechTalks · Length:1:01:47 · Published:2016-01-28 · Views:36435

Watch on YouTube

Summary

Guy Steele presents a small geometric problem and compares four computational approaches: a classic sequential solution and three parallel-friendly ones. Each is illustrated pictorially and with working code, weighing total work against time to solution.

Why HN recommends it

HN points to it as a clear lesson that algebraic properties like associativity unlock parallelism, applicable in any language.

watch Guy Steele's talks [1][2][3] if you are interested in data parallelism! — HN, 2020

Functional programming · Algorithms & data structures

Subtitles (excerpt)

MATT: Today we have with us Guy Steele, a name that may be familiar to many of you. He's had a hand in a number of specifications for programming languages, including Common Lisp and Java, which I think there are some people in this office who might use those. And he's asked me to keep the introduction short, so here he is. [APPLAUSE] GUY L. STEELE, JR: OK, thank you, Matt. It's good to be here. I see a number of familiar faces in the room, including some I didn't expect to see here today, so thanks for coming. I hope you enjoy this talk. It's about parallel programming. And I feel like at Google I may be kind of preaching to the choir about parallel programming, but I've got my own perspective on it. And this is a talk I give in other places, so if nothing else you can hear the message that I'm giving in other places as well, most recently just at Harvard last month. So the main point of this talk is that I think that the best way to write parallel applications is, as much as possible, not to have to think about the parallelism. Parallelism is something that comes hard to our brains, for some reason, and there is a need for separation of concerns. And I think the issue is not so much thinking about parallelism as such,

On Hacker News

Hi, the author here. One of the hidden messages of the introduction is: watch Guy Steele's talks [1][2][3] if you are interested in data parallelism! These talks are not Julia-specific and the idea is applicable and very useful in any languages. My libraries are heavily inspired by these talks. Of course, if you haven't used Julia yet, it'd be great if (data) parallelism gives you an excuse to tr… — tkf, 2020-10
Guy Steele Jr. worked on a language called "Fortress." There are a few good talks that he gives: - (toy problem) [VIDEO] - (parallelism) [LINK] - (languages) [LINK] — MathMonkeyMan, 2023-07
This type of interviewing style is bullshit. It means the interviewer knows a better solution that is "clever" and expects you to either have the same cleverness epiphany on the spot or to have studied this question. Neither is actually very useful as a hiring criterion. Guy Steele gave an incredibly interesting guest talk[1] at google about four different ways to solve this exact problem, and th… — heleninboodler, 2022-09
I enjoyed this talk along the same lines by Guy Steele, regarding not necessarily forcing a sequential solution to a non-sequential problem: Four Solutions to a Trivial Problem - Guy Steele Jr.: [VIDEO] Look for steps that are commutative and/or associative in the problem to exploit parallelism. — platz, 2018-08
I think APL has a lot to teach us about parallel (specifically GPU) programming. I've rewatched a few talks with Aaron Hsu and listened to his arraycast podcast[1]. In researching an upcoming blog post on monoids, I tried implementing the problem in Guy Steele's "Four Solutions to a Trivial Problem" talk[2] in APL (actually I tried GNU APL for this, because I didn't need anything fancy). This is … — raphlinus, 2022-02

Related videos