-
Notifications
You must be signed in to change notification settings - Fork 36
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Add concurrent proxy in front of SemanticMetricDistribution #111
base: master
Are you sure you want to change the base?
Changes from all commits
File filter
Filter by extension
Conversations
Jump to
Diff view
Diff view
There are no files selected for viewing
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,83 @@ | ||
/* | ||
* Copyright (C) 2021 Spotify AB. | ||
* | ||
* Licensed to the Apache Software Foundation (ASF) under one | ||
* or more contributor license agreements. See the NOTICE file | ||
* distributed with this work for additional information | ||
* regarding copyright ownership. The ASF licenses this file | ||
* to you under the Apache License, Version 2.0 (the | ||
* "License"); you may not use this file except in compliance | ||
* with the License. You may obtain a copy of the License at | ||
* | ||
* http://www.apache.org/licenses/LICENSE-2.0 | ||
* | ||
* Unless required by applicable law or agreed to in writing, | ||
* software distributed under the License is distributed on an | ||
* "AS IS" BASIS, WITHOUT WARRANTIES OR CONDITIONS OF ANY | ||
* KIND, either express or implied. See the License for the | ||
* specific language governing permissions and limitations | ||
* under the License. | ||
*/ | ||
|
||
package com.spotify.metrics.core; | ||
|
||
import com.google.common.annotations.VisibleForTesting; | ||
import com.tdunning.math.stats.TDigest; | ||
|
||
import java.util.Arrays; | ||
import java.util.function.Supplier; | ||
import java.util.stream.IntStream; | ||
|
||
public class ConcurrentDistribution implements Distribution { | ||
|
||
private final Distribution[] shards; | ||
private final int shardBitmask; | ||
|
||
@VisibleForTesting | ||
public ConcurrentDistribution() { | ||
this(SemanticMetricDistribution::new); | ||
} | ||
|
||
ConcurrentDistribution(Supplier<Distribution> distributionSupplier) { | ||
this(distributionSupplier, 4 * Runtime.getRuntime().availableProcessors()); | ||
} | ||
|
||
ConcurrentDistribution(Supplier<Distribution> distributionSupplier, int minShards) { | ||
final int numShards = nearestPowerOfTwo(minShards); | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Power of two to avoid modulo operation later |
||
this.shardBitmask = numShards - 1; | ||
|
||
this.shards = IntStream.range(0, numShards) | ||
.mapToObj(i -> distributionSupplier.get()) | ||
.toArray(Distribution[]::new); | ||
} | ||
|
||
private static int nearestPowerOfTwo(int n) { | ||
int x = 1; | ||
while (x < n) { | ||
x *= 2; | ||
} | ||
return x; | ||
} | ||
|
||
@Override | ||
public void record(double val) { | ||
final int targetShard = ((int) Thread.currentThread().getId() & shardBitmask); | ||
There was a problem hiding this comment. Choose a reason for hiding this commentThe reason will be displayed to describe this comment to others. Learn more. Not sure how evenly this will distribute load - thread ids are auto-incremented, so might possibly be ok in practice |
||
shards[targetShard].record(val); | ||
} | ||
|
||
@Override | ||
public TDigest getDigestAndFlush() { | ||
return Arrays.stream(shards) | ||
.map(Distribution::getDigestAndFlush) | ||
.reduce((first, second) -> { | ||
first.add(second); | ||
return first; | ||
}) | ||
.get(); | ||
} | ||
|
||
@Override | ||
public long getCount() { | ||
return Arrays.stream(shards).mapToLong(Distribution::getCount).sum(); | ||
} | ||
} |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Not sure what a good number of shards should be