Presentation is loading. Please wait.

Presentation is loading. Please wait.

Lecture 4 Sorting Networks. Comparator comparator.

Published byRudolf Gray Modified over 8 years ago

Similar presentations

Presentation on theme: "Lecture 4 Sorting Networks. Comparator comparator."— Presentation transcript:

1 Lecture 4 Sorting Networks

2 Comparator comparator

3 A Sorting Network 9 5 2 6 5 9 2 6 2 5 6 9 2 5 6 9 A sorting network is a comparison network which output monotone nondecreasing sequence for every input.

4 Depth 9 5 2 6 5 9 2 6 2 5 6 9 2 5 6 9 Depth is the maximum number of comparators on a path from an input wire to an output wire.

5 Depth = parallel time 9 5 2 6 5 9 2 6 2 5 6 9 2 5 6 9 Depth is the maximum number of comparators on a path from an input wire to an output wire.

6 Insertion Sort

7 key

8 Sorting network constructed from insertion sort.

9 How to construct a sorting network from merging sort?

10 Divide and Conquer Divide the problem into subproblems. Conquer the subproblems by solving them recursively. Combine the solutions to subproblems into the solution for original problem.

11 Merge Sort

12 Procedure

13 Structure Sorting network Sorting network Merging network

14 Construction of Merging Network 0-1 principal. Bitonic sorter. Merging network.

15 0-1 principal

16 Lemma

17 Proof of 0-1 Principal

18 Bitonic Sequence

19 Bitonic 0-1 Sequence

20 Some Properties

21 The half-cleaner bitonic clean bitonic 0 0 0 0 1 0 1 1 0 0 1 1 1 0 0 0

22 The half-cleaner bitonic clean bitonic 0 0 1 0 1 1 1 1 0 0 1 1 1 1 1 0

23 Lemma (a)One of two halfs is bitonic clean. (b) every number in the 1 st half ≤ any element in the 2 nd half.

24 Proof (case 1) 1 0 0 1 0 0 1 0 0

25 Proof (case 2) 1 0 0 1 0 0 1 0 0

26 Proof (case 3) 1 0 0 1 0 0 1 0 0 1 1

27 Proof (case 4) 1 0 0 1 0 0 1 0 0 1 1

28 Proof (case 5) 1 0 0 1 0 1 1 1 1 1 1

29 Proof (case 6) 1 0 0 1 0 1 1 1 1 1 1

30 Proof (case 7) 1 0 0 1 0 1 1 1 1 0 0

31 Proof (case 8) 1 0 0 1 0 1 1 1 1 0 0

32 Half cleaners bitonicsorted

33 Half cleaners sorted 0 0 1 1 0 0 0 1 0 0 0 0 0 1 1 1 Merging Network

34 Structure Sorting network Sorting network Merging network

35 Merging Networks Sorting Network

36 What we learnt in this lecture? What is sorting network? Depth = parallel time. Sorting network from Merge sort.

37 Permutation Network Switching network Rearrangeability Nework with 2x2 crossbars

38 Crossbar Switch A crossbar switch can realize any matching between Inputs and outputs.

39 3-stage Clos Network 1 m n n n n

40 Rearrangeability Theorem

41 Network with 2x2 crossbars

42 Puzzle

Download ppt "Lecture 4 Sorting Networks. Comparator comparator."

Similar presentations

Back to Sorting – More efficient sorting algorithms.

Back to Sorting – More efficient sorting algorithms.
AVL Trees1 Part-F2 AVL Trees 6 3 8 4 v z. AVL Trees2 AVL Tree Definition (§ 9.2) AVL trees are balanced. An AVL Tree is a binary search tree such that.

AVL Trees1 Part-F2 AVL Trees v z. AVL Trees2 AVL Tree Definition (§ 9.2) AVL trees are balanced. An AVL Tree is a binary search tree such that.
Batcher’s merging network Efficient Parallel Algorithms COMP308.

Batcher’s merging network Efficient Parallel Algorithms COMP308.
Lecture 4 Divide and Conquer for Nearest Neighbor Problem

Lecture 4 Divide and Conquer for Nearest Neighbor Problem
1 Divide & Conquer Algorithms. 2 Recursion Review A function that calls itself either directly or indirectly through another function Recursive solutions.

1 Divide & Conquer Algorithms. 2 Recursion Review A function that calls itself either directly or indirectly through another function Recursive solutions.
1 Merge Sort Review of Sorting Merge Sort. 2 Sorting Algorithms Selection Sort uses a priority queue P implemented with an unsorted sequence: –Phase 1:

1 Merge Sort Review of Sorting Merge Sort. 2 Sorting Algorithms Selection Sort uses a priority queue P implemented with an unsorted sequence: –Phase 1:
Deterministic Selection and Sorting Prepared by John Reif, Ph.D. Analysis of Algorithms.

Deterministic Selection and Sorting Prepared by John Reif, Ph.D. Analysis of Algorithms.
CS223 Advanced Data Structures and Algorithms 1 Divide and Conquer Neil Tang 4/15/2010.

CS223 Advanced Data Structures and Algorithms 1 Divide and Conquer Neil Tang 4/15/2010.
Divide and Conquer Chapter 6. Divide and Conquer Paradigm Divide the problem into sub-problems of smaller sizes Conquer by recursively doing the same.

Divide and Conquer Chapter 6. Divide and Conquer Paradigm Divide the problem into sub-problems of smaller sizes Conquer by recursively doing the same.
Lecture 8 Jianjun Hu Department of Computer Science and Engineering University of South Carolina 2009.9. CSCE350 Algorithms and Data Structure.

Lecture 8 Jianjun Hu Department of Computer Science and Engineering University of South Carolina CSCE350 Algorithms and Data Structure.
1 Omega Network The omega network is another example of a banyan multistage interconnection network that can be used as a switch fabric The omega differs.

1 Omega Network The omega network is another example of a banyan multistage interconnection network that can be used as a switch fabric The omega differs.
Sorting. Input: A sequence of n numbers a 1, …, a n Output: A reordering a 1 ’, …, a n ’, such that a 1 ’ < … < a n ’ 14326816 23141668.

Sorting. Input: A sequence of n numbers a 1, …, a n Output: A reordering a 1 ’, …, a n ’, such that a 1 ’ < … < a n ’
Lecture 3 Nearest Neighbor Algorithms Shang-Hua Teng.

Lecture 3 Nearest Neighbor Algorithms Shang-Hua Teng.
Text Chapters 1, 2. Sorting ä Sorting Problem: ä Input: A sequence of n numbers ä Output: A permutation (reordering) of the input sequence such that:

Text Chapters 1, 2. Sorting ä Sorting Problem: ä Input: A sequence of n numbers ä Output: A permutation (reordering) of the input sequence such that:
Divide-and-Conquer1 7 2  9 4  2 4 7 9 7  2  2 79  4  4 9 7  72  29  94  4.

Divide-and-Conquer1 7 2  9 4   2  2 79  4   72  29  94  4.
UMass Lowell Computer Science 91.503 Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Lecture 9 Tuesday, 11/20/01 Parallel Algorithms Chapters 28,

UMass Lowell Computer Science Analysis of Algorithms Prof. Karen Daniels Fall, 2001 Lecture 9 Tuesday, 11/20/01 Parallel Algorithms Chapters 28,
Lecture 2: Divide and Conquer I: Merge-Sort and Master Theorem Shang-Hua Teng.

Lecture 2: Divide and Conquer I: Merge-Sort and Master Theorem Shang-Hua Teng.
CS 584. Sorting n One of the most common operations n Definition: –Arrange an unordered collection of elements into a monotonically increasing or decreasing.

CS 584. Sorting n One of the most common operations n Definition: –Arrange an unordered collection of elements into a monotonically increasing or decreasing.
Lecture 6 Divide and Conquer for Nearest Neighbor Problem Shang-Hua Teng.

Lecture 6 Divide and Conquer for Nearest Neighbor Problem Shang-Hua Teng.
CS 584. Sorting n One of the most common operations n Definition: –Arrange an unordered collection of elements into a monotonically increasing or decreasing.

CS 584. Sorting n One of the most common operations n Definition: –Arrange an unordered collection of elements into a monotonically increasing or decreasing.

Similar presentations

Ads by Google