All Episodes

March 3, 2023 30 mins
System design from the frontlines. When you are in a tiny startup, how do you structure things so that you have the maximum bang for the smallest buck? The easiest way is to try to linearize what you are doing so that you have a set of discrete pipeline parts that are fed by files. That way you turn a complex O(n^2) problem where complexity goes up by the square of the number of modules, to O(n) where adding one more module depends just on another component input. It's way easier to wire up. Plus if you have n developers, you minimize dependencies and can literally do things as fast as the slowest pipeline. Works in the real world too! And with larger companies. For you video watchers, apologies for the choppiness of the video, we are still learning how to make the chain work and will put in the show notes, but it looks like that default of creating a fabric that is 8Kx2K (way too big, but it covers all three screens) caused slow frame rates, but we've figure this out by shrinking the rates and using OBS > View > Stats to make sure the recording is working OK). Liner notes:  1. @deon@nerdculture.de's (yes that's a Mastodon address)'s first robot. https://slideplayer.com/slide/5672012/ where he made the PCB boards, and did all the programming by hand. Pretty amazing. 2. https://docs.google.com/presentation/d/18nxl0dtS_l0OgxKj0ZrGZlFyDzUVOLTXEpk3q89R3LI/edit#slide=id.gc6f59039d_0_0 for notes on system design and making it simple for startups, you can leave comments there. Or to @richtong@mastodon.social 3. What all this then about the O(n^2) notation, so a quick chat about complexity theory. That is an estimate of how much harder computation gets. If you have 2 things and go to 100, if the algorithm is order -N or O(N), then the time to compute goes from 2 to 100 or 50x. But if it is O(N^2), then it goes from 4 to 10,000 so you can see as you add more things, life gets very complicated. Similarly, O(1) means constant in time, so when you go from 2 to 100 pipelines, if the time to compute stays at 1. That is a very nice thing. It means it is maximally parallel. Life is never really like that, but it's a good goal.https://en.wikipedia.org/wiki/Computational_complexity See https://tongfamily.com for details
Mark as Played

Advertise With Us

Popular Podcasts

My Favorite Murder with Karen Kilgariff and Georgia Hardstark

My Favorite Murder with Karen Kilgariff and Georgia Hardstark

My Favorite Murder is a true crime comedy podcast hosted by Karen Kilgariff and Georgia Hardstark. Each week, Karen and Georgia share compelling true crimes and hometown stories from friends and listeners. Since MFM launched in January of 2016, Karen and Georgia have shared their lifelong interest in true crime and have covered stories of infamous serial killers like the Night Stalker, mysterious cold cases, captivating cults, incredible survivor stories and important events from history like the Tulsa race massacre of 1921. My Favorite Murder is part of the Exactly Right podcast network that provides a platform for bold, creative voices to bring to life provocative, entertaining and relatable stories for audiences everywhere. The Exactly Right roster of podcasts covers a variety of topics including historic true crime, comedic interviews and news, science, pop culture and more. Podcasts on the network include Buried Bones with Kate Winkler Dawson and Paul Holes, That's Messed Up: An SVU Podcast, This Podcast Will Kill You, Bananas and more.

24/7 News: The Latest

24/7 News: The Latest

The latest news in 4 minutes updated every hour, every day.

Dateline NBC

Dateline NBC

Current and classic episodes, featuring compelling true-crime mysteries, powerful documentaries and in-depth investigations. Follow now to get the latest episodes of Dateline NBC completely free, or subscribe to Dateline Premium for ad-free listening and exclusive bonus content: DatelinePremium.com

Music, radio and podcasts, all free. Listen online or download the iHeart App.

Connect

© 2025 iHeartMedia, Inc.