Skip to content

hgrosser: hash-list optimized, minor improvements #122

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
merged 1 commit into from
Apr 24, 2024
Merged

hgrosser: hash-list optimized, minor improvements #122

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
15 changes: 9 additions & 6 deletions entries/hgrosser/README.md
View file
Open in desktop
Original file line number Diff line number Diff line change
Expand Up @@ -3,24 +3,26 @@
**1 billion row Challenge entry**

## Version
Version 1.51
Version 1.60

## How to compile
The program was developed with FPC 3.2.2 and Lazarus 2.2.4

There is a new Conditional "noCR" which is neccessary, if the input file has no CR's

## How to start
```
Usage: <path to input file> <bit-width for hash-list (14..28)>
Example: hgrosser measurements.txt 15
Usage: <path to input file> <bit-width for hash-list (16..28)>
Example: hgrosser measurements.txt 16
- bit-width for hash-list: sets the size of the hash list, e.g. '16' => 65536 entries
```
There are no switches like `-i` etc, only values.
There are no switches like `-i` etc, only 2 values.

### Optimizing the 2nd command line parameter

In theory the program should run faster with greater bit-widths for the hash-list (because of less collisions), but on my own computer (8 GB RAM) in praxis a small value of 15 is the fastest way, allthough this causes many collisions.
In theory the program should run faster with greater bit-widths for the hash-list (because of less collisions), but on my own computer (8 GB RAM) in praxis a small value of 16 is the fastest way, allthough this causes many collisions.

Please (if possible) try all values from 14 to 24 (maybe in a for-loop). Thanks a lot.
Please (if possible) try all values from 16 to 22 (maybe in a for-loop). Thanks a lot.

## How the program works
The Program works with 1 thread.
Expand All @@ -37,3 +39,4 @@ To speed things up:
- Version 1.00: initial version
- Version 1.50: hash-list optimized, small improvements in parsing the file
- Version 1.51: small improvements in asm function
- Version 1.60: hash-list optimized, some minor improvements, Conditional "noCR" added
Loading