public class Http2PriorityTreeBenchmark extends AbstractMicrobenchmark
AbstractMicrobenchmark.HarnessExecutor
Modifier and Type | Field and Description |
---|---|
Http2Connection |
connection |
int |
d_ary |
int |
exclusiveOnCount |
int |
numStreams |
DEFAULT_FORKS
BASE_JVM_ARGS, DEFAULT_MEASURE_ITERATIONS, DEFAULT_WARMUP_ITERATIONS
Constructor and Description |
---|
Http2PriorityTreeBenchmark() |
Modifier and Type | Method and Description |
---|---|
void |
prioritizeStreams()
A priority tree will be build using the
d_ary variable to determine the number of children for each
node. |
void |
setup() |
void |
teardown() |
getForks, jvmArgs, newOptionsBuilder
getMeasureIterations, getReportDir, getWarmupIterations, handleUnexpectedException, removeAssertions, run
public Http2Connection connection
public int numStreams
public int d_ary
public int exclusiveOnCount
public void setup() throws Http2Exception
Http2Exception
public void teardown() throws Http2Exception
Http2Exception
public void prioritizeStreams() throws Http2Exception
d_ary
variable to determine the number of children for each
node. After the priority tree is built the nodes closest to the root will be pushed down to be dependent on leaf
nodes. This is to simulate an "expensive" tree operation.Http2Exception
Copyright © 2008–2016 The Netty Project. All rights reserved.