This is a stress test of the maximum possible throughput of the HVM. It is a very simple program that just loops in a "best case" scenario: i.e., maximum parallelism, and maximum compiled speed (since it compiles to a C loop). I like it because it highlights each major generational breakthrough:
Ashton ashtonsix
ashtonsix
/ inat.ipynb
Created
April 14, 2018 11:46
iNat Challenge 2018 (markov clustering experiment)
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
ashtonsix
/ lending.ipynb
Created
April 14, 2018 11:56
Checking for lending bias in loan applications (cross-referencing census data & zip codes)
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
ashtonsix
/ mixed_lr.ipynb
Created
May 28, 2018 22:09
Loading
Sorry, something went wrong. Reload?
Sorry, we cannot display this file.
Sorry, this file is invalid so it cannot be displayed.
ashtonsix
/ hvm_pitch_benchmarks.md
Last active
November 28, 2024 04:17
— forked from VictorTaelin/hvm_pitch_benchmarks.md
HVM - Pitch Benchmarks