1 / 10

# Overview - PowerPoint PPT Presentation

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

I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.

## PowerPoint Slideshow about 'Overview' - wes

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.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.

- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript

### Overview

Efficient Parallel Algorithms

COMP308

• 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).

• 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

• 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

• 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

• Balanced binary tree technique

• Doubling technique

• Parallel divide and conquer

• The Euler-tour technique

• 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.

• 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

• Basics of Message-Passing Programming

• Scatter

• Gather

• Reduce

• Store and forward routing

• Cut-through routing