28/10/2021 Ideas

[SebastienMorais]

List of discussed stuff :

• [ ] use of a custom split_target to compute the median
• [x] adjust the number of threads per sub-array depending on the array length
• [x] update RCB stop criterion -> use the number of points leq the minimum and geq maximum. if there are no points in between, i.e. nb points - nb lower - nb higher == 0, stop.
• [x] parallelize partition (memcpy style)
• [x] permute elements

Perspectives :

1. overcut to recompose
2. cut in 3 parts and leverage w0 < target and w2 leq target

[hhirtz]

• [x] keep track of min, max and sum accross iterations

[hhirtz]

• adjust the number of threads per sub-array depending on the array length -> went for another (MPI-like) model where this does not apply
• update RCB stop criterion: https://github.com/LIHPC-Computational-Geometry/coupe/commit/c362b471b8de0df97247314859b6d6ae7eaeb253
• parallelize partition https://github.com/LIHPC-Computational-Geometry/coupe/blob/b2ad42461284ec30aac24d9830dd7909b22a9873/src/algorithms/recursive_bisection.rs#L105-L110
• permute elements https://github.com/LIHPC-Computational-Geometry/coupe/blob/b2ad42461284ec30aac24d9830dd7909b22a9873/src/algorithms/recursive_bisection.rs#L196-L199