
13: Parallele Algorithmen, Vorlesung, WS 2017/18, 29.01.2018
Author
Editor
Participating institute
Institut für Theoretische Informatik (ITI)
Genre
Description
- 0:00:00 Starten
- 0:00:36 Was wissen wir über die Jobs?
- 0:02:32 Was wissen wir über die Prozessoren?
- 0:05:44 Zufälliges Zuordnen
- 0:07:08 Work Stealing
- 0:10:58 Backtracking over Transition Functions
- 0:12:02 An Abstract Model: Tree Shaped Computations
- 0:17:37 Splitting Stacks
- 0:21:27 Other Problem Categories
- 0:27:01 Limits of the Model
- 0:29:35 Receiver Initiated Load Balancing
- 0:31:40 Random Polling
- 0:41:11 Synchronous Random Polling
- 0:45:21 Analysis
- 0:51:22 Bounding Idleness
- 0:57:08 A Simplified Algorithm
- 1:03:22 Many Consecutive Splits
- 1:05:49 Many Processors
- 1:09:03 Superliner Speedup
- 1:15:12 Static vs Dynamic LB
- 1:18:35 MapReduce in 10 Minutes
Duration (hh:mm:ss)
01:26:31
Series
Parallele Algorithmen, Vorlesung, WS 2017/18
Published on
01.02.2018
Subject area
License
Resolution | 1280 x 720 Pixel |
Aspect ratio | 16:9 |
Audio bitrate | 128000 bps |
Audio channels | 2 |
Audio Codec | aac |
Audio Sample Rate | 48000 Hz |
Total Bitrate | 933628 bps |
Color Space | yuv420p |
Container | mov,mp4,m4a,3gp,3g2,mj2 |
Media Type | video/mp4 |
Duration | 5191 s |
Filename | DIVA-2018-129_hd.mp4 |
File Size | 605.759.964 byte |
Frame Rate | 25 |
Video Bitrate | 799533 bps |
Video Codec | h264 |
Media URL
Embed Code
Parallele Algorithmen, Vorlesung, WS 2017/18
Episodes 1-13
of 13