Skip to content

README.md

Latest commit

 

History

History
11 lines (9 loc) · 937 Bytes

README.md

File metadata and controls

11 lines (9 loc) · 937 Bytes

Concurrent Programming

Potential for multiple operations to run at the same time (parallelism), but doesn't mean it will. Concurrency ≠ Parallelism

Table on Contents

  1. Sorting Unique Integers - Using mergesort and quicksort (serial)
  2. Merge Sort with Fork/Join and Bucket Sort using locks - Using parallelism, mergesort with fork/join and bucketsort with locks
  3. Locking Algorithms - Multithreading on an atomic global counter and bucket sorting using various barrier and locking methods
  4. OpenMP - Parallel merge sorting using the application programming interface OpenMP (Open Multi-Processing)
  5. Concurrent Containers - Various multi-threaded stack (S) and queue (Q) algorithms such as Treiber (S), Michael & Scott (Q), Single Global Lock (S & Q), Baskets (Q), and an attempt at Elimination (S)