From fc95bcca57e40c7675394ccd368254e33674ef64 Mon Sep 17 00:00:00 2001 From: Simon Ehrenstein <simon.ehrenstein@gmail.com> Date: Tue, 11 Aug 2020 13:03:23 +0200 Subject: [PATCH] Correct runtime complexity formula --- execution/README.md | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/execution/README.md b/execution/README.md index 84ec159ed..955061272 100644 --- a/execution/README.md +++ b/execution/README.md @@ -163,5 +163,5 @@ There are the following benchmarking strategies: * `default`: Execute a subexperiment for each combination of the number of replicas (N), and the number of workload intensities (M). The amount of executed subexperiments is always N*M. * `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). -- GitLab