From d3d3976a9e3166c9ef98c1d430f82b9269c19c17 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?S=C3=B6ren=20Henning?= <soeren.henning@email.uni-kiel.de> Date: Fri, 3 Dec 2021 13:07:43 +0100 Subject: [PATCH] Fix spelling issues --- docs/running-benchmarks.md | 2 +- docs/theodolite-benchmarks/index.md | 2 +- 2 files changed, 2 insertions(+), 2 deletions(-) diff --git a/docs/running-benchmarks.md b/docs/running-benchmarks.md index 04b93b67d..d999e75cb 100644 --- a/docs/running-benchmarks.md +++ b/docs/running-benchmarks.md @@ -17,7 +17,7 @@ Running scalability benchmarks with Theodolite involves the following steps: A benchmark specification consists of two things: * A Benchmark resource YAML file -* One or multiple ConfigMap YAML files containing all the Kubernetes resources used by the benchmark +* One or more ConfigMap YAML files containing all the Kubernetes resources used by the benchmark These files are usually provided by benchmark designers. For example, we ship Theodolite with a set of [benchmarks for event-driven microservices](theodolite-benchmarks). diff --git a/docs/theodolite-benchmarks/index.md b/docs/theodolite-benchmarks/index.md index edd3e4c8f..39db8873e 100644 --- a/docs/theodolite-benchmarks/index.md +++ b/docs/theodolite-benchmarks/index.md @@ -20,7 +20,7 @@ A simple, but common use case in event-driven architectures is that events or me Another common use case for stream processing architectures is reducing the amount of events, messages, or measurements by aggregating multiple records within consecutive, non-overlapping time windows. Typical aggregations compute the average, minimum, or maximum of measurements within a time window or count the occurrence of same events. Such reduced amounts of data are required, for example, to save computing resources or to provide a better user experience (e.g., for data visualizations). -When using aggregation windows of ï¬xed size that succeed each other without gaps (called [tumbling windows](https://kafka.apache.org/20/documentation/streams/developer-guide/dsl-api.html#tumbling-time-windows) in many stream processing enegines), the (potentially varying) message frequency is reduced to a constant value. +When using aggregation windows of ï¬xed size that succeed each other without gaps (called [tumbling windows](https://kafka.apache.org/20/documentation/streams/developer-guide/dsl-api.html#tumbling-time-windows) in many stream processing engines), the (potentially varying) message frequency is reduced to a constant value. This is also referred to as downsampling. Downsampling allows for applying many machine learning methods that require data of a ï¬xed frequency. -- GitLab