Sorting Networks Part 1 - Intro to Parallel Programming

preview_player
Показать описание
  1. Udacity
  2. parallel programming
  3. cuda
  4. GPUs
  5. GPU programming
  6. parallel algorithms
Рекомендации по теме
Sorting Networks Part 0:06:01

Sorting Networks Part 1 - Intro to Parallel Programming

Sorting Networks Explained 0:17:47

Sorting Networks Explained

Sorting Networks - 0:00:15

Sorting Networks - Intro to Parallel Programming

Sorting Networks Part 0:01:21

Sorting Networks Part 2 - Intro to Parallel Programming

Sorting Networks Part 0:00:31

Sorting Networks Part 2 - Intro to Parallel Programming

Sorting networks 0:24:26

Sorting networks

Constant-depth sorting networks 0:45:14

Constant-depth sorting networks

Sorting Network Assignment 0:00:53

Sorting Network Assignment 1

Bitonic sorting network 0:06:56

Bitonic sorting network example 1

Sorting Networks 0:24:18

Sorting Networks

sorting network 0:00:07

sorting network

Sorting Networks - 0:05:03

Sorting Networks - Friday Minis 182

CS Unplugged - 0:04:41

CS Unplugged - Sorting networks (sample classroom lesson)

A&DS S01E04. Lower 1:44:32

A&DS S01E04. Lower bounds for sorting. Radix sort. Sorting networks

Monotonic Differentiable Sorting 0:08:25

Monotonic Differentiable Sorting Networks for Learning to Rank (diffsort)

Explaining EVERY Sorting 0:35:35

Explaining EVERY Sorting Algorithm (part 1)

Sorting Network Activity 0:08:15

Sorting Network Activity

Image Sorting: Exchange 0:00:07

Image Sorting: Exchange Sort

Cartoon Network Characters 0:02:32

Cartoon Network Characters Get Sorted into Their Hogwarts House | Cartoon Network

Visualizing 70 Sorting 0:29:24

Visualizing 70 Sorting Algorithms

Improved Visualization of 0:00:26

Improved Visualization of Parallelized Bitonic Sort (seizure warning!)

Sorting Network Introduction 0:18:42

Sorting Network Introduction

Parallel sorting networks 0:00:09

Parallel sorting networks enumeration sort algorithm and diagram of typically sorting network parall

Intro to Wireshark 0:02:25

Intro to Wireshark 1-6: Sorting Data

Комментарии
Автор

Assuming that swapping two values takes some additional time, I'd say the answer is C<D <B<A. The number of comparisons is the same in all cases, but with C we have to swap basically everything and with A we don't have to swap anything at all. Let me know if I'm right :)

TheDarkever
Автор

:)
1) list merging - Try look on INPUT as sorted list with one number. 8 numbers = 8 sorted list with 1 number. Merge sorted list 1-1 (forst with first in listA, in listB) to new array. 1-1, 1-1, 1-1, 1-1 = 2-2, 2-2 = 4-4 = sorted = 7 compares, can do paralel
2) list merging - [1], when you find sorted list ASC and DESC ordered. Merge sorted list
3) insert middle - insert sort, when compare middle of sorted subarray (noc can use paralel, but do lowest comparations)

petermlich
Автор

Great video. Explains it very clearly.

xCAFEFD
Автор

Sounds like Jordan Peterson doing computer science 🙃 .... "If the network isn't sorting, you're not trying hard enough. Sorting is hard. Deal with it."

firosuke
Автор

Awesome, learnt a lot about sorting networks from this paper.

dreamscapeai
Автор

Good video, i understood very step, i will program this algorithm in CUDA, sorry my bad English

Arnoldo
Автор

Doesn't this still require control flow changes? Gpus might be parallel power houses but if the codepaths diverge often it will slow it down by orders of magnitude. And of course it would be a synchronization nightmare on multicore cpus...

tacchinotacchi
Автор

Do you mean that sorting networks can't sort a non bitonic sequence?

davenirline