1 / 10

Overview

Overview. Efficient Parallel Algorithms COMP308. COMP 308 Exam. Time allowed : 2.5 hours Answer four questions (out of six).

wes
Download Presentation

Overview

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Overview Efficient Parallel Algorithms COMP308

  2. COMP 308 Exam • Time allowed : 2.5 hours • Answer four questions (out of six). • If you attempt to answer more questions than the required number of questions, the marks awarded for the excess questions will be discarded (starting with your lowest mark).

  3. What will be covered ? • Basics of parallel computing • PRAM algorithms • Basic parallel techniques • Tree algorithms • Graph algorithms • Sorting algorithms • Parallel Virtual Machine (PVM) • Communication operations • Class NC, P and P-complete problems

  4. 1. Basics of parallel computing • NC complexity class • Scalability of parallel systems • Metrics • Amdahl law • Optimality and efficiency of parallel algorithms • Coarse and fine grained computations • Models • PRAM model • EREW, CRCW, CREW, ERCW • MIMD, SISD, SIMD, MISD • Network topologies: • Ring, Mesh, Tree, Hypercube

  5. 2. PRAM algorithms • Finding minimum of n numbers • Sum of elements in an array • Computing of the first 1 in the sequence of 0’s and 1’s • NC sorting algorithm – merging sort • Simulation of CRCW algorithm by EREW model

  6. 3. Basic parallel techniques • Balanced binary tree technique • Doubling technique • Parallel divide and conquer • The Euler-tour technique

  7. 4. Tree and Graph algorithms • List ranking problem • Parallel prefix sum computation • Parallel algorithms for expression evaluation • Simultaneous Substitutions Method • A parallel pebble game • Parallel Computation of Transitive Closure Problem • Parallel construction of Euler cycles.

  8. 5. Sorting algorithms • Mesh connected networks. • Sorting on 1-dim mesh • Sorting on 2-dim mesh • Comparison networks • The zero-one principle • Bitonic and Merging sorting networks • Batcher’s merging network

  9. 6. Parallel Virtual Machine (PVM) • Basics of Message-Passing Programming • Broadcast • Scatter • Gather • Reduce

  10. 7. Communication operations • Store and forward routing • Cut-through routing • Broadcasting problem • Broadcast on ring • Broadcast on mesh • Broadcast on tree • Broadcast on hypercube • Gossiping problem • Gossiping on ring • Gossiping on mesh • Gossiping on hypercube

More Related