PPT-Lecture 18 SORTING in Hardware

Lecture 18 SORTING in Hardware SSEG GPO2 Sorting Switches LED Buttons GPI2 Sorting Required I nterface Sort Clock R eset n DataIn N DataOut N Done RAdd L WrInit S 0initialization 1computations. 1 Overview In this lecture we discuss the notion of lower bounds in particular for the problem of sorting We show that any deterministic comparisonbased sorting algo rithm must take 8486 log time to sort an array of elements in the worst case We th 1 Overview In this lecture we discuss the notion of lower bounds in particular for the problem of sorting We show that any deterministic comparisonbased sorting algo rithm must take 8486 log time to sort an array of elements in the worst case We th Insertion Sort. Insertion Sort. Sorting problem:. Given an array of N integers, rearrange them so that they are in increasing order.. Insertion sort. Brute-force sorting solution.. In each iteration . P. arallel Sorting. Shantanu. . Dutt. ECE Dept.. UIC. Acknowledgement. Adapted from Chapter 9 slides of the text, by A. . Grama. w/ a few changes, augmentations and corrections. Topic Overview . Issues in Sorting on Parallel Computers . . waste. Sorting. line. Plastics. Yellow. . dustbin. Pet. . bottles. , . hollow. . wraps. , . foils. Ferry. , . sorting. , . pressing. No: linoleum . and. . floor. . coverings. , . wraps. . with. Summary, Anti-summary, and . Final . T. houghts. Summary (1) Architecture. Modern architecture designs are driven by energy constraints. Shortening latencies is too costly, so we use parallelism in hardware to increase potential throughput. Keyang. He. Discrete Mathematics. Basic Concepts. Algorithm . – . a . specific set of instructions for carrying out a procedure or solving a problem, usually with the requirement that the procedure terminate at some point. 6.1 Bits and digits Extracting bits is easy in C 6.2 Extracting digits with macros Ex: Single-byte access: bitsbyte = 8 x = 0X61626364Single-bit access: bitsbyte = 1 digit(x, 11) Insertion Sort. Insertion Sort. Start with empty left hand, cards in pile on table.. Take first card from pile, put in left hand.. Take next card from pile, insert in proper place among cards in left hand.. Chapter 14. Selection. . Sort. A . sorting algorithm rearranges the elements of a collection so that they are stored . in . sorted order. . Selection sort sorts an array by repeatedly. . finding. Mathematical Definition. Types of Sorting Algorithms. Permutation Sort. Cost of Sorting Algorithms. 2 Main Sorting Functions. Simple Sorts. Insertion. Bubble. Selection. Insertion Sort: Example. Insertion Sort: Example. Bubble Sort . of an array. Inefficient --- . O ( N. 2. ). easy to code. , . hence unlikely to contain errors. Algorithm. for . outerloop. = 1 to N. for . innerloop. = 0 to N-2. if ( item[. In this lesson, we will:. Describe sorting algorithms. Given an overview of existing algorithms. Describe the sorting algorithms we will learn. Sorting. Given an array that has arbitrary entries, . int array[10]{82, 25, 32, 85, 16, 36, 40, 4, 28, . David Woodruff. Carnegie Mellon University. Theme: Tight Upper and Lower Bounds. Number of comparisons to sort an array. Number of exchanges to sort an array. Number of comparisons needed to find the largest and second-largest elements in an array.