Functions for size balancing.
1 2 3
A cluster object created by
A vector to split.
A function or character string naming a function.
Vector of problem sizes (approximate processing times)
corresponding to elements of
Other arguments of
seq into subsets,
with respect to
In size balancing, the problem is re-ordered from
largest to smallest, and then subsets are
determined by minimizing the total approximate processing time.
This splitting is deterministic (reproducible).
on elements of
x in parallel, similarly to
uses size balancing (via
parLapplySLB uses size and load balancing.
This means that the problem is re-ordered from largest to smallest,
and then undeterministic load balancing
is used (see
correct, this is identical to size balancing.
This splitting is non-deterministic (might not be reproducible).
clusterSplitSB returns a list of subsets
splitted with respect to
fun on elements of
x, and return a result
x. Usually a list with results
returned by the cluster.
Peter Solymos, firstname.lastname@example.org
Related functions without size balancing:
Optimizing the number of workers:
1 2 3 4 5 6 7 8 9 10 11