diff options
| author | Jon Marius Venstad <jonmv@users.noreply.github.com> | 2020-12-03 10:12:59 +0100 |
|---|---|---|
| committer | GitHub <noreply@github.com> | 2020-12-03 10:12:59 +0100 |
| commit | 7005bf273d8ed242dcecd7775e5982262192ffbb (patch) | |
| tree | ce5a0945754e2c9c5584b9e295b778293d462a8a /messagebus | |
| parent | ac5041033b8782e2cb8b1f64f880f004c510bea6 (diff) | |
fix javadoc
Diffstat (limited to 'messagebus')
| -rw-r--r-- | messagebus/src/main/java/com/yahoo/messagebus/DynamicThrottlePolicy.java | 2 |
1 files changed, 1 insertions, 1 deletions
diff --git a/messagebus/src/main/java/com/yahoo/messagebus/DynamicThrottlePolicy.java b/messagebus/src/main/java/com/yahoo/messagebus/DynamicThrottlePolicy.java index 63ac44fca74..5a64ec5f929 100644 --- a/messagebus/src/main/java/com/yahoo/messagebus/DynamicThrottlePolicy.java +++ b/messagebus/src/main/java/com/yahoo/messagebus/DynamicThrottlePolicy.java @@ -12,7 +12,7 @@ import java.util.logging.Logger; * <p> * The algorithm works by increasing the number of messages allowed to be pending, the <em>winidow size</em>, until * this no longer increases throughput. At this point, the algorithm is driven by synthetic attraction towards latencies - * which satisfy <code>log10(1 / latency) % 1 = e</code>, for some constant <code>0 < e < 1</code>. Weird? Most certainly! + * which satisfy <code>log10(1 / latency) % 1 = e</code>, for some constant <code>0 < e < 1</code>. Weird? Most certainly! * </p><p> * The effect is that the window size the algorithm produces, for a saturated ideal server, has a level for each power * of ten with an attractor the window size tends towards while on this level, determined by the <code>e</code> above. |