"README.md" did not exist on "74b2e0dfd7d48221342865f0f43d58ba444ffaeb"
The source project of this merge request has been removed.
Implement Benchmarking Strategy: Heuristic 2 (Binary Search Strategy)
Compare changes
- Simon Ehrenstein authored
+ 1
− 1
@@ -163,5 +163,5 @@ There are the following benchmarking strategies:
* `step`: A heuristic which works as follows: After each subexperiment, it is checked, whether the application could handle the workload. If the workload could be handled, the workload intensity is increased in the next subexperiment. Otherwise, the workload intensity is kept the same and the number of instances is increased. The amount of executed sub-experiments is at most N+M-1.
* `binary-search`: A heuristic which works as follows: For each number of instances, a binary-search like strategy is used to determine the workload intensity, to which the system handle the workload. The limiting workload intensity is taken into consideration when executing sub-experiments for other number of replicas. The number of executed sub-experiments is at most M*log(N).
* `binary-search`: A heuristic which works as follows: For each number of instances, a binary-search like strategy is used to determine the workload intensity, to which the system handle the workload. The limiting workload intensity is taken into consideration when executing sub-experiments for other number of replicas. The number of executed sub-experiments is at most N*log(M).