... | ... | @@ -20,7 +20,7 @@ In a bisection test the even number of $`n`$ processes available to LinkTest is |
|
|
## Grouping According to Hostname
|
|
|
LinkTest can also group processes according to their hostname. In this case testing exclusively occurs between all processes of a group and another group during a step, i.e. no two processes from the same group will communicate to different groups. The group-to-group communication pattern is determined in this case using the 1-Factor algorithm. When testing between two groups all possible connection pairs between the two groups are iterated through. Note that the possible permutation space exhibits a similar behavior as to the full test, i.e. for large $`n`$ it becomes neigh impossible to iterate through all possible combinations.
|
|
|
|
|
|
## Grouping According to Hostname with bBisection
|
|
|
## Grouping According to Hostname with Bisection
|
|
|
Differs from the previous in that the even number of groups is split into bisecting halves and only the connections between the two halves are tested. Note that the possible permutation space exhibits a similar behavior as to the full test, i.e. for large $`n`$ it becomes neigh impossible to iterate through all possible combinations.
|
|
|
|
|
|
## Comparison
|
... | ... | @@ -42,7 +42,7 @@ More generally the number of possible partitions for any group $`i`$ is: |
|
|
```math
|
|
|
P_{0,i}=\begin{pmatrix}n-2i\\2\end{pmatrix}.
|
|
|
```
|
|
|
The total number of possible ways to partition the $`n`$ processes into $`n/2`$ groups $`P`$ is then:
|
|
|
The total number of possible ways to partition the $`n`$ processes into $`n/2`$ groups $`P_{0}`$ is then:
|
|
|
```math
|
|
|
P_{0}=\prod\limits_{i=0}^{n/2-1}P_{0,i}=\prod\limits_{i=0}^{n/2-1}\begin{pmatrix}n-2i\\2\end{pmatrix}=\frac{n!}{(2!)^{n/2}}.
|
|
|
```
|
... | ... | |