Upgrade to Pro
— share decks privately, control downloads, hide ads and more …
Speaker Deck
Sign up for free
Menu
Search
Features
All features
Private URLs
Password Protection
Custom URLS
Scheduled publishing
Remove Branding
Restrict embedding
Deck Collections
Notes
Features
All features
Private URLs
Password Protection
Custom URLS
Scheduled publishing
Remove Branding
Restrict embedding
Deck Collections
Notes
Explore
Featured decks
Featured speakers
Programming
Technology
Storyboards
Explore
Featured decks
Featured speakers
Programming
Technology
Storyboards
Pricing
Search
Sign in
Sign up for free
Parallele Programmierung (DE)
Search
Sponsored
·
SiteGround - Reliable hosting with speed, security, and support you can count on.
→
Chris Eidhof | @chriseidhof
September 11, 2013
Technology
170
2
Share
Embed
Copy iframe code
Copy JS code
Copy link
Start on current slide
Parallele Programmierung (DE)
Bei CocoaHeads Dresden
Chris Eidhof | @chriseidhof
September 11, 2013
More Decks by Chris Eidhof | @chriseidhof
See All by Chris Eidhof | @chriseidhof
Dutch FP Day 2015
chriseidhof
2
410
Tiny Networking in Swift
chriseidhof
2
19k
Functional Swift - Brooklyn
chriseidhof
3
1.3k
Functional Swift - SF
chriseidhof
6
26k
Functional Swift
chriseidhof
6
1.3k
Functional Swift
chriseidhof
1
180
Functional Programming in Swift
chriseidhof
40
19k
Lighter View Controllers
chriseidhof
4
220
Parsing with Blocks
chriseidhof
2
270
Other Decks in Technology
See All in Technology
WasmをRustにする
sansantech
PRO
0
250
PagerDuty Tech Hub-鳴らすけれど、人は動かない
ezaki
0
170
Getting Started with Google Antigravity
glaforge
0
300
SAENM ~Jupyterで残すPoCの試行錯誤、未来の自分と仲間を助ける記録!~
terapyon
0
110
UniFi(ユニファイ)AIカメラの現場活用
ludicmind
1
440
⾮構造化データを価値に変える AI エージェント基盤とその組織
ivry_presentationmaterials
0
190
子育てエンジニアの可処分時間が減っても成長を諦めない戦い方
sudoakiy
6
4.6k
DevelopersIO 2026 知識の地図を描く ─ オントロジーとは何か?
ishikawa_satoru
1
1.7k
20261017福岡devIO 「AIは"良いダッシュボード"を作れるか?
jtakeda
0
140
Rust で関数型ドメインモデリング
takonda
0
140
Temporal 最高!でも改めて「日付」について調べたら人類の負債すぎる件
riyaamemiya
0
140
エンタメ企業のM&Aを支えるデータ基盤 ― 統合から店舗のリアルタイム分析まで / Data Engineering Summit 2026
genda
0
170
Featured
See All Featured
[SF Ruby Conf 2025] Rails X
palkan
3
1.5k
How to build a perfect <img>
jonoalderson
1
6.1k
Java REST API Framework Comparison - PWX 2021
mraible
34
9.8k
Save Time (by Creating Custom Rails Generators)
garrettdimon
PRO
33
5.2k
Accessibility Awareness
sabderemane
1
250
I Don’t Have Time: Getting Over the Fear to Launch Your Podcast
jcasabona
35
2.9k
世界の人気アプリ100個を分析して見えたペイウォール設計の心得
akihiro_kokubo
PRO
74
43k
A better future with KSS
kneath
240
18k
Performance Is Good for Brains [We Love Speed 2024]
tammyeverts
12
1.9k
Ten Tips & Tricks for a 🌱 transition
stuffmc
1
270
DBのスキルで生き残る技術 - AI時代におけるテーブル設計の勘所
soudai
PRO
68
58k
Have SEOs Ruined the Internet? - User Awareness of SEO in 2025
akashhashmi
0
520
Transcript
Parallele Programmierung Chris Eidhof Sunday, September 22, 13
Achtung Sunday, September 22, 13
Nicht alles muss async sein • Schwer zu debuggen •
Schwer zu lesen und schreiben • Fehleranfällig Sunday, September 22, 13
APIs • OpenCL • pthread • NSRunLoop • NSThread •
Grand Central Dispatch • Operation Queues Sunday, September 22, 13
pthread size_t count; }; struct threadResult { uint32_t min; uint32_t
max; }; void * findMinAndMax(void *arg) { struct threadInfo const * const info = (struct threadInfo *) arg; uint32_t min = UINT32_MAX; uint32_t max = 0; for (size_t i = 0; i < info->count; ++i) { uint32_t v = info->inputValues[i]; min = MIN(min, v); max = MAX(max, v); } free(arg); struct threadResult * const result = (struct threadResult *) malloc(sizeof(*result)); result->min = min; result->max = max; return result; } int main(int argc, const char * argv[]) { size_t const count = 1000000; uint32_t inputValues[count]; // Fill input values with random numbers: for (size_t i = 0; i < count; ++i) { inputValues[i] = arc4random(); } // Spawn 4 threads to find the minimum and maximum: size_t const threadCount = 4; pthread_t tid[threadCount]; for (size_t i = 0; i < threadCount; ++i) { struct threadInfo * const info = (struct threadInfo *) malloc(sizeof(*info)); size_t offset = (count / threadCount) * i; info->inputValues = inputValues + offset; info->count = MIN(count - offset, count / threadCount); int err = pthread_create(tid + i, NULL, &findMinAndMax, info); NSCAssert(err == 0, @"pthread_create() failed: %d", err); } // Wait for the threads to exit: struct threadResult * results[threadCount]; for (size_t i = 0; i < threadCount; ++i) { int err = pthread_join(tid[i], (void **) &(results[i])); NSCAssert(err == 0, @"pthread_join() failed: %d", err); } // Find the min and max: uint32_t min = UINT32_MAX; uint32_t max = 0; for (size_t i = 0; i < threadCount; ++i) { Sunday, September 22, 13
NSRunloop [self performSelector:@selector(mySelector:) withObject:nil afterDelay:1.0]; Sunday, September 22, 13
@interface FindMinMaxThread : NSThread @property (nonatomic) NSUInteger min; @property (nonatomic)
NSUInteger max; - (instancetype)initWithNumbers:(NSArray *)numbers; @end @implementation FindMinMaxThread { NSArray *_numbers; } - (instancetype)initWithNumbers:(NSArray *)numbers { self = [super init]; if (self) { _numbers = numbers; } return self; } - (void)main { NSUInteger min; NSUInteger max; // process the data self.min = min; self.max = max; } @end NSSet *threads = [NSMutableSet set]; NSUInteger numberCount = self.numbers.count; NSUInteger threadCount = 4; for (NSUInteger i = 0; i < threadCount; i++) { NSUInteger offset = (count / threadCount) * i; NSUInteger count = MIN(numberCount - offset, numberCount / threadCount); NSRange range = NSMakeRange(offset, count); NSArray *subset = [self.numbers subarrayWithRange:range]; FindMinMaxThread *thread = [[FindMinMaxThread alloc] initWithNumbers:subset]; [threads addObject:thread]; [thread start]; } NSThread Sunday, September 22, 13
Wie viele Threads brauchen wir? Sunday, September 22, 13
Grand Central Dispatch Sunday, September 22, 13
Sunday, September 22, 13
Sunday, September 22, 13
Sunday, September 22, 13
Parallel Seriell Sunday, September 22, 13
Prioritätsinversion R N H M Sunday, September 22, 13
Async Blocks dispatch_queue_t defaultQueue = dispatch_get_global_queue(DISPATCH_QUEUE_PRIORITY_DEFAULT, 0); dispatch_async(defaultQueue, ^{ [self
expensiveBackgroundCode]; }); Sunday, September 22, 13
UI Aktualisieren dispatch_queue_t defaultQueue = dispatch_get_global_queue(DISPATCH_QUEUE_PRIORITY_DEFAULT, 0); dispatch_async(defaultQueue, ^{ [self
expensiveBackgroundCode]; dispatch_async(dispatch_get_main_queue(), ^{ self.label.text = @"Done"; }); }); Sunday, September 22, 13
Mein Code: dispatch_async(backgroundQueue, ^{ NSData* contents = [NSData dataWithContentsOfURL:url]; dispatch_async(dispatch_get_main_queue(),
^{ // do something with the data. }); }); Sunday, September 22, 13
Probleme • Nicht abbrechbar • Blockierend Sunday, September 22, 13
NSOperationQueue NSOperationQueue* backgroundQueue; [backgroundQueue addOperation:downloadOperation]; Sunday, September 22, 13
Abbrechen [downloadOperation cancel]; Sunday, September 22, 13
Blocks [backgroundQueue addOperationWithBlock:^{ [self expensiveOperation]; }]; Sunday, September 22, 13
Eigene Operations @interface DownloadOperation : NSOperation @end Sunday, September 22,
13
Weitere Aspekte • Abhängigkeiten • maxConcurrentOperationCount • Auf Grand Central
Dispatch basiert Sunday, September 22, 13
Unterklassen • NSInvocationOperation • NSBlockOperation Sunday, September 22, 13
Async Core Data Am einfachsten: über den Haupt-Thread Sunday, September
22, 13
NSManagedObjectContext* context = [[NSManagedObjectContext alloc] initWithConcurrencyType: NSPrivateQueueConcurrencyType]; context.persistentStoreCoordinator = self.persistentStoreCoordinator;
Sunday, September 22, 13
[context performBlock:^{ [self expensiveImportOperation]; }]; Sunday, September 22, 13
Main context aktualisieren [[NSNotificationCenter defaultCenter] addObserverForName:NSManagedObjectContextDidSaveNotification object:nil queue:nil usingBlock:^(NSNotification* note)
{ NSManagedObjectContext *moc = mainManagedObjectContext; if (note.object != moc) { [moc performBlock:^(){ [moc mergeChangesFromContextDidSaveNotification:note]; }]; } }]; Sunday, September 22, 13
Es gibt noch immer ein Lock Du kannst aber zwei
Persistent Store Coordinators verwenden Sunday, September 22, 13
UI im Hintergrund [operationQueue addOperationWithBlock:^{ NSNumber* result = findLargestMersennePrime(); [[NSOperationQueue
mainQueue] addOperationWithBlock:^{ self.textLabel.text = [result stringValue]; }]; }]; Sunday, September 22, 13
UIKit ist nicht Threadsicher Sunday, September 22, 13
Parallel zeichnen UIGraphicsBeginImageContextWithOptions(size, NO, 0); // drawing code here UIImage
*i = UIGraphicsGetImageFromCurrentImageContext(); UIGraphicsEndImageContext(); return i; Sunday, September 22, 13
Parallel zeichnen • Nur wenn es notwendig ist • Vielleicht
kannst du es vermeiden • WWDC 2012 - Building Concurrent User Interfaces on iOS Sunday, September 22, 13
More reading • http://www.objc.io/issue-2 • Concurrency Programming Guide Sunday, September
22, 13
Kontakt @chriseidhof http://www.objc.io http://www.uikonf.com http://chris.eidhof.nl Sunday, September 22, 13