Some implementations results on random polling dynamic load balancing

Using two sample applications, we demonstrate the effectiveness of our
portable and reusable library for parallel tree search. On 1024
Transputers we achieve near optimal speedup even for quite small
instances of the `Golomb ruler' problem. The `0/1 knapsack
problem' is more challenging but it is possible to achieve superlinear
speedup compared to the standard sequential depth first algorithm the
implementation is based on.