Introduction to Concurrent Algorithms with Grand Central Dispatch
summary
Using Grand Central Dispatch (GCD) and Swift, the talk explains how to parallelize basic algorithms like sorting and searching to better utilize multi‑core iOS devices. It covers practical techniques for implementing concurrent versions of these algorithms with GCD to take advantage of increasing core counts on iPhones.
AI-written summary · about
chapters (12)
- 0:00Introduction
- 0:48About Data: Tweeting with Hashtags
- 3:15What Are Concurrent Algorithms?
- 12:45Benchmarking Heavy Processing
- 15:23Summary So Far
- 17:50The QuickSort Algorithm
- 19:27Tasks That Can Be Parallelized
- 21:30Serial QuickSort Implementation
- 22:59Parallelizing with DispatchQueue
- 26:57Why Isn’t It Faster?
- 33:14What Exactly Is Overhead?
- 38:44How to Work with Concurrent Algorithms
related talks
39mGrand Central Dispatch (GCD), How Yelp uses GCD
45mThreads, Queues, and Things to Come: Present and Future of Concurrency in Swift
35mThe Multi-Threaded Asynchronous Parallel World of Swift
29mComparative Asynchronous Programming
36mCombining Combine and Swift Concurrency
26mSwift Concurrency Under the Hood
38mReactive Swift Concurrency
30mA Practical Guide to Swift Concurrency