comment
Project: http://git-wip-us.apache.org/repos/asf/cassandra/repo Commit: http://git-wip-us.apache.org/repos/asf/cassandra/commit/694e3a74 Tree: http://git-wip-us.apache.org/repos/asf/cassandra/tree/694e3a74 Diff: http://git-wip-us.apache.org/repos/asf/cassandra/diff/694e3a74 Branch: refs/heads/cassandra-1.2 Commit: 694e3a74a9b3b31d43eed5477dd6fed3db4c293e Parents: 3925f56 Author: Jonathan Ellis <jbel...@apache.org> Authored: Thu Feb 14 11:17:51 2013 -0600 Committer: Jonathan Ellis <jbel...@apache.org> Committed: Thu Feb 14 11:17:51 2013 -0600 ---------------------------------------------------------------------- .../cassandra/locator/DynamicEndpointSnitch.java | 3 ++- 1 files changed, 2 insertions(+), 1 deletions(-) ---------------------------------------------------------------------- http://git-wip-us.apache.org/repos/asf/cassandra/blob/694e3a74/src/java/org/apache/cassandra/locator/DynamicEndpointSnitch.java ---------------------------------------------------------------------- diff --git a/src/java/org/apache/cassandra/locator/DynamicEndpointSnitch.java b/src/java/org/apache/cassandra/locator/DynamicEndpointSnitch.java index 214208e..1094a00 100644 --- a/src/java/org/apache/cassandra/locator/DynamicEndpointSnitch.java +++ b/src/java/org/apache/cassandra/locator/DynamicEndpointSnitch.java @@ -254,7 +254,8 @@ public class DynamicEndpointSnitch extends AbstractEndpointSnitch implements ILa else // there's a chance a host was added to the samples after our previous loop to get the time penalties. Add 1.0 to it, or '100% bad' for the time penalty. score += 1; // maxPenalty / maxPenalty - // finally, add the severity without any weighting, since hosts scale this relative to their own load and the size of the task causing the severity + // finally, add the severity without any weighting, since hosts scale this relative to their own load and the size of the task causing the severity. + // "Severity" is basically a measure of compaction activity (CASSANDRA-3722). score += StorageService.instance.getSeverity(entry.getKey()); // lowest score (least amount of badness) wins. scores.put(entry.getKey(), score);
