diff options
| author | tivrfoa <lescoutinhovr@gmail.com> | 2024-01-27 15:41:00 -0300 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-01-27 19:41:00 +0100 |
| commit | d9604d9258ce29d955d89ce3f6d72dfd5119a42a (patch) | |
| tree | 1d05054959a84e020f3c616f728a9dd465043f25 /src/main/java/dev/morling/onebrc/CalculateAverage_unbounded.java | |
| parent | a304f80710940fca3b283e9816b92c46986871d0 (diff) | |
Use LinkedBlockingQueue to process results - based on thomaswue (#603)
/**
* Solution based on thomaswue solution, commit:
* commit d0a28599c293d3afe3291fc3cf169a7b25ae9ae6
* Author: Thomas Wuerthinger <thomas.wuerthinger@oracle.com>
* Date: Sun Jan 21 20:13:48 2024 +0100
*
* Changes:
* 1) Use LinkedBlockingQueue to store partial results, that
* will then be merged into the final map later.
* As different chunks finish at different times, this allows
* to process them as they finish, instead of joining the
* threads sequentially.
* This change seems more useful for the 10k dataset, as the
* runtime difference of each chunk is greater.
* 2) Use only 4 threads if the file is >= 14GB.
* This showed much better results on my local test, but I only
* run with 200 million rows (because of limited RAM), and I have
* no idea how it will perform on the 1brc HW.
*/
Diffstat (limited to 'src/main/java/dev/morling/onebrc/CalculateAverage_unbounded.java')
0 files changed, 0 insertions, 0 deletions