Bucket sort, also known as bin sort, is a distribution sort that works by arranging elements into several ‘buckets’ which are then sorted using another sort, typically insertion sort, and merged into a sorted list.
This project improves the Bucket Sort algorithm with a full implementation of the Thread and Locks algorithm.
Statistics of the Thread and Lock algorithm on different input sizes and cores are collected, analyzed and discussed. Bottlenecks are identified and explained.
Applicable concurrent data structures have been tested and experiments with task granularity and problem decomposition support the claim for an (near) optimal implementation.
This project is created and maintained by:
- Rafael Lobato
- Chris Verra