Problem:
Given a list of posts, compute the top 5 related posts for each post based on the number of shared tags.
Steps:
- Read the posts JSON file.
- Iterate over the posts and populate a map containing:
tag -> List<int>, with the int representing the post index of each post with that tag.
- Iterate over the posts and for each post:
- Create a map:
PostIndex -> int to track the number of shared tags
- For each tag, Iterate over the posts that have that tag
- For each post, increment the shared tag count in the map.
- Sort the related posts by the number of shared tags.
- Write the top 5 related posts for each post to a new JSON file.
Run Benchmark
./run.sh go | rust | python | all
Rules
No:
- FFI (including assembly inlining)
- Unsafe code blocks
- Custom benchmarking
- Disabling runtime checks (bounds etc)
Must:
- Parse json at runtime
- Not hardcore number of posts
- Support up to 100 tags
- Use a stable release of the compiler/runtime
Updated Results from github workflow (raw data)
| Language |
Processing Time |
Total (PT + I/O) |
| Rust |
28.24 ms |
47.7 ms |
| Go |
30.91 ms |
62.8 ms |
| Java (GraalVM) |
35.46 ms |
64.4 ms |
| Zig |
38.00 ms |
79.9 ms |
| Fsharp |
48.29 ms |
866.5 ms |
| Crystal |
56.21 ms |
112.6 ms |
| Vlang |
59.84 ms |
385.7 ms |
| Odin |
63.49 ms |
311.8 ms |
| Swift |
65.73 ms |
444.5 ms |
| Nim |
91.58 ms |
121.1 ms |
| Dart VM |
103.63 ms |
590.9 ms |
| LuaJIT |
120.37 ms |
418.6 ms |
| Dart AOT |
141.50 ms |
285.8 ms |
| JS (Deno) |
183.20 ms |
276.7 ms |
| JS (Node) |
201.80 ms |
277.2 ms |
| Java (JIT) |
265.15 ms |
551.2 ms |
| Numpy |
0.40 s |
634.0 ms |
| Julia v2 |
648.83 ms |
5.130 s |
| JS (Bun) |
711.40 ms |
787.3 ms |
| Lua |
2373.13 ms |
3.048 s |
| Python |
2.69 s |
2.775 s |
Multicore Results
| Language |
Processing Time |
Total (PT + I/O) |
| Go Concurrent |
16.71 ms |
50.8 ms |
| Rust Concurrent |
20.61 ms |
41.8 ms |
| Swift Concurrent |
40.75 ms |
428.3 ms |
| Fsharp Concurrent |
45.00 ms |
868.0 ms |
Old Results with details (on my machine)
| Language |
Processing Time |
Total (+ I/O) |
Details |
| Rust |
- |
4.5s |
Initial |
| Rust v2 |
- |
2.60s |
Replace std HashMap with fxHashMap by phazer99 |
| Rust v3 |
- |
1.28s |
Preallocate and reuse map and unstable sort by vdrmn and Darksonn |
| Rust v4 |
- |
0.13s |
Use Post index as key instead of Pointer and Binary Heap by RB5009 |
| Rust v5 |
38ms |
52ms |
Rm hashing from loop and use vec[count] instead of map[index]count by RB5009 |
| Rust v6 |
23ms |
36ms |
Optimized Binary Heap Ops by scottlamb |
| Rust Rayon |
9ms |
22ms |
Parallelize by masmullin2000 |
| Rust Rayon |
8ms |
22ms |
Remove comparison out of hot loop |
| ⠀ |
⠀ |
⠀ |
⠀ |
| Go |
- |
1.5s |
Initial |
| Go v2 |
- |
80ms |
Add rust optimizations |
| Go v3 |
56ms |
70ms |
Use goccy/go-json |
| Go v3 |
34ms |
55ms |
Use generic binaryheap by DrBlury |
| Go v4 |
26ms |
50ms |
Replace binary heap with custom priority queue |
| Go v5 |
20ms |
43ms |
Remove comparison out of hot loop |
| Go Con |
10ms |
33ms |
Go concurrency by tirprox and DrBlury |
| Go Con v2 |
5ms |
29ms |
Use arena, use waitgroup, rm binheap by DrBlury |
| ⠀ |
⠀ |
⠀ |
⠀ |
| Python |
- |
7.81s |
Initial |
| Python v2 |
1.35s |
1.53s |
Add rust optimizations by dave-andersen |
| Numpy |
0.57s |
0.85s |
Numpy implementation by Copper280z |
| ⠀ |
⠀ |
⠀ |
⠀ |
| Crystal |
50ms |
96ms |
Inital w/ previous optimizations |
| Crystal v2 |
33ms |
72ms |
Replace binary heap with custom priority queue |
| ⠀ |
⠀ |
⠀ |
⠀ |
| Odin |
110ms |
397ms |
Ported from golang code |
| Odin v2 |
104ms |
404ms |
Remove comparison out of hot loop |
| ⠀ |
⠀ |
⠀ |
⠀ |
| Dart VM |
125ms |
530ms |
Ported frog golang code |
| Dart bin |
274ms |
360ms |
Compiled executable |
| ⠀ |
⠀ |
⠀ |
⠀ |
| Vlang |
339ms |
560ms |
Ported from golang code |
| ⠀ |
⠀ |
⠀ |
⠀ |
| Zig |
80ms |
110ms |
Provided by akhildevelops |