EPISODE · Dec 8, 2017 · 20 MIN
[MINI] Parallel Algorithms
from Data Skeptic · host Kyle Polich and Linhda Tran
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.
NOW PLAYING
[MINI] Parallel Algorithms
No transcript for this episode yet
Similar Episodes
May 11, 2026 ·66m
May 11, 2026 ·67m
May 5, 2026 ·4m
May 4, 2026 ·4m