Describe the algorithms

This commit is contained in:
Rodolphe Bréard 2024-10-30 22:24:26 +01:00
parent 501179f5fd
commit 1431af6f51

View file

@ -59,3 +59,18 @@ algorithms in Rust and benchmark them. Let the battle begin.
[rust]: https://www.rust-lang.org/
[gnuplot]: http://www.gnuplot.info/
## Algorithms
- `single thread`: No multi-threading or any optimization of any kind. Used as
a reference.
- `rayon`: Multi-threading provided by the `rayon` crate, but no optimization
of any kind. Used as a reference.
- `rayon sorted`: Multi-threading provided by the `rayon` crate. Tasks are
sorted so the shortest ones are executed first.
- `rayon sorted reverse`: Multi-threading provided by the `rayon` crate. Tasks
are sorted so the longest ones are executed first. This should behave as an
[LPT][lpt].
[lpt]: https://en.wikipedia.org/wiki/Longest-processing-time-first_scheduling