Gabriel Radanne

Reading list

4

- [x] Rooted trees in linear time (implemented) https://dl.acm.org/citation.cfm?id=1133017 - [ ] Drawing Non-layered Tidy Trees in Linear Time -- A.J. van der Ploeg -- [Implem](https://github.com/cwi-swat/non-layered-tidy-trees/blob/master/treelayout/algorithm/Paper.java) - [ ] [Overview...

The current tries implementation doesn't do path-compression. Adding that would dramatically improve the performances.

Investigate fuzzing.

1

The technique works well as a substitute for property testing through qcheck. In theory, it would combine very well with coverage-based fuzzing such as afl-fuzz.

Degraded scaling for the FIFO scheduler

2

As we discussed on discord, I run a benchmark recently for parallel map on trees. It makes for an interesting embarrassingly parallel (recursive) task. The core function is the `map_par_full`...

Poor scaling on random scheduler

3

I run a benchmark recently for parallel map on trees. It makes for an interesting embarrassingly parallel (recursive) task. The core function is the `map_par_full` function below: ```ocaml open Picos...