16 min listen
[MINI] Parallel Algorithms
FromData Skeptic
ratings:
Length:
21 minutes
Released:
Dec 8, 2017
Format:
Podcast episode
Description
When computers became commodity hardware and storage became incredibly cheap, we entered the era of so-call "big" data. Most definitions of big data will include something about not being able to process all the data on a single machine. Distributed computing is required for such large datasets. Getting an algorithm to run on data spread out over a variety of different machines introduced new challenges for designing large-scale systems. First, there are concerns about the best strategy for spreading that data over many machines in an orderly fashion. Resolving ambiguity or disagreements across sources is sometimes required. This episode discusses how such algorithms related to the complexity class NC.
Released:
Dec 8, 2017
Format:
Podcast episode
Titles in the series (100)
[MINI] Experimental Design: This episode loosely explores the topic of Experimental Design including hypothesis testing, the importance of statistical tests, and an everyday and business example. by Data Skeptic