'Extreme load imbalance of sample sort and its proof
Suppose there are n elements in total and P processes. On average each process would perform final local sort on n/P elements (for simplicity assume n is divisible by P). What is the maximum load imbalance that can occur in the final local sort? Minimum 1 element and maximum (2n/p-1) elements? Is there any proof?
Sources
This article follows the attribution requirements of Stack Overflow and is licensed under CC BY-SA 3.0.
Source: Stack Overflow
| Solution | Source |
|---|