'Fastware' - Andrei Alexandrescu [ ACCU 2016 ]

Channel:ACCU Conference · Length:1:02:17 · Published:2016-05-16 · Views:33582

Watch on YouTube

Summary

Andrei Alexandrescu's ACCU 2016 talk previews material from his book on writing fast code, with a focus on optimization techniques such as sentinels and faster search.

Why HN recommends it

HN recommends it as a careful, entertaining talk on low-level optimization that shows how textbook algorithms can be sped up.

If you’re skeptical, I really do encourage you to watch, he’s not sloppy. — HN, 2020

C, C++, Rust, Go & systems languages · Software performance & optimization · Algorithms & data structures

Subtitles (excerpt)

it is with great emotion that I'm starting this um I'm very honored to be invited at this prestigious conference ACC is the best in England right right let's keep it that way I'm 1 hour from now I don't want it to be a formally prestigious conference okay all right so uh Julie also asked me to uh ask you make a couple of other announcements um please turn off your cell phones um lunch will be served as usual at the jeel time and what's here oh no goto users are allowed in this room Julie what so look to your left and right and if there's anyone security is at the door to escort them out so today there's treasure everywhere you just got to look for it this is a talk about efficiency however it's also a keynote and I don't know how to deliver a keynote so my work in title was how to write a and deliver a keynote so I asked a few friends who are more versed in delivering Keynotes and ask you know what's in a keynote what should I do and they said oh this is great just talk about anything you like like Andy Warhol you know like paint what you like and he paint I like soup he painted soup and um that was it he became famous so and the other said should have no code and no math he should be some sort of a fluffy thing

On Hacker News

See Alexandrescu’s Fastware talk on how amazingly sentinels can improve even textbook algorithms, and how to apply the approach intelligently. E.g., for a linear search, overwrite the last element with the sought after value, and do a tiny bit of work to make that safe and to undo it before return. If you’re skeptical, I really do encourage you to watch, he’s not sloppy. [VIDEO] — dundarious, 2020-09
Assuming you're talking about Concepts, I've heard Andrei Alexandrescu, for example, challenge that hope [0], but I'd be happy to hear this has been fixed. [0] [VIDEO] — simiones, 2021-03
Andrei Alexandrescu describe the usage of this kind of search to speed up quicksort in his 'Fastware' (fun) video: [VIDEO] Discussed here: [LINK] — renox, 2016-08

Related videos