Get the latest tech news
Show HN: Chili. Rust port of Spice, a low-overhead parallelization library
Contribute to dragostis/chili development by creating an account on GitHub.
At any fork point during computation, it may run the two passed closures in parallel. This is the ideal example since per-node computation is very cheap and the nodes don't keep track of how many descendants are left. The following benchmarks measure the time it takes to sum up all the values in a balanced binary tree with varying number of nodes.
Or read this on Hacker News
