diff options
| author | tivrfoa <lescoutinhovr@gmail.com> | 2024-01-29 17:24:04 -0300 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2024-01-29 21:24:04 +0100 |
| commit | f4a0039a591fc7c02306af5fc7a8fbca8a292668 (patch) | |
| tree | fdbf9ed5eaa38a6e8c4998d8d1301538cec73ad6 /calculate_average_phd3.sh | |
| parent | 8e407ca79dc9c2f51b096f95687306103258bf75 (diff) | |
Try more chunks than threads, and of different sizes (#644)
/**
* Solution based on thomaswue solution, commit:
* commit d0a28599c293d3afe3291fc3cf169a7b25ae9ae6
* Author: Thomas Wuerthinger
* Date: Sun Jan 21 20:13:48 2024 +0100
*
* The goal here was to try to improve the runtime of his 10k
* solution of: 00:04.516
*
* With Thomas latest changes, his time is probably much better
* already, and maybe even 1st place for the 10k too.
* See: https://github.com/gunnarmorling/1brc/pull/606
*
* But as I was already coding something, I'll submit just to
* see if it will be faster than his *previous* 10k time of
* 00:04.516
*
* Changes:
* It's a similar idea of my previous solution, that if you split
* the chunks evenly, some threads might finish much faster and
* stay idle, so:
* 1) Create more chunks than threads, so the ones that finish first
* can do something;
* 2) Decrease chunk sizes as we get closer to the end of the file.
*/
Diffstat (limited to 'calculate_average_phd3.sh')
0 files changed, 0 insertions, 0 deletions
