[MINI] Parallel Algorithms episode artwork

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.

Episode metadata supplied by the publisher feed · Published Dec 8, 2017

Embed this episode

Ready to play

[MINI] Parallel Algorithms

0:00 20:37

No transcript for this episode yet

We transcribe on demand. Request one and we'll notify you when it's ready — usually under 10 minutes.

No similar episodes found.

Frequently Asked Questions

How long is this episode of Data Skeptic?

This episode is 20 minutes long.

When was this Data Skeptic episode published?

This episode was published on December 8, 2017.

Can I download this Data Skeptic episode?

Yes. Use the download control on the episode player to save the publisher-provided media file.
URL copied to clipboard!