It's simply a place for algorithms to live. A list of algorithms in this project is provided below.
The project also includes tests and micro benchmarks for comparisons.
A generic implementation of mergesort algorithm in Java to sort data in a single machine, with multiple threads and in a distributed environment (TODO).
ParallelMergesort is an attempt to improve the default Java's Timsort by parallelizing the sort tasks in a multi-core machine. Currently, the algorithm improves the default Java 7's sort performance by 50% on a Quad core CPU using 8 threads. See more info in this blog
A comprehensive list of benchmarks and the results is provided below. All the benchmarks are done on a Macbook Pro (Retina, 15-inch, late 2013) using JMH v1.11.3.
| Component | Detail |
|---|---|
| Processor | 2.3 GHz Intel Core i7 |
| Memory | 8x2 GB 1600 Mhz DDR3 |
| Graphics | Intel Iris Pro 1536 MB |
| OS Version | OS X 10.9.5 |
| Storage | 251 GB Flash Storage |
The latest result of all the benchmarks is summarized in this [table] (benchmark/result/all.csv)