Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

prateekroy/Parallel-Programming

Open more actions menu

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

2 Commits
2 Commits
 
 
 
 
 
 
 
 

Repository files navigation

Parallel-Programming

HW1 - Parallel Matrix Multiplication on Shared Memory + Job Schedulers Matrix Multiplication - Iterative - Recursive - Parallel Implementation - Cilk implementation

Scheduler - Work Steal Scheduler - Work Share Scheduler - Centralized Share Scheduler

Analysis of all approaches - Performance - Efficiency - l1, l2, l3 Cache Misses using PAPI

HW2 - Parallel Sorting (QuickSort , Radix Sort with Counting Sort) + Minimum Spanning Tree

  • Randomized QuickSort
  • Radix Sort with ranking by counting sort

Parallel MST by using

  • Radix Sort with ranking by counting sort
  • Binary Search

HW3 - Distributed Memory Matrix Multiplication (OpenMPI)

Morty Proxy This is a proxified and sanitized view of the page, visit original site.