Scribd
Upload
136 views1 page

(Tcs-023) Parallel Algorithms: Unit-I

This document outlines the units of study for a course on parallel algorithms. The units cover parallel computational models, performance measures of parallel algorithms, parallel sorting and searching algorithms, graph algorithms, and combinatorial algorithms. Some specific topics mentioned include PRAM, hypercube, and butterfly models, speedup and efficiency measures, parallel merging and sorting networks, parallel matrix operations, and algorithms for permutations, combinations and derangements. Recommended textbooks are also listed.

Uploaded by

Ranjeet Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
136 views1 page

(Tcs-023) Parallel Algorithms: Unit-I

This document outlines the units of study for a course on parallel algorithms. The units cover parallel computational models, performance measures of parallel algorithms, parallel sorting and searching algorithms, graph algorithms, and combinatorial algorithms. Some specific topics mentioned include PRAM, hypercube, and butterfly models, speedup and efficiency measures, parallel merging and sorting networks, parallel matrix operations, and algorithms for permutations, combinations and derangements. Recommended textbooks are also listed.

Uploaded by

Ranjeet Singh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

(TCS-023) PARALLEL ALGORITHMS

Unit-I:
Sequential model, need of alternative model, parallel computational models such as
PRAM, LMCC, Hypercube, Cube Connected Cycle, Butterfly, Perfect Shuffle
Computers, Tree model, Pyramid model, Fully Connected model, PRAM-CREW, EREW
models, simulation of one model from another one.

Unit-II:
Performance Measures of Parallel Algorithms, speed-up and efficiency of PA, Costoptimality,
An example of illustrate Cost-optimal algorithms- such as summation,
Min/Max on various models.

Unit-III:
Parallel Sorting Networks, Parallel Merging Algorithms on CREW/EREW/MCC/,
Parallel Sorting Networks on CREW/EREW/MCC/, linear array

Unit-IV:
Parallel Searching Algorithm, Kth element, Kth element in X+Y on PRAM, Parallel
Matrix Transportation and Multiplication Algorithm on PRAM, MCC, Vector-Matrix
Multiplication, Solution of Linear Equation, Root finding.

Unit-V:
Graph Algorithms - Connected Graphs, search and traversal, Combinatorial AlgorithmsPermutation, Combinations, Derrangements.

Books:
1. M.J. Quinn, Designing Efficient Algorithms for Parallel Computer by Mc Graw
Hill.
2. S.G. Akl, Design and Analysis of Parallel Algorithms
3. S.G. Akl, Parallel Sorting Algorithm by Academic Press

You might also like