This repository consists of programs that implement Parallel Computing Algorithms as a part of my coursework.
All the algorithms have been implemented in Java
To get an insight into how the algorithms work please refer to the book I followed
- M.J. Quinn- Parallel Computing – Theory and Practice
The following is the list of algorithms implemented
- Enumeration Sort
- Graph Coloring
- Parallel Merge Sort
- Finding Prime Numbers using Sieve of Eratosthenes
- Prefix Sum
- List Ranking