http://git-wip-us.apache.org/repos/asf/hbase-site/blob/3332caca/devapidocs/src-html/org/apache/hadoop/hbase/master/balancer/StochasticLoadBalancer.MemStoreSizeCostFunction.html ---------------------------------------------------------------------- diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/master/balancer/StochasticLoadBalancer.MemStoreSizeCostFunction.html b/devapidocs/src-html/org/apache/hadoop/hbase/master/balancer/StochasticLoadBalancer.MemStoreSizeCostFunction.html new file mode 100644 index 0000000..788fb93 --- /dev/null +++ b/devapidocs/src-html/org/apache/hadoop/hbase/master/balancer/StochasticLoadBalancer.MemStoreSizeCostFunction.html @@ -0,0 +1,1786 @@ +<!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN" "http://www.w3.org/TR/html4/loose.dtd"> +<html lang="en"> +<head> +<title>Source code</title> +<link rel="stylesheet" type="text/css" href="../../../../../../../stylesheet.css" title="Style"> +</head> +<body> +<div class="sourceContainer"> +<pre><span class="sourceLineNo">001</span>/**<a name="line.1"></a> +<span class="sourceLineNo">002</span> * Licensed to the Apache Software Foundation (ASF) under one<a name="line.2"></a> +<span class="sourceLineNo">003</span> * or more contributor license agreements. See the NOTICE file<a name="line.3"></a> +<span class="sourceLineNo">004</span> * distributed with this work for additional information<a name="line.4"></a> +<span class="sourceLineNo">005</span> * regarding copyright ownership. The ASF licenses this file<a name="line.5"></a> +<span class="sourceLineNo">006</span> * to you under the Apache License, Version 2.0 (the<a name="line.6"></a> +<span class="sourceLineNo">007</span> * "License"); you may not use this file except in compliance<a name="line.7"></a> +<span class="sourceLineNo">008</span> * with the License. You may obtain a copy of the License at<a name="line.8"></a> +<span class="sourceLineNo">009</span> *<a name="line.9"></a> +<span class="sourceLineNo">010</span> * http://www.apache.org/licenses/LICENSE-2.0<a name="line.10"></a> +<span class="sourceLineNo">011</span> *<a name="line.11"></a> +<span class="sourceLineNo">012</span> * Unless required by applicable law or agreed to in writing, software<a name="line.12"></a> +<span class="sourceLineNo">013</span> * distributed under the License is distributed on an "AS IS" BASIS,<a name="line.13"></a> +<span class="sourceLineNo">014</span> * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.<a name="line.14"></a> +<span class="sourceLineNo">015</span> * See the License for the specific language governing permissions and<a name="line.15"></a> +<span class="sourceLineNo">016</span> * limitations under the License.<a name="line.16"></a> +<span class="sourceLineNo">017</span> */<a name="line.17"></a> +<span class="sourceLineNo">018</span>package org.apache.hadoop.hbase.master.balancer;<a name="line.18"></a> +<span class="sourceLineNo">019</span><a name="line.19"></a> +<span class="sourceLineNo">020</span>import java.util.ArrayDeque;<a name="line.20"></a> +<span class="sourceLineNo">021</span>import java.util.ArrayList;<a name="line.21"></a> +<span class="sourceLineNo">022</span>import java.util.Arrays;<a name="line.22"></a> +<span class="sourceLineNo">023</span>import java.util.Collection;<a name="line.23"></a> +<span class="sourceLineNo">024</span>import java.util.Collections;<a name="line.24"></a> +<span class="sourceLineNo">025</span>import java.util.Deque;<a name="line.25"></a> +<span class="sourceLineNo">026</span>import java.util.HashMap;<a name="line.26"></a> +<span class="sourceLineNo">027</span>import java.util.LinkedList;<a name="line.27"></a> +<span class="sourceLineNo">028</span>import java.util.List;<a name="line.28"></a> +<span class="sourceLineNo">029</span>import java.util.Map;<a name="line.29"></a> +<span class="sourceLineNo">030</span>import java.util.Map.Entry;<a name="line.30"></a> +<span class="sourceLineNo">031</span>import java.util.Random;<a name="line.31"></a> +<span class="sourceLineNo">032</span><a name="line.32"></a> +<span class="sourceLineNo">033</span>import org.apache.commons.logging.Log;<a name="line.33"></a> +<span class="sourceLineNo">034</span>import org.apache.commons.logging.LogFactory;<a name="line.34"></a> +<span class="sourceLineNo">035</span>import org.apache.hadoop.conf.Configuration;<a name="line.35"></a> +<span class="sourceLineNo">036</span>import org.apache.hadoop.hbase.ClusterStatus;<a name="line.36"></a> +<span class="sourceLineNo">037</span>import org.apache.hadoop.hbase.HBaseInterfaceAudience;<a name="line.37"></a> +<span class="sourceLineNo">038</span>import org.apache.hadoop.hbase.HConstants;<a name="line.38"></a> +<span class="sourceLineNo">039</span>import org.apache.hadoop.hbase.RegionLoad;<a name="line.39"></a> +<span class="sourceLineNo">040</span>import org.apache.hadoop.hbase.ServerLoad;<a name="line.40"></a> +<span class="sourceLineNo">041</span>import org.apache.hadoop.hbase.ServerName;<a name="line.41"></a> +<span class="sourceLineNo">042</span>import org.apache.hadoop.hbase.TableName;<a name="line.42"></a> +<span class="sourceLineNo">043</span>import org.apache.hadoop.hbase.client.RegionInfo;<a name="line.43"></a> +<span class="sourceLineNo">044</span>import org.apache.hadoop.hbase.master.MasterServices;<a name="line.44"></a> +<span class="sourceLineNo">045</span>import org.apache.hadoop.hbase.master.RegionPlan;<a name="line.45"></a> +<span class="sourceLineNo">046</span>import org.apache.hadoop.hbase.master.balancer.BaseLoadBalancer.Cluster.Action;<a name="line.46"></a> +<span class="sourceLineNo">047</span>import org.apache.hadoop.hbase.master.balancer.BaseLoadBalancer.Cluster.Action.Type;<a name="line.47"></a> +<span class="sourceLineNo">048</span>import org.apache.hadoop.hbase.master.balancer.BaseLoadBalancer.Cluster.AssignRegionAction;<a name="line.48"></a> +<span class="sourceLineNo">049</span>import org.apache.hadoop.hbase.master.balancer.BaseLoadBalancer.Cluster.LocalityType;<a name="line.49"></a> +<span class="sourceLineNo">050</span>import org.apache.hadoop.hbase.master.balancer.BaseLoadBalancer.Cluster.MoveRegionAction;<a name="line.50"></a> +<span class="sourceLineNo">051</span>import org.apache.hadoop.hbase.master.balancer.BaseLoadBalancer.Cluster.SwapRegionsAction;<a name="line.51"></a> +<span class="sourceLineNo">052</span>import org.apache.hadoop.hbase.util.Bytes;<a name="line.52"></a> +<span class="sourceLineNo">053</span>import org.apache.hadoop.hbase.util.EnvironmentEdgeManager;<a name="line.53"></a> +<span class="sourceLineNo">054</span>import org.apache.yetus.audience.InterfaceAudience;<a name="line.54"></a> +<span class="sourceLineNo">055</span><a name="line.55"></a> +<span class="sourceLineNo">056</span>import org.apache.hadoop.hbase.shaded.com.google.common.base.Optional;<a name="line.56"></a> +<span class="sourceLineNo">057</span>import org.apache.hadoop.hbase.shaded.com.google.common.collect.Lists;<a name="line.57"></a> +<span class="sourceLineNo">058</span><a name="line.58"></a> +<span class="sourceLineNo">059</span>import com.google.common.annotations.VisibleForTesting;<a name="line.59"></a> +<span class="sourceLineNo">060</span><a name="line.60"></a> +<span class="sourceLineNo">061</span>/**<a name="line.61"></a> +<span class="sourceLineNo">062</span> * <p>This is a best effort load balancer. Given a Cost function F(C) =&gt; x It will<a name="line.62"></a> +<span class="sourceLineNo">063</span> * randomly try and mutate the cluster to Cprime. If F(Cprime) &lt; F(C) then the<a name="line.63"></a> +<span class="sourceLineNo">064</span> * new cluster state becomes the plan. It includes costs functions to compute the cost of:</p><a name="line.64"></a> +<span class="sourceLineNo">065</span> * <ul><a name="line.65"></a> +<span class="sourceLineNo">066</span> * <li>Region Load</li><a name="line.66"></a> +<span class="sourceLineNo">067</span> * <li>Table Load</li><a name="line.67"></a> +<span class="sourceLineNo">068</span> * <li>Data Locality</li><a name="line.68"></a> +<span class="sourceLineNo">069</span> * <li>Memstore Sizes</li><a name="line.69"></a> +<span class="sourceLineNo">070</span> * <li>Storefile Sizes</li><a name="line.70"></a> +<span class="sourceLineNo">071</span> * </ul><a name="line.71"></a> +<span class="sourceLineNo">072</span> *<a name="line.72"></a> +<span class="sourceLineNo">073</span> *<a name="line.73"></a> +<span class="sourceLineNo">074</span> * <p>Every cost function returns a number between 0 and 1 inclusive; where 0 is the lowest cost<a name="line.74"></a> +<span class="sourceLineNo">075</span> * best solution, and 1 is the highest possible cost and the worst solution. The computed costs are<a name="line.75"></a> +<span class="sourceLineNo">076</span> * scaled by their respective multipliers:</p><a name="line.76"></a> +<span class="sourceLineNo">077</span> *<a name="line.77"></a> +<span class="sourceLineNo">078</span> * <ul><a name="line.78"></a> +<span class="sourceLineNo">079</span> * <li>hbase.master.balancer.stochastic.regionLoadCost</li><a name="line.79"></a> +<span class="sourceLineNo">080</span> * <li>hbase.master.balancer.stochastic.moveCost</li><a name="line.80"></a> +<span class="sourceLineNo">081</span> * <li>hbase.master.balancer.stochastic.tableLoadCost</li><a name="line.81"></a> +<span class="sourceLineNo">082</span> * <li>hbase.master.balancer.stochastic.localityCost</li><a name="line.82"></a> +<span class="sourceLineNo">083</span> * <li>hbase.master.balancer.stochastic.memstoreSizeCost</li><a name="line.83"></a> +<span class="sourceLineNo">084</span> * <li>hbase.master.balancer.stochastic.storefileSizeCost</li><a name="line.84"></a> +<span class="sourceLineNo">085</span> * </ul><a name="line.85"></a> +<span class="sourceLineNo">086</span> *<a name="line.86"></a> +<span class="sourceLineNo">087</span> * <p>In addition to the above configurations, the balancer can be tuned by the following<a name="line.87"></a> +<span class="sourceLineNo">088</span> * configuration values:</p><a name="line.88"></a> +<span class="sourceLineNo">089</span> * <ul><a name="line.89"></a> +<span class="sourceLineNo">090</span> * <li>hbase.master.balancer.stochastic.maxMoveRegions which<a name="line.90"></a> +<span class="sourceLineNo">091</span> * controls what the max number of regions that can be moved in a single invocation of this<a name="line.91"></a> +<span class="sourceLineNo">092</span> * balancer.</li><a name="line.92"></a> +<span class="sourceLineNo">093</span> * <li>hbase.master.balancer.stochastic.stepsPerRegion is the coefficient by which the number of<a name="line.93"></a> +<span class="sourceLineNo">094</span> * regions is multiplied to try and get the number of times the balancer will<a name="line.94"></a> +<span class="sourceLineNo">095</span> * mutate all servers.</li><a name="line.95"></a> +<span class="sourceLineNo">096</span> * <li>hbase.master.balancer.stochastic.maxSteps which controls the maximum number of times that<a name="line.96"></a> +<span class="sourceLineNo">097</span> * the balancer will try and mutate all the servers. The balancer will use the minimum of this<a name="line.97"></a> +<span class="sourceLineNo">098</span> * value and the above computation.</li><a name="line.98"></a> +<span class="sourceLineNo">099</span> * </ul><a name="line.99"></a> +<span class="sourceLineNo">100</span> *<a name="line.100"></a> +<span class="sourceLineNo">101</span> * <p>This balancer is best used with hbase.master.loadbalance.bytable set to false<a name="line.101"></a> +<span class="sourceLineNo">102</span> * so that the balancer gets the full picture of all loads on the cluster.</p><a name="line.102"></a> +<span class="sourceLineNo">103</span> */<a name="line.103"></a> +<span class="sourceLineNo">104</span>@InterfaceAudience.LimitedPrivate(HBaseInterfaceAudience.CONFIG)<a name="line.104"></a> +<span class="sourceLineNo">105</span>@edu.umd.cs.findbugs.annotations.SuppressWarnings(value="IS2_INCONSISTENT_SYNC",<a name="line.105"></a> +<span class="sourceLineNo">106</span> justification="Complaint is about costFunctions not being synchronized; not end of the world")<a name="line.106"></a> +<span class="sourceLineNo">107</span>public class StochasticLoadBalancer extends BaseLoadBalancer {<a name="line.107"></a> +<span class="sourceLineNo">108</span><a name="line.108"></a> +<span class="sourceLineNo">109</span> protected static final String STEPS_PER_REGION_KEY =<a name="line.109"></a> +<span class="sourceLineNo">110</span> "hbase.master.balancer.stochastic.stepsPerRegion";<a name="line.110"></a> +<span class="sourceLineNo">111</span> protected static final String MAX_STEPS_KEY =<a name="line.111"></a> +<span class="sourceLineNo">112</span> "hbase.master.balancer.stochastic.maxSteps";<a name="line.112"></a> +<span class="sourceLineNo">113</span> protected static final String RUN_MAX_STEPS_KEY =<a name="line.113"></a> +<span class="sourceLineNo">114</span> "hbase.master.balancer.stochastic.runMaxSteps";<a name="line.114"></a> +<span class="sourceLineNo">115</span> protected static final String MAX_RUNNING_TIME_KEY =<a name="line.115"></a> +<span class="sourceLineNo">116</span> "hbase.master.balancer.stochastic.maxRunningTime";<a name="line.116"></a> +<span class="sourceLineNo">117</span> protected static final String KEEP_REGION_LOADS =<a name="line.117"></a> +<span class="sourceLineNo">118</span> "hbase.master.balancer.stochastic.numRegionLoadsToRemember";<a name="line.118"></a> +<span class="sourceLineNo">119</span> private static final String TABLE_FUNCTION_SEP = "_";<a name="line.119"></a> +<span class="sourceLineNo">120</span> protected static final String MIN_COST_NEED_BALANCE_KEY =<a name="line.120"></a> +<span class="sourceLineNo">121</span> "hbase.master.balancer.stochastic.minCostNeedBalance";<a name="line.121"></a> +<span class="sourceLineNo">122</span><a name="line.122"></a> +<span class="sourceLineNo">123</span> protected static final Random RANDOM = new Random(System.currentTimeMillis());<a name="line.123"></a> +<span class="sourceLineNo">124</span> private static final Log LOG = LogFactory.getLog(StochasticLoadBalancer.class);<a name="line.124"></a> +<span class="sourceLineNo">125</span><a name="line.125"></a> +<span class="sourceLineNo">126</span> Map<String, Deque<BalancerRegionLoad>> loads = new HashMap<>();<a name="line.126"></a> +<span class="sourceLineNo">127</span><a name="line.127"></a> +<span class="sourceLineNo">128</span> // values are defaults<a name="line.128"></a> +<span class="sourceLineNo">129</span> private int maxSteps = 1000000;<a name="line.129"></a> +<span class="sourceLineNo">130</span> private boolean runMaxSteps = false;<a name="line.130"></a> +<span class="sourceLineNo">131</span> private int stepsPerRegion = 800;<a name="line.131"></a> +<span class="sourceLineNo">132</span> private long maxRunningTime = 30 * 1000 * 1; // 30 seconds.<a name="line.132"></a> +<span class="sourceLineNo">133</span> private int numRegionLoadsToRemember = 15;<a name="line.133"></a> +<span class="sourceLineNo">134</span> private float minCostNeedBalance = 0.05f;<a name="line.134"></a> +<span class="sourceLineNo">135</span><a name="line.135"></a> +<span class="sourceLineNo">136</span> private List<CandidateGenerator> candidateGenerators;<a name="line.136"></a> +<span class="sourceLineNo">137</span> private CostFromRegionLoadFunction[] regionLoadFunctions;<a name="line.137"></a> +<span class="sourceLineNo">138</span> private CostFunction[] costFunctions; // FindBugs: Wants this protected; IS2_INCONSISTENT_SYNC<a name="line.138"></a> +<span class="sourceLineNo">139</span><a name="line.139"></a> +<span class="sourceLineNo">140</span> // to save and report costs to JMX<a name="line.140"></a> +<span class="sourceLineNo">141</span> private Double curOverallCost = 0d;<a name="line.141"></a> +<span class="sourceLineNo">142</span> private Double[] tempFunctionCosts;<a name="line.142"></a> +<span class="sourceLineNo">143</span> private Double[] curFunctionCosts;<a name="line.143"></a> +<span class="sourceLineNo">144</span><a name="line.144"></a> +<span class="sourceLineNo">145</span> // Keep locality based picker and cost function to alert them<a name="line.145"></a> +<span class="sourceLineNo">146</span> // when new services are offered<a name="line.146"></a> +<span class="sourceLineNo">147</span> private LocalityBasedCandidateGenerator localityCandidateGenerator;<a name="line.147"></a> +<span class="sourceLineNo">148</span> private ServerLocalityCostFunction localityCost;<a name="line.148"></a> +<span class="sourceLineNo">149</span> private RackLocalityCostFunction rackLocalityCost;<a name="line.149"></a> +<span class="sourceLineNo">150</span> private RegionReplicaHostCostFunction regionReplicaHostCostFunction;<a name="line.150"></a> +<span class="sourceLineNo">151</span> private RegionReplicaRackCostFunction regionReplicaRackCostFunction;<a name="line.151"></a> +<span class="sourceLineNo">152</span> private boolean isByTable = false;<a name="line.152"></a> +<span class="sourceLineNo">153</span> private TableName tableName = null;<a name="line.153"></a> +<span class="sourceLineNo">154</span><a name="line.154"></a> +<span class="sourceLineNo">155</span> /**<a name="line.155"></a> +<span class="sourceLineNo">156</span> * The constructor that pass a MetricsStochasticBalancer to BaseLoadBalancer to replace its<a name="line.156"></a> +<span class="sourceLineNo">157</span> * default MetricsBalancer<a name="line.157"></a> +<span class="sourceLineNo">158</span> */<a name="line.158"></a> +<span class="sourceLineNo">159</span> public StochasticLoadBalancer() {<a name="line.159"></a> +<span class="sourceLineNo">160</span> super(new MetricsStochasticBalancer());<a name="line.160"></a> +<span class="sourceLineNo">161</span> }<a name="line.161"></a> +<span class="sourceLineNo">162</span><a name="line.162"></a> +<span class="sourceLineNo">163</span> @Override<a name="line.163"></a> +<span class="sourceLineNo">164</span> public void onConfigurationChange(Configuration conf) {<a name="line.164"></a> +<span class="sourceLineNo">165</span> setConf(conf);<a name="line.165"></a> +<span class="sourceLineNo">166</span> }<a name="line.166"></a> +<span class="sourceLineNo">167</span><a name="line.167"></a> +<span class="sourceLineNo">168</span> @Override<a name="line.168"></a> +<span class="sourceLineNo">169</span> public synchronized void setConf(Configuration conf) {<a name="line.169"></a> +<span class="sourceLineNo">170</span> super.setConf(conf);<a name="line.170"></a> +<span class="sourceLineNo">171</span> maxSteps = conf.getInt(MAX_STEPS_KEY, maxSteps);<a name="line.171"></a> +<span class="sourceLineNo">172</span> stepsPerRegion = conf.getInt(STEPS_PER_REGION_KEY, stepsPerRegion);<a name="line.172"></a> +<span class="sourceLineNo">173</span> maxRunningTime = conf.getLong(MAX_RUNNING_TIME_KEY, maxRunningTime);<a name="line.173"></a> +<span class="sourceLineNo">174</span> runMaxSteps = conf.getBoolean(RUN_MAX_STEPS_KEY, runMaxSteps);<a name="line.174"></a> +<span class="sourceLineNo">175</span><a name="line.175"></a> +<span class="sourceLineNo">176</span> numRegionLoadsToRemember = conf.getInt(KEEP_REGION_LOADS, numRegionLoadsToRemember);<a name="line.176"></a> +<span class="sourceLineNo">177</span> isByTable = conf.getBoolean(HConstants.HBASE_MASTER_LOADBALANCE_BYTABLE, isByTable);<a name="line.177"></a> +<span class="sourceLineNo">178</span> minCostNeedBalance = conf.getFloat(MIN_COST_NEED_BALANCE_KEY, minCostNeedBalance);<a name="line.178"></a> +<span class="sourceLineNo">179</span> if (localityCandidateGenerator == null) {<a name="line.179"></a> +<span class="sourceLineNo">180</span> localityCandidateGenerator = new LocalityBasedCandidateGenerator(services);<a name="line.180"></a> +<span class="sourceLineNo">181</span> }<a name="line.181"></a> +<span class="sourceLineNo">182</span> localityCost = new ServerLocalityCostFunction(conf, services);<a name="line.182"></a> +<span class="sourceLineNo">183</span> rackLocalityCost = new RackLocalityCostFunction(conf, services);<a name="line.183"></a> +<span class="sourceLineNo">184</span><a name="line.184"></a> +<span class="sourceLineNo">185</span> if (this.candidateGenerators == null) {<a name="line.185"></a> +<span class="sourceLineNo">186</span> candidateGenerators = Lists.newArrayList();<a name="line.186"></a> +<span class="sourceLineNo">187</span> candidateGenerators.add(new RandomCandidateGenerator());<a name="line.187"></a> +<span class="sourceLineNo">188</span> candidateGenerators.add(new LoadCandidateGenerator());<a name="line.188"></a> +<span class="sourceLineNo">189</span> candidateGenerators.add(localityCandidateGenerator);<a name="line.189"></a> +<span class="sourceLineNo">190</span> candidateGenerators.add(new RegionReplicaRackCandidateGenerator());<a name="line.190"></a> +<span class="sourceLineNo">191</span> }<a name="line.191"></a> +<span class="sourceLineNo">192</span> regionLoadFunctions = new CostFromRegionLoadFunction[] {<a name="line.192"></a> +<span class="sourceLineNo">193</span> new ReadRequestCostFunction(conf),<a name="line.193"></a> +<span class="sourceLineNo">194</span> new WriteRequestCostFunction(conf),<a name="line.194"></a> +<span class="sourceLineNo">195</span> new MemStoreSizeCostFunction(conf),<a name="line.195"></a> +<span class="sourceLineNo">196</span> new StoreFileCostFunction(conf)<a name="line.196"></a> +<span class="sourceLineNo">197</span> };<a name="line.197"></a> +<span class="sourceLineNo">198</span> regionReplicaHostCostFunction = new RegionReplicaHostCostFunction(conf);<a name="line.198"></a> +<span class="sourceLineNo">199</span> regionReplicaRackCostFunction = new RegionReplicaRackCostFunction(conf);<a name="line.199"></a> +<span class="sourceLineNo">200</span> costFunctions = new CostFunction[]{<a name="line.200"></a> +<span class="sourceLineNo">201</span> new RegionCountSkewCostFunction(conf),<a name="line.201"></a> +<span class="sourceLineNo">202</span> new PrimaryRegionCountSkewCostFunction(conf),<a name="line.202"></a> +<span class="sourceLineNo">203</span> new MoveCostFunction(conf),<a name="line.203"></a> +<span class="sourceLineNo">204</span> localityCost,<a name="line.204"></a> +<span class="sourceLineNo">205</span> rackLocalityCost,<a name="line.205"></a> +<span class="sourceLineNo">206</span> new TableSkewCostFunction(conf),<a name="line.206"></a> +<span class="sourceLineNo">207</span> regionReplicaHostCostFunction,<a name="line.207"></a> +<span class="sourceLineNo">208</span> regionReplicaRackCostFunction,<a name="line.208"></a> +<span class="sourceLineNo">209</span> regionLoadFunctions[0],<a name="line.209"></a> +<span class="sourceLineNo">210</span> regionLoadFunctions[1],<a name="line.210"></a> +<span class="sourceLineNo">211</span> regionLoadFunctions[2],<a name="line.211"></a> +<span class="sourceLineNo">212</span> regionLoadFunctions[3],<a name="line.212"></a> +<span class="sourceLineNo">213</span> };<a name="line.213"></a> +<span class="sourceLineNo">214</span> curFunctionCosts= new Double[costFunctions.length];<a name="line.214"></a> +<span class="sourceLineNo">215</span> tempFunctionCosts= new Double[costFunctions.length];<a name="line.215"></a> +<span class="sourceLineNo">216</span> LOG.info("Loaded config; maxSteps=" + maxSteps + ", stepsPerRegion=" + stepsPerRegion +<a name="line.216"></a> +<span class="sourceLineNo">217</span> ", maxRunningTime=" + maxRunningTime + ", isByTable=" + isByTable + ", etc.");<a name="line.217"></a> +<span class="sourceLineNo">218</span> }<a name="line.218"></a> +<span class="sourceLineNo">219</span><a name="line.219"></a> +<span class="sourceLineNo">220</span> protected void setCandidateGenerators(List<CandidateGenerator> customCandidateGenerators) {<a name="line.220"></a> +<span class="sourceLineNo">221</span> this.candidateGenerators = customCandidateGenerators;<a name="line.221"></a> +<span class="sourceLineNo">222</span> }<a name="line.222"></a> +<span class="sourceLineNo">223</span><a name="line.223"></a> +<span class="sourceLineNo">224</span> @Override<a name="line.224"></a> +<span class="sourceLineNo">225</span> protected void setSlop(Configuration conf) {<a name="line.225"></a> +<span class="sourceLineNo">226</span> this.slop = conf.getFloat("hbase.regions.slop", 0.001F);<a name="line.226"></a> +<span class="sourceLineNo">227</span> }<a name="line.227"></a> +<span class="sourceLineNo">228</span><a name="line.228"></a> +<span class="sourceLineNo">229</span> @Override<a name="line.229"></a> +<span class="sourceLineNo">230</span> public synchronized void setClusterStatus(ClusterStatus st) {<a name="line.230"></a> +<span class="sourceLineNo">231</span> super.setClusterStatus(st);<a name="line.231"></a> +<span class="sourceLineNo">232</span> updateRegionLoad();<a name="line.232"></a> +<span class="sourceLineNo">233</span> for(CostFromRegionLoadFunction cost : regionLoadFunctions) {<a name="line.233"></a> +<span class="sourceLineNo">234</span> cost.setClusterStatus(st);<a name="line.234"></a> +<span class="sourceLineNo">235</span> }<a name="line.235"></a> +<span class="sourceLineNo">236</span><a name="line.236"></a> +<span class="sourceLineNo">237</span> // update metrics size<a name="line.237"></a> +<span class="sourceLineNo">238</span> try {<a name="line.238"></a> +<span class="sourceLineNo">239</span> // by-table or ensemble mode<a name="line.239"></a> +<span class="sourceLineNo">240</span> int tablesCount = isByTable ? services.getTableDescriptors().getAll().size() : 1;<a name="line.240"></a> +<span class="sourceLineNo">241</span> int functionsCount = getCostFunctionNames().length;<a name="line.241"></a> +<span class="sourceLineNo">242</span><a name="line.242"></a> +<span class="sourceLineNo">243</span> updateMetricsSize(tablesCount * (functionsCount + 1)); // +1 for overall<a name="line.243"></a> +<span class="sourceLineNo">244</span> } catch (Exception e) {<a name="line.244"></a> +<span class="sourceLineNo">245</span> LOG.error("failed to get the size of all tables", e);<a name="line.245"></a> +<span class="sourceLineNo">246</span> }<a name="line.246"></a> +<span class="sourceLineNo">247</span> }<a name="line.247"></a> +<span class="sourceLineNo">248</span><a name="line.248"></a> +<span class="sourceLineNo">249</span> /**<a name="line.249"></a> +<span class="sourceLineNo">250</span> * Update the number of metrics that are reported to JMX<a name="line.250"></a> +<span class="sourceLineNo">251</span> */<a name="line.251"></a> +<span class="sourceLineNo">252</span> public void updateMetricsSize(int size) {<a name="line.252"></a> +<span class="sourceLineNo">253</span> if (metricsBalancer instanceof MetricsStochasticBalancer) {<a name="line.253"></a> +<span class="sourceLineNo">254</span> ((MetricsStochasticBalancer) metricsBalancer).updateMetricsSize(size);<a name="line.254"></a> +<span class="sourceLineNo">255</span> }<a name="line.255"></a> +<span class="sourceLineNo">256</span> }<a name="line.256"></a> +<span class="sourceLineNo">257</span><a name="line.257"></a> +<span class="sourceLineNo">258</span> @Override<a name="line.258"></a> +<span class="sourceLineNo">259</span> public synchronized void setMasterServices(MasterServices masterServices) {<a name="line.259"></a> +<span class="sourceLineNo">260</span> super.setMasterServices(masterServices);<a name="line.260"></a> +<span class="sourceLineNo">261</span> this.localityCost.setServices(masterServices);<a name="line.261"></a> +<span class="sourceLineNo">262</span> this.rackLocalityCost.setServices(masterServices);<a name="line.262"></a> +<span class="sourceLineNo">263</span> this.localityCandidateGenerator.setServices(masterServices);<a name="line.263"></a> +<span class="sourceLineNo">264</span> }<a name="line.264"></a> +<span class="sourceLineNo">265</span><a name="line.265"></a> +<span class="sourceLineNo">266</span> @Override<a name="line.266"></a> +<span class="sourceLineNo">267</span> protected synchronized boolean areSomeRegionReplicasColocated(Cluster c) {<a name="line.267"></a> +<span class="sourceLineNo">268</span> regionReplicaHostCostFunction.init(c);<a name="line.268"></a> +<span class="sourceLineNo">269</span> if (regionReplicaHostCostFunction.cost() > 0) return true;<a name="line.269"></a> +<span class="sourceLineNo">270</span> regionReplicaRackCostFunction.init(c);<a name="line.270"></a> +<span class="sourceLineNo">271</span> if (regionReplicaRackCostFunction.cost() > 0) return true;<a name="line.271"></a> +<span class="sourceLineNo">272</span> return false;<a name="line.272"></a> +<span class="sourceLineNo">273</span> }<a name="line.273"></a> +<span class="sourceLineNo">274</span><a name="line.274"></a> +<span class="sourceLineNo">275</span> @Override<a name="line.275"></a> +<span class="sourceLineNo">276</span> protected boolean needsBalance(Cluster cluster) {<a name="line.276"></a> +<span class="sourceLineNo">277</span> ClusterLoadState cs = new ClusterLoadState(cluster.clusterState);<a name="line.277"></a> +<span class="sourceLineNo">278</span> if (cs.getNumServers() < MIN_SERVER_BALANCE) {<a name="line.278"></a> +<span class="sourceLineNo">279</span> if (LOG.isDebugEnabled()) {<a name="line.279"></a> +<span class="sourceLineNo">280</span> LOG.debug("Not running balancer because only " + cs.getNumServers()<a name="line.280"></a> +<span class="sourceLineNo">281</span> + " active regionserver(s)");<a name="line.281"></a> +<span class="sourceLineNo">282</span> }<a name="line.282"></a> +<span class="sourceLineNo">283</span> return false;<a name="line.283"></a> +<span class="sourceLineNo">284</span> }<a name="line.284"></a> +<span class="sourceLineNo">285</span> if (areSomeRegionReplicasColocated(cluster)) {<a name="line.285"></a> +<span class="sourceLineNo">286</span> return true;<a name="line.286"></a> +<span class="sourceLineNo">287</span> }<a name="line.287"></a> +<span class="sourceLineNo">288</span><a name="line.288"></a> +<span class="sourceLineNo">289</span> double total = 0.0;<a name="line.289"></a> +<span class="sourceLineNo">290</span> float sumMultiplier = 0.0f;<a name="line.290"></a> +<span class="sourceLineNo">291</span> for (CostFunction c : costFunctions) {<a name="line.291"></a> +<span class="sourceLineNo">292</span> float multiplier = c.getMultiplier();<a name="line.292"></a> +<span class="sourceLineNo">293</span> if (multiplier <= 0) {<a name="line.293"></a> +<span class="sourceLineNo">294</span> continue;<a name="line.294"></a> +<span class="sourceLineNo">295</span> }<a name="line.295"></a> +<span class="sourceLineNo">296</span> if (!c.isNeeded()) {<a name="line.296"></a> +<span class="sourceLineNo">297</span> LOG.debug(c.getClass().getName() + " indicated that its cost should not be considered");<a name="line.297"></a> +<span class="sourceLineNo">298</span> continue;<a name="line.298"></a> +<span class="sourceLineNo">299</span> }<a name="line.299"></a> +<span class="sourceLineNo">300</span> sumMultiplier += multiplier;<a name="line.300"></a> +<span class="sourceLineNo">301</span> total += c.cost() * multiplier;<a name="line.301"></a> +<span class="sourceLineNo">302</span> }<a name="line.302"></a> +<span class="sourceLineNo">303</span><a name="line.303"></a> +<span class="sourceLineNo">304</span> if (total <= 0 || sumMultiplier <= 0<a name="line.304"></a> +<span class="sourceLineNo">305</span> || (sumMultiplier > 0 && (total / sumMultiplier) < minCostNeedBalance)) {<a name="line.305"></a> +<span class="sourceLineNo">306</span> if (LOG.isTraceEnabled()) {<a name="line.306"></a> +<span class="sourceLineNo">307</span> LOG.trace("Skipping load balancing because balanced cluster; " + "total cost is " + total<a name="line.307"></a> +<span class="sourceLineNo">308</span> + ", sum multiplier is " + sumMultiplier + " min cost which need balance is "<a name="line.308"></a> +<span class="sourceLineNo">309</span> + minCostNeedBalance);<a name="line.309"></a> +<span class="sourceLineNo">310</span> }<a name="line.310"></a> +<span class="sourceLineNo">311</span> return false;<a name="line.311"></a> +<span class="sourceLineNo">312</span> }<a name="line.312"></a> +<span class="sourceLineNo">313</span> return true;<a name="line.313"></a> +<span class="sourceLineNo">314</span> }<a name="line.314"></a> +<span class="sourceLineNo">315</span><a name="line.315"></a> +<span class="sourceLineNo">316</span> @Override<a name="line.316"></a> +<span class="sourceLineNo">317</span> public synchronized List<RegionPlan> balanceCluster(TableName tableName, Map<ServerName,<a name="line.317"></a> +<span class="sourceLineNo">318</span> List<RegionInfo>> clusterState) {<a name="line.318"></a> +<span class="sourceLineNo">319</span> this.tableName = tableName;<a name="line.319"></a> +<span class="sourceLineNo">320</span> return balanceCluster(clusterState);<a name="line.320"></a> +<span class="sourceLineNo">321</span> }<a name="line.321"></a> +<span class="sourceLineNo">322</span><a name="line.322"></a> +<span class="sourceLineNo">323</span> @VisibleForTesting<a name="line.323"></a> +<span class="sourceLineNo">324</span> Cluster.Action nextAction(Cluster cluster) {<a name="line.324"></a> +<span class="sourceLineNo">325</span> return candidateGenerators.get(RANDOM.nextInt(candidateGenerators.size()))<a name="line.325"></a> +<span class="sourceLineNo">326</span> .generate(cluster);<a name="line.326"></a> +<span class="sourceLineNo">327</span> }<a name="line.327"></a> +<span class="sourceLineNo">328</span><a name="line.328"></a> +<span class="sourceLineNo">329</span> /**<a name="line.329"></a> +<span class="sourceLineNo">330</span> * Given the cluster state this will try and approach an optimal balance. This<a name="line.330"></a> +<span class="sourceLineNo">331</span> * should always approach the optimal state given enough steps.<a name="line.331"></a> +<span class="sourceLineNo">332</span> */<a name="line.332"></a> +<span class="sourceLineNo">333</span> @Override<a name="line.333"></a> +<span class="sourceLineNo">334</span> public synchronized List<RegionPlan> balanceCluster(Map<ServerName,<a name="line.334"></a> +<span class="sourceLineNo">335</span> List<RegionInfo>> clusterState) {<a name="line.335"></a> +<span class="sourceLineNo">336</span> List<RegionPlan> plans = balanceMasterRegions(clusterState);<a name="line.336"></a> +<span class="sourceLineNo">337</span> if (plans != null || clusterState == null || clusterState.size() <= 1) {<a name="line.337"></a> +<span class="sourceLineNo">338</span> return plans;<a name="line.338"></a> +<span class="sourceLineNo">339</span> }<a name="line.339"></a> +<span class="sourceLineNo">340</span><a name="line.340"></a> +<span class="sourceLineNo">341</span> if (masterServerName != null && clusterState.containsKey(masterServerName)) {<a name="line.341"></a> +<span class="sourceLineNo">342</span> if (clusterState.size() <= 2) {<a name="line.342"></a> +<span class="sourceLineNo">343</span> return null;<a name="line.343"></a> +<span class="sourceLineNo">344</span> }<a name="line.344"></a> +<span class="sourceLineNo">345</span> clusterState = new HashMap<>(clusterState);<a name="line.345"></a> +<span class="sourceLineNo">346</span> clusterState.remove(masterServerName);<a name="line.346"></a> +<span class="sourceLineNo">347</span> }<a name="line.347"></a> +<span class="sourceLineNo">348</span><a name="line.348"></a> +<span class="sourceLineNo">349</span> // On clusters with lots of HFileLinks or lots of reference files,<a name="line.349"></a> +<span class="sourceLineNo">350</span> // instantiating the storefile infos can be quite expensive.<a name="line.350"></a> +<span class="sourceLineNo">351</span> // Allow turning this feature off if the locality cost is not going to<a name="line.351"></a> +<span class="sourceLineNo">352</span> // be used in any computations.<a name="line.352"></a> +<span class="sourceLineNo">353</span> RegionLocationFinder finder = null;<a name="line.353"></a> +<span class="sourceLineNo">354</span> if (this.localityCost != null && this.localityCost.getMultiplier() > 0<a name="line.354"></a> +<span class="sourceLineNo">355</span> || this.rackLocalityCost != null && this.rackLocalityCost.getMultiplier() > 0) {<a name="line.355"></a> +<span class="sourceLineNo">356</span> finder = this.regionFinder;<a name="line.356"></a> +<span class="sourceLineNo">357</span> }<a name="line.357"></a> +<span class="sourceLineNo">358</span><a name="line.358"></a> +<span class="sourceLineNo">359</span> //The clusterState that is given to this method contains the state<a name="line.359"></a> +<span class="sourceLineNo">360</span> //of all the regions in the table(s) (that's true today)<a name="line.360"></a> +<span class="sourceLineNo">361</span> // Keep track of servers to iterate through them.<a name="line.361"></a> +<span class="sourceLineNo">362</span> Cluster cluster = new Cluster(clusterState, loads, finder, rackManager);<a name="line.362"></a> +<span class="sourceLineNo">363</span><a name="line.363"></a> +<span class="sourceLineNo">364</span> long startTime = EnvironmentEdgeManager.currentTime();<a name="line.364"></a> +<span class="sourceLineNo">365</span><a name="line.365"></a> +<span class="sourceLineNo">366</span> initCosts(cluster);<a name="line.366"></a> +<span class="sourceLineNo">367</span><a name="line.367"></a> +<span class="sourceLineNo">368</span> if (!needsBalance(cluster)) {<a name="line.368"></a> +<span class="sourceLineNo">369</span> return null;<a name="line.369"></a> +<span class="sourceLineNo">370</span> }<a name="line.370"></a> +<span class="sourceLineNo">371</span><a name="line.371"></a> +<span class="sourceLineNo">372</span> double currentCost = computeCost(cluster, Double.MAX_VALUE);<a name="line.372"></a> +<span class="sourceLineNo">373</span> curOverallCost = currentCost;<a name="line.373"></a> +<span class="sourceLineNo">374</span> for (int i = 0; i < this.curFunctionCosts.length; i++) {<a name="line.374"></a> +<span class="sourceLineNo">375</span> curFunctionCosts[i] = tempFunctionCosts[i];<a name="line.375"></a> +<span class="sourceLineNo">376</span> }<a name="line.376"></a> +<span class="sourceLineNo">377</span> LOG.info("start StochasticLoadBalancer.balancer, initCost=" + currentCost + ", functionCost="<a name="line.377"></a> +<span class="sourceLineNo">378</span> + functionCost());<a name="line.378"></a> +<span class="sourceLineNo">379</span><a name="line.379"></a> +<span class="sourceLineNo">380</span> double initCost = currentCost;<a name="line.380"></a> +<span class="sourceLineNo">381</span> double newCost = currentCost;<a name="line.381"></a> +<span class="sourceLineNo">382</span><a name="line.382"></a> +<span class="sourceLineNo">383</span> long computedMaxSteps;<a name="line.383"></a> +<span class="sourceLineNo">384</span> if (runMaxSteps) {<a name="line.384"></a> +<span class="sourceLineNo">385</span> computedMaxSteps = Math.max(this.maxSteps,<a name="line.385"></a> +<span class="sourceLineNo">386</span> ((long)cluster.numRegions * (long)this.stepsPerRegion * (long)cluster.numServers));<a name="line.386"></a> +<span class="sourceLineNo">387</span> } else {<a name="line.387"></a> +<span class="sourceLineNo">388</span> computedMaxSteps = Math.min(this.maxSteps,<a name="line.388"></a> +<span class="sourceLineNo">389</span> ((long)cluster.numRegions * (long)this.stepsPerRegion * (long)cluster.numServers));<a name="line.389"></a> +<span class="sourceLineNo">390</span> }<a name="line.390"></a> +<span class="sourceLineNo">391</span> // Perform a stochastic walk to see if we can get a good fit.<a name="line.391"></a> +<span class="sourceLineNo">392</span> long step;<a name="line.392"></a> +<span class="sourceLineNo">393</span><a name="line.393"></a> +<span class="sourceLineNo">394</span> for (step = 0; step < computedMaxSteps; step++) {<a name="line.394"></a> +<span class="sourceLineNo">395</span> Cluster.Action action = nextAction(cluster);<a name="line.395"></a> +<span class="sourceLineNo">396</span><a name="line.396"></a> +<span class="sourceLineNo">397</span> if (action.type == Type.NULL) {<a name="line.397"></a> +<span class="sourceLineNo">398</span> continue;<a name="line.398"></a> +<span class="sourceLineNo">399</span> }<a name="line.399"></a> +<span class="sourceLineNo">400</span><a name="line.400"></a> +<span class="sourceLineNo">401</span> cluster.doAction(action);<a name="line.401"></a> +<span class="sourceLineNo">402</span> updateCostsWithAction(cluster, action);<a name="line.402"></a> +<span class="sourceLineNo">403</span><a name="line.403"></a> +<span class="sourceLineNo">404</span> newCost = computeCost(cluster, currentCost);<a name="line.404"></a> +<span class="sourceLineNo">405</span><a name="line.405"></a> +<span class="sourceLineNo">406</span> // Should this be kept?<a name="line.406"></a> +<span class="sourceLineNo">407</span> if (newCost < currentCost) {<a name="line.407"></a> +<span class="sourceLineNo">408</span> currentCost = newCost;<a name="line.408"></a> +<span class="sourceLineNo">409</span><a name="line.409"></a> +<span class="sourceLineNo">410</span> // save for JMX<a name="line.410"></a> +<span class="sourceLineNo">411</span> curOverallCost = currentCost;<a name="line.411"></a> +<span class="sourceLineNo">412</span> for (int i = 0; i < this.curFunctionCosts.length; i++) {<a name="line.412"></a> +<span class="sourceLineNo">413</span> curFunctionCosts[i] = tempFunctionCosts[i];<a name="line.413"></a> +<span class="sourceLineNo">414</span> }<a name="line.414"></a> +<span class="sourceLineNo">415</span> } else {<a name="line.415"></a> +<span class="sourceLineNo">416</span> // Put things back the way they were before.<a name="line.416"></a> +<span class="sourceLineNo">417</span> // TODO: undo by remembering old values<a name="line.417"></a> +<span class="sourceLineNo">418</span> Action undoAction = action.undoAction();<a name="line.418"></a> +<span class="sourceLineNo">419</span> cluster.doAction(undoAction);<a name="line.419"></a> +<span class="sourceLineNo">420</span> updateCostsWithAction(cluster, undoAction);<a name="line.420"></a> +<span class="sourceLineNo">421</span> }<a name="line.421"></a> +<span class="sourceLineNo">422</span><a name="line.422"></a> +<span class="sourceLineNo">423</span> if (EnvironmentEdgeManager.currentTime() - startTime ><a name="line.423"></a> +<span class="sourceLineNo">424</span> maxRunningTime) {<a name="line.424"></a> +<span class="sourceLineNo">425</span> break;<a name="line.425"></a> +<span class="sourceLineNo">426</span> }<a name="line.426"></a> +<span class="sourceLineNo">427</span> }<a name="line.427"></a> +<span class="sourceLineNo">428</span> long endTime = EnvironmentEdgeManager.currentTime();<a name="line.428"></a> +<span class="sourceLineNo">429</span><a name="line.429"></a> +<span class="sourceLineNo">430</span> metricsBalancer.balanceCluster(endTime - startTime);<a name="line.430"></a> +<span class="sourceLineNo">431</span><a name="line.431"></a> +<span class="sourceLineNo">432</span> // update costs metrics<a name="line.432"></a> +<span class="sourceLineNo">433</span> updateStochasticCosts(tableName, curOverallCost, curFunctionCosts);<a name="line.433"></a> +<span class="sourceLineNo">434</span> if (initCost > currentCost) {<a name="line.434"></a> +<span class="sourceLineNo">435</span> plans = createRegionPlans(cluster);<a name="line.435"></a> +<span class="sourceLineNo">436</span> if (LOG.isDebugEnabled()) {<a name="line.436"></a> +<span class="sourceLineNo">437</span> LOG.debug("Finished computing new load balance plan. Computation took "<a name="line.437"></a> +<span class="sourceLineNo">438</span> + (endTime - startTime) + "ms to try " + step<a name="line.438"></a> +<span class="sourceLineNo">439</span> + " different iterations. Found a solution that moves "<a name="line.439"></a> +<span class="sourceLineNo">440</span> + plans.size() + " regions; Going from a computed cost of "<a name="line.440"></a> +<span class="sourceLineNo">441</span> + initCost + " to a new cost of " + currentCost);<a name="line.441"></a> +<span class="sourceLineNo">442</span> }<a name="line.442"></a> +<span class="sourceLineNo">443</span><a name="line.443"></a> +<span class="sourceLineNo">444</span> return plans;<a name="line.444"></a> +<span class="sourceLineNo">445</span> }<a name="line.445"></a> +<span class="sourceLineNo">446</span> if (LOG.isDebugEnabled()) {<a name="line.446"></a> +<span class="sourceLineNo">447</span> LOG.debug("Could not find a better load balance plan. Tried "<a name="line.447"></a> +<span class="sourceLineNo">448</span> + step + " different configurations in " + (endTime - startTime)<a name="line.448"></a> +<span class="sourceLineNo">449</span> + "ms, and did not find anything with a computed cost less than " + initCost);<a name="line.449"></a> +<span class="sourceLineNo">450</span> }<a name="line.450"></a> +<span class="sourceLineNo">451</span> return null;<a name="line.451"></a> +<span class="sourceLineNo">452</span> }<a name="line.452"></a> +<span class="sourceLineNo">453</span><a name="line.453"></a> +<span class="sourceLineNo">454</span> /**<a name="line.454"></a> +<span class="sourceLineNo">455</span> * update costs to JMX<a name="line.455"></a> +<span class="sourceLineNo">456</span> */<a name="line.456"></a> +<span class="sourceLineNo">457</span> private void updateStochasticCosts(TableName tableName, Double overall, Double[] subCosts) {<a name="line.457"></a> +<span class="sourceLineNo">458</span> if (tableName == null) return;<a name="line.458"></a> +<span class="sourceLineNo">459</span><a name="line.459"></a> +<span class="sourceLineNo">460</span> // check if the metricsBalancer is MetricsStochasticBalancer before casting<a name="line.460"></a> +<span class="sourceLineNo">461</span> if (metricsBalancer instanceof MetricsStochasticBalancer) {<a name="line.461"></a> +<span class="sourceLineNo">462</span> MetricsStochasticBalancer balancer = (MetricsStochasticBalancer) metricsBalancer;<a name="line.462"></a> +<span class="sourceLineNo">463</span> // overall cost<a name="line.463"></a> +<span class="sourceLineNo">464</span> balancer.updateStochasticCost(tableName.getNameAsString(),<a name="line.464"></a> +<span class="sourceLineNo">465</span> "Overall", "Overall cost", overall);<a name="line.465"></a> +<span class="sourceLineNo">466</span><a name="line.466"></a> +<span class="sourceLineNo">467</span> // each cost function<a name="line.467"></a> +<span class="sourceLineNo">468</span> for (int i = 0; i < costFunctions.length; i++) {<a name="line.468"></a> +<span class="sourceLineNo">469</span> CostFunction costFunction = costFunctions[i];<a name="line.469"></a> +<span class="sourceLineNo">470</span> String costFunctionName = costFunction.getClass().getSimpleName();<a name="line.470"></a> +<span class="sourceLineNo">471</span> Double costPercent = (overall == 0) ? 0 : (subCosts[i] / overall);<a name="line.471"></a> +<span class="sourceLineNo">472</span> // TODO: cost function may need a specific description<a name="line.472"></a> +<span class="sourceLineNo">473</span> balancer.updateStochasticCost(tableName.getNameAsString(), costFunctionName,<a name="line.473"></a> +<span class="sourceLineNo">474</span> "The percent of " + costFunctionName, costPercent);<a name="line.474"></a> +<span class="sourceLineNo">475</span> }<a name="line.475"></a> +<span class="sourceLineNo">476</span> }<a name="line.476"></a> +<span class="sourceLineNo">477</span> }<a name="line.477"></a> +<span class="sourceLineNo">478</span><a name="line.478"></a> +<span class="sourceLineNo">479</span> private String functionCost() {<a name="line.479"></a> +<span class="sourceLineNo">480</span> StringBuilder builder = new StringBuilder();<a name="line.480"></a> +<span class="sourceLineNo">481</span> for (CostFunction c:costFunctions) {<a name="line.481"></a> +<span class="sourceLineNo">482</span> builder.append(c.getClass().getSimpleName());<a name="line.482"></a> +<span class="sourceLineNo">483</span> builder.append(" : (");<a name="line.483"></a> +<span class="sourceLineNo">484</span> builder.append(c.getMultiplier());<a name="line.484"></a> +<span class="sourceLineNo">485</span> builder.append(", ");<a name="line.485"></a> +<span class="sourceLineNo">486</span> builder.append(c.cost());<a name="line.486"></a> +<span class="sourceLineNo">487</span> builder.append("); ");<a name="line.487"></a> +<span class="sourceLineNo">488</span> }<a name="line.488"></a> +<span class="sourceLineNo">489</span> return builder.toString();<a name="line.489"></a> +<span class="sourceLineNo">490</span> }<a name="line.490"></a> +<span class="sourceLineNo">491</span><a name="line.491"></a> +<span class="sourceLineNo">492</span> /**<a name="line.492"></a> +<span class="sourceLineNo">493</span> * Create all of the RegionPlan's needed to move from the initial cluster state to the desired<a name="line.493"></a> +<span class="sourceLineNo">494</span> * state.<a name="line.494"></a> +<span class="sourceLineNo">495</span> *<a name="line.495"></a> +<span class="sourceLineNo">496</span> * @param cluster The state of the cluster<a name="line.496"></a> +<span class="sourceLineNo">497</span> * @return List of RegionPlan's that represent the moves needed to get to desired final state.<a name="line.497"></a> +<span class="sourceLineNo">498</span> */<a name="line.498"></a> +<span class="sourceLineNo">499</span> private List<RegionPlan> createRegionPlans(Cluster cluster) {<a name="line.499"></a> +<span class="sourceLineNo">500</span> List<RegionPlan> plans = new LinkedList<>();<a name="line.500"></a> +<span class="sourceLineNo">501</span> for (int regionIndex = 0;<a name="line.501"></a> +<span class="sourceLineNo">502</span> regionIndex < cluster.regionIndexToServerIndex.length; regionIndex++) {<a name="line.502"></a> +<span class="sourceLineNo">503</span> int initialServerIndex = cluster.initialRegionIndexToServerIndex[regionIndex];<a name="line.503"></a> +<span class="sourceLineNo">504</span> int newServerIndex = cluster.regionIndexToServerIndex[regionIndex];<a name="line.504"></a> +<span class="sourceLineNo">505</span><a name="line.505"></a> +<span class="sourceLineNo">506</span> if (initialServerIndex != newServerIndex) {<a name="line.506"></a> +<span class="sourceLineNo">507</span> RegionInfo region = cluster.regions[regionIndex];<a name="line.507"></a> +<span class="sourceLineNo">508</span> ServerName initialServer = cluster.servers[initialServerIndex];<a name="line.508"></a> +<span class="sourceLineNo">509</span> ServerName newServer = cluster.servers[newServerIndex];<a name="line.509"></a> +<span class="sourceLineNo">510</span><a name="line.510"></a> +<span class="sourceLineNo">511</span> if (LOG.isTraceEnabled()) {<a name="line.511"></a> +<span class="sourceLineNo">512</span> LOG.trace("Moving Region " + region.getEncodedName() + " from server "<a name="line.512"></a> +<span class="sourceLineNo">513</span> + initialServer.getHostname() + " to " + newServer.getHostname());<a name="line.513"></a> +<span class="sourceLineNo">514</span> }<a name="line.514"></a> +<span class="sourceLineNo">515</span> RegionPlan rp = new RegionPlan(region, initialServer, newServer);<a name="line.515"></a> +<span class="sourceLineNo">516</span> plans.add(rp);<a name="line.516"></a> +<span class="sourceLineNo">517</span> }<a name="line.517"></a> +<span class="sourceLineNo">518</span> }<a name="line.518"></a> +<span class="sourceLineNo">519</span> return plans;<a name="line.519"></a> +<span class="sourceLineNo">520</span> }<a name="line.520"></a> +<span class="sourceLineNo">521</span><a name="line.521"></a> +<span class="sourceLineNo">522</span> /**<a name="line.522"></a> +<span class="sourceLineNo">523</span> * Store the current region loads.<a name="line.523"></a> +<span class="sourceLineNo">524</span> */<a name="line.524"></a> +<span class="sourceLineNo">525</span> private synchronized void updateRegionLoad() {<a name="line.525"></a> +<span class="sourceLineNo">526</span> // We create a new hashmap so that regions that are no longer there are removed.<a name="line.526"></a> +<span class="sourceLineNo">527</span> // However we temporarily need the old loads so we can use them to keep the rolling average.<a name="line.527"></a> +<span class="sourceLineNo">528</span> Map<String, Deque<BalancerRegionLoad>> oldLoads = loads;<a name="line.528"></a> +<span class="sourceLineNo">529</span> loads = new HashMap<>();<a name="line.529"></a> +<span class="sourceLineNo">530</span><a name="line.530"></a> +<span class="sourceLineNo">531</span> for (ServerName sn : clusterStatus.getServers()) {<a name="line.531"></a> +<span class="sourceLineNo">532</span> ServerLoad sl = clusterStatus.getLoad(sn);<a name="line.532"></a> +<span class="sourceLineNo">533</span> if (sl == null) {<a name="line.533"></a> +<span class="sourceLineNo">534</span> continue;<a name="line.534"></a> +<span class="sourceLineNo">535</span> }<a name="line.535"></a> +<span class="sourceLineNo">536</span> for (Entry<byte[], RegionLoad> entry : sl.getRegionsLoad().entrySet()) {<a name="line.536"></a> +<span class="sourceLineNo">537</span> Deque<BalancerRegionLoad> rLoads = oldLoads.get(Bytes.toString(entry.getKey()));<a name="line.537"></a> +<span class="sourceLineNo">538</span> if (rLoads == null) {<a name="line.538"></a> +<span class="sourceLineNo">539</span> // There was nothing there<a name="line.539"></a> +<span class="sourceLineNo">540</span> rLoads = new ArrayDeque<>();<a name="line.540"></a> +<span class="sourceLineNo">541</span> } else if (rLoads.size() >= numRegionLoadsToRemember) {<a name="line.541"></a> +<span class="sourceLineNo">542</span> rLoads.remove();<a name="line.542"></a> +<span class="sourceLineNo">543</span> }<a name="line.543"></a> +<span class="sourceLineNo">544</span> rLoads.add(new BalancerRegionLoad(entry.getValue()));<a name="line.544"></a> +<span class="sourceLineNo">545</span> loads.put(Bytes.toString(entry.getKey()), rLoads);<a name="line.545"></a> +<span class="sourceLineNo">546</span> }<a name="line.546"></a> +<span class="sourceLineNo">547</span> }<a name="line.547"></a> +<span class="sourceLineNo">548</span><a name="line.548"></a> +<span class="sourceLineNo">549</span> for(CostFromRegionLoadFunction cost : regionLoadFunctions) {<a name="line.549"></a> +<span class="sourceLineNo">550</span> cost.setLoads(loads);<a name="line.550"></a> +<span class="sourceLineNo">551</span> }<a name="line.551"></a> +<span class="sourceLineNo">552</span> }<a name="line.552"></a> +<span class="sourceLineNo">553</span><a name="line.553"></a> +<span class="sourceLineNo">554</span> protected void initCosts(Cluster cluster) {<a name="line.554"></a> +<span class="sourceLineNo">555</span> for (CostFunction c:costFunctions) {<a name="line.555"></a> +<span class="sourceLineNo">556</span> c.init(cluster);<a name="line.556"></a> +<span class="sourceLineNo">557</span> }<a name="line.557"></a> +<span class="sourceLineNo">558</span> }<a name="line.558"></a> +<span class="sourceLineNo">559</span><a name="line.559"></a> +<span class="sourceLineNo">560</span> protected void updateCostsWithAction(Cluster cluster, Action action) {<a name="line.560"></a> +<span class="sourceLineNo">561</span> for (CostFunction c : costFunctions) {<a name="line.561"></a> +<span class="sourceLineNo">562</span> c.postAction(action);<a name="line.562"></a> +<span class="sourceLineNo">563</span> }<a name="line.563"></a> +<span class="sourceLineNo">564</span> }<a name="line.564"></a> +<span class="sourceLineNo">565</span><a name="line.565"></a> +<span class="sourceLineNo">566</span> /**<a name="line.566"></a> +<span class="sourceLineNo">567</span> * Get the names of the cost functions<a name="line.567"></a> +<span class="sourceLineNo">568</span> */<a name="line.568"></a> +<span class="sourceLineNo">569</span> public String[] getCostFunctionNames() {<a name="line.569"></a> +<span class="sourceLineNo">570</span> if (costFunctions == null) return null;<a name="line.570"></a> +<span class="sourceLineNo">571</span> String[] ret = new String[costFunctions.length];<a name="line.571"></a> +<span class="sourceLineNo">572</span> for (int i = 0; i < costFunctions.length; i++) {<a name="line.572"></a> +<span class="sourceLineNo">573</span> CostFunction c = costFunctions[i];<a name="line.573"></a> +<span class="sourceLineNo">574</span> ret[i] = c.getClass().getSimpleName();<a name="line.574"></a> +<span class="sourceLineNo">575</span> }<a name="line.575"></a> +<span class="sourceLineNo">576</span><a name="line.576"></a> +<span class="sourceLineNo">577</span> return ret;<a name="line.577"></a> +<span class="sourceLineNo">578</span> }<a name="line.578"></a> +<span class="sourceLineNo">579</span><a name="line.579"></a> +<span class="sourceLineNo">580</span> /**<a name="line.580"></a> +<span class="sourceLineNo">581</span> * This is the main cost function. It will compute a cost associated with a proposed cluster<a name="line.581"></a> +<span class="sourceLineNo">582</span> * state. All different costs will be combined with their multipliers to produce a double cost.<a name="line.582"></a> +<span class="sourceLineNo">583</span> *<a name="line.583"></a> +<span class="sourceLineNo">584</span> * @param cluster The state of the cluster<a name="line.584"></a> +<span class="sourceLineNo">585</span> * @param previousCost the previous cost. This is used as an early out.<a name="line.585"></a> +<span class="sourceLineNo">586</span> * @return a double of a cost associated with the proposed cluster state. This cost is an<a name="line.586"></a> +<span class="sourceLineNo">587</span> * aggregate of all individual cost functions.<a name="line.587"></a> +<span class="sourceLineNo">588</span> */<a name="line.588"></a> +<span class="sourceLineNo">589</span> protected double computeCost(Cluster cluster, double previousCost) {<a name="line.589"></a> +<span class="sourceLineNo">590</span> double total = 0;<a name="line.590"></a> +<span class="sourceLineNo">591</span><a name="line.591"></a> +<span class="sourceLineNo">592</span> for (int i = 0; i < costFunctions.length; i++) {<a name="line.592"></a> +<span class="sourceLineNo">593</span> CostFunction c = costFunctions[i];<a name="line.593"></a> +<span class="sourceLineNo">594</span> this.tempFunctionCosts[i] = 0.0;<a name="line.594"></a> +<span class="sourceLineNo">595</span><a name="line.595"></a> +<span class="sourceLineNo">596</span> if (c.getMultiplier() <= 0) {<a name="line.596"></a> +<span class="sourceLineNo">597</span> continue;<a name="line.597"></a> +<span class="sourceLineNo">598</span> }<a name="line.598"></a> +<span class="sourceLineNo">599</span><a name="line.599"></a> +<span class="sourceLineNo">600</span> Float multiplier = c.getMultiplier();<a name="line.600"></a> +<span class="sourceLineNo">601</span> Double cost = c.cost();<a name="line.601"></a> +<span class="sourceLineNo">602</span><a name="line.602"></a> +<span class="sourceLineNo">603</span> this.tempFunctionCosts[i] = multiplier*cost;<a name="line.603"></a> +<span class="sourceLineNo">604</span> total += this.tempFunctionCosts[i];<a name="line.604"></a> +<span class="sourceLineNo">605</span><a name="line.605"></a> +<span class="sourceLineNo">606</span> if (total > previousCost) {<a name="line.606"></a> +<span class="sourceLineNo">607</span> break;<a name="line.607"></a> +<span class="sourceLineNo">608</span> }<a name="line.608"></a> +<span class="sourceLineNo">609</span> }<a name="line.609"></a> +<span class="sourceLineNo">610</span><a name="line.610"></a> +<span class="sourceLineNo">611</span> return total;<a name="line.611"></a> +<span class="sourceLineNo">612</span> }<a name="line.612"></a> +<span class="sourceLineNo">613</span><a name="line.613"></a> +<span class="sourceLineNo">614</span> /** Generates a candidate action to be applied to the cluster for cost function search */<a name="line.614"></a> +<span class="sourceLineNo">615</span> abstract static class CandidateGenerator {<a name="line.615"></a> +<span class="sourceLineNo">616</span> abstract Cluster.Action generate(Cluster cluster);<a name="line.616"></a> +<span class="sourceLineNo">617</span><a name="line.617"></a> +<span class="sourceLineNo">618</span> /**<a name="line.618"></a> +<span class="sourceLineNo">619</span> * From a list of regions pick a random one. Null can be returned which<a name="line.619"></a> +<span class="sourceLineNo">620</span> * {@link StochasticLoadBalancer#balanceCluster(Map)} recognize as signal to try a region move<a name="line.620"></a> +<span class="sourceLineNo">621</span> * rather than swap.<a name="line.621"></a> +<span class="sourceLineNo">622</span> *<a name="line.622"></a> +<span class="sourceLineNo">623</span> * @param cluster The state of the cluster<a name="line.623"></a> +<span class="sourceLineNo">624</span> * @param server index of the server<a name="line.624"></a> +<span class="sourceLineNo">625</span> * @param chanceOfNoSwap Chance that this will decide to try a move rather<a name="line.625"></a> +<span class="sourceLineNo">626</span> * than a swap.<a name="line.626"></a> +<span class="sourceLineNo">627</span> * @return a random {@link RegionInfo} or null if an asymmetrical move is<a name="line.627"></a> +<span class="sourceLineNo">628</span> * suggested.<a name="line.628"></a> +<span class="sourceLineNo">629</span> */<a name="line.629"></a> +<span class="sourceLineNo">630</span> protected int pickRandomRegion(Cluster cluster, int server, double chanceOfNoSwap) {<a name="line.630"></a> +<span class="sourceLineNo">631</span> // Check to see if this is just a move.<a name="line.631"></a> +<span class="sourceLineNo">632</span> if (cluster.regionsPerServer[server].length == 0 || RANDOM.nextFloat() < chanceOfNoSwap) {<a name="line.632"></a> +<span class="sourceLineNo">633</span> // signal a move only.<a name="line.633"></a> +<span class="sourceLineNo">634</span> return -1;<a name="line.634"></a> +<span class="sourceLineNo">635</span> }<a name="line.635"></a> +<span class="sourceLineNo">636</span> int rand = RANDOM.nextInt(cluster.regionsPerServer[server].length);<a name="line.636"></a> +<span class="sourceLineNo">637</span> return cluster.regionsPerServer[server][rand];<a name="line.637"></a> +<span class="sourceLineNo">638</span><a name="line.638"></a> +<span class="sourceLineNo">639</span> }<a name="line.639"></a> +<span class="sourceLineNo">640</span> protected int pickRandomServer(Cluster cluster) {<a name="line.640"></a> +<span class="sourceLineNo">641</span> if (cluster.numServers < 1) {<a name="line.641"></a> +<span class="sourceLineNo">642</span> return -1;<a name="line.642"></a> +<span class="sourceLineNo">643</span> }<a name="line.643"></a> +<span class="sourceLineNo">644</span><a name="line.644"></a> +<span class="sourceLineNo">645</span> return RANDOM.nextInt(cluster.numServers);<a name="line.645"></a> +<span class="sourceLineNo">646</span> }<a name="line.646"></a> +<span class="sourceLineNo">647</span><a name="line.647"></a> +<span class="sourceLineNo">648</span> protected int pickRandomRack(Cluster cluster) {<a name="line.648"></a> +<span class="sourceLineNo">649</span> if (cluster.numRacks < 1) {<a name="line.649"></a> +<span class="sourceLineNo">650</span> return -1;<a name="line.650"></a> +<span class="sourceLineNo">651</span> }<a name="line.651"></a> +<span class="sourceLineNo">652</span><a name="line.652"></a> +<span class="sourceLineNo">653</span> return RANDOM.nextInt(cluster.numRacks);<a name="line.653"></a> +<span class="sourceLineNo">654</span> }<a name="line.654"></a> +<span class="sourceLineNo">655</span><a name="line.655"></a> +<span class="sourceLineNo">656</span> protected int pickOtherRandomServer(Cluster cluster, int serverIndex) {<a name="line.656"></a> +<span class="sourceLineNo">657</span> if (cluster.numServers < 2) {<a name="line.657"></a> +<span class="sourceLineNo">658</span> return -1;<a name="line.658"></a> +<span class="sourceLineNo">659</span> }<a name="line.659"></a> +<span class="sourceLineNo">660</span> while (true) {<a name="line.660"></a> +<span class="sourceLineNo">661</span> int otherServerIndex = pickRandomServer(cluster);<a name="line.661"></a> +<span class="sourceLineNo">662</span> if (otherServerIndex != serverIndex) {<a name="line.662"></a> +<span class="sourceLineNo">663</span> return otherServerIndex;<a name="line.663"></a> +<span class="sourceLineNo">664</span> }<a name="line.664"></a> +<span class="sourceLineNo">665</span> }<a name="line.665"></a> +<span class="sourceLineNo">666</span> }<a name="line.666"></a> +<span class="sourceLineNo">667</span><a name="line.667"></a> +<span class="sourceLineNo">668</span> protected int pickOtherRandomRack(Cluster cluster, int rackIndex) {<a name="line.668"></a> +<span class="sourceLineNo">669</span> if (cluster.numRacks < 2) {<a name="line.669"></a> +<span class="sourceLineNo">670</span> return -1;<a name="line.670"></a> +<span class="sourceLineNo">671</span> }<a name="line.671"></a> +<span class="sourceLineNo">672</span> while (true) {<a name="line.672"></a> +<span class="sourceLineNo">673</span> int otherRackIndex = pickRandomRack(cluster);<a name="line.673"></a> +<span class="sourceLineNo">674</span> if (otherRackIndex != rackIndex) {<a name="line.674"></a> +<span class="sourceLineNo">675</span> return otherRackIndex;<a name="line.675"></a> +<span class="sourceLineNo">676</span> }<a name="line.676"></a> +<span class="sourceLineNo">677</span> }<a name="line.677"></a> +<span class="sourceLineNo">678</span> }<a name="line.678"></a> +<span class="sourceLineNo">679</span><a name="line.679"></a> +<span class="sourceLineNo">680</span> protected Cluster.Action pickRandomRegions(Cluster cluster,<a name="line.680"></a> +<span class="sourceLineNo">681</span> int thisServer,<a name="line.681"></a> +<span class="sourceLineNo">682</span> int otherServer) {<a name="line.682"></a> +<span class="sourceLineNo">683</span> if (thisServer < 0 || otherServer < 0) {<a name="line.683"></a> +<span class="sourceLineNo">684</span> return Cluster.NullAction;<a name="line.684"></a> +<span class="sourceLineNo">685</span> }<a name="line.685"></a> +<span class="sourceLineNo">686</span><a name="line.686"></a> +<span class="sourceLineNo">687</span> // Decide who is most likely to need another region<a name="line.687"></a> +<span class="sourceLineNo">688</span> int thisRegionCount = cluster.getNumRegions(thisServer);<a name="line.688"></a> +<span class="sourceLineNo">689</span> int otherRegionCount = cluster.getNumRegions(otherServer);<a name="line.689"></a> +<span class="sourceLineNo">690</span><a name="line.690"></a> +<span class="sourceLineNo">691</span> // Assign the chance based upon the above<a name="line.691"></a> +<span class="sourceLineNo">692</span> double thisChance = (thisRegionCount > otherRegionCount) ? 0 : 0.5;<a name="line.692"></a> +<span class="sourceLineNo">693</span> double otherChance = (thisRegionCount <= otherRegionCount) ? 0 : 0.5;<a name="line.693"></a> +<span class="sourceLineNo">694</span><a name="line.694"></a> +<span class="sourceLineNo">695</span> int thisRegion = pickRandomRegion(cluster, thisServer, thisChance);<a name="line.695"></a> +<span class="sourceLineNo">696</span> int otherRegion = pickRandomRegion(cluster, otherServer, otherChance);<a name="line.696"></a> +<span class="sourceLineNo">697</span><a name="line.697"></a> +<span class="sourceLineNo">698</span> return getAction(thisServer, thisRegion, otherServer, otherRegion);<a name="line.698"></a> +<span class="sourceLineNo">699</span> }<a name="line.699"></a> +<span class="sourceLineNo">700</span><a name="line.700"></a> +<span class="sourceLineNo">701</span> protected Cluster.Action getAction(int fromServer, int fromRegion,<a name="line.701"></a> +<span class="sourceLineNo">702</span> int toServer, int toRegion) {<a name="line.702"></a> +<span class="sourceLineNo">703</span> if (fromServer < 0 || toServer < 0) {<a name="line.703"></a> +<span class="sourceLineNo">704</span> return Cluster.NullAction;<a name="line.704"></a> +<span class="sourceLineNo">705</span> }<a name="line.705"></a> +<span class="sourceLineNo">706</span> if (fromRegion > 0 && toRegion > 0) {<a name="line.706"></a> +<span class="sourceLineNo">707</span> return new Cluster.SwapRegionsAction(fromServer, fromRegion,<a name="line.707"></a> +<span class="sourceLineNo">708</span> toServer, toRegion);<a name="line.708"></a> +<span class="sourceLineNo">709</span> } else if (fromRegion > 0) {<a name="line.709"></a> +<span class="sourceLineNo">710</span> return new Cluster.MoveRegionAction(fromRegion, fromServer, toServer);<a name="line.710"></a> +<span class="sourceLineNo">711</span> } else if (toRegion > 0) {<a name="line.711"></a> +<span class="sourceLineNo">712</span> return new Cluster.MoveRegionAction(toRegion, toServer, fromServer);<a name="line.712"></a> +<span class="sourceLineNo">713</span> } else {<a name="line.713"></a> +<span class="sourceLineNo">714</span> return Cluster.NullAction;<a name="line.714"></a> +<span class="sourceLineNo">715</span> }<a name="line.715"></a> +<span class="sourceLineNo">716</span> }<a name="line.716"></a> +<span class="sourceLineNo">717</span><a name="line.717"></a> +<span class="sourceLineNo">718</span> /**<a name="line.718"></a> +<span class="sourceLineNo">719</span> * Returns a random iteration order of indexes of an array with size length<a name="line.719"></a> +<span class="sourceLineNo">720</span> */<a name="line.720"></a> +<span class="sourceLineNo">721</span> protected List<Integer> getRandomIterationOrder(int length) {<a name="line.721"></a> +<span class="sourceLineNo">722</span> ArrayList<Integer> order = new ArrayList<>(length);<a name="line.722"></a> +<span class="sourceLineNo">723</span> for (int i = 0; i < length; i++) {<a name="line.723"></a> +<span class="sourceLineNo">724</span> order.add(i);<a name="line.724"></a> +<span class="sourceLineNo">725</span> }<a name="line.725"></a> +<span class="sourceLineNo">726</span> Collections.shuffle(order);<a name="line.726"></a> +<span class="sourceLineNo">727</span> return order;<a name="line.727"></a> +<span class="sourceLineNo">728</span> }<a name="line.728"></a> +<span class="sourceLineNo">729</span> }<a name="line.729"></a> +<span class="sourceLineNo">730</span><a name="line.730"></a> +<span class="sourceLineNo">731</span> static class RandomCandidateGenerator extends CandidateGenerator {<a name="line.731"></a> +<span class="sourceLineNo">732</span><a name="line.732"></a> +<span class="sourceLineNo">733</span> @Override<a name="line.733"></a> +<span class="sourceLineNo">734</span> Cluster.Action generate(Cluster cluster) {<a name="line.734"></a> +<span class="sourceLineNo">735</span><a name="line.735"></a> +<span class="sourceLineNo">736</span> int thisServer = pickRandomServer(cluster);<a name="line.736"></a> +<span class="sourceLineNo">737</span><a name="line.737"></a> +<span class="sourceLineNo">738</span> // Pick the other server<a name="line.738"></a> +<span class="sourceLineNo">739</span> int otherServer = pickOtherRandomServer(cluster, thisServer);<a name="line.739"></a> +<span class="sourceLineNo">740</span><a name="line.740"></a> +<span class="sourceLineNo">741</span> return pickRandomRegions(cluster, thisServer, otherServer);<a name="line.741"></a> +<span class="sourceLineNo">742</span> }<a name="line.742"></a> +<span class="sourceLineNo">743</span> }<a name="line.743"></a> +<span class="sourceLineNo">744</span><a name="line.744"></a> +<span class="sourceLineNo">745</span> static class LoadCandidateGenerator extends CandidateGenerator {<a name="line.745"></a> +<span class="sourceLineNo">746</span><a name="line.746"></a> +<span class="sourceLineNo">747</span> @Override<a name="line.747"></a> +<span class="sourceLineNo">748</span> Cluster.Action generate(Cluster cluster) {<a name="line.748"></a> +<span class="sourceLineNo">749</span> cluster.sortServersByRegionCount();<a name="line.749"></a> +<span class="sourceLineNo">750</span> int thisServer = pickMostLoadedServer(cluster, -1);<a name="line.750"></a> +<span class="sourceLineNo">751</span> int otherServer = pickLeastLoadedServer(cluster, thisServer);<a name="line.751"></a> +<span class="sourceLineNo">752</span><a name="line.752"></a> +<span class="sourceLineNo">753</span> return pickRandomRegions(cluster, thisServer, otherServer);<a name="line.753"></a> +<span class="sourceLineNo">754</span> }<a name="line.754"></a> +<span class="sourceLineNo">755</span><a name="line.755"></a> +<span class="sourceLineNo">756</span> private int pickLeastLoadedServer(final Cluster cluster, int thisServer) {<a name="line.756"></a> +<span class="sourceLineNo">757</span> Integer[] servers = cluster.serverIndicesSortedByRegionCount;<a name="line.757"></a> +<span class="sourceLineNo">758</span><a name="line.758"></a> +<span class="sourceLineNo">759</span> int index = 0;<a name="line.759"></a> +<span class="sourceLineNo">760</span> while (servers[index] == null || servers[index] == thisServer) {<a name="line.760"></a> +<span class="sourceLineNo">761</span> index++;<a name="line.761"></a> +<span class="sourceLineNo">762</span> if (index == servers.length) {<a name="line.762"></a> +<span class="sourceLineNo">763</span> return -1;<a name="line.763"></a> +<span class="sourceLineNo">764</span> }<a name="line.764"></a> +<span class="sourceLineNo">765</span> }<a name="line.765"></a> +<span class="sourceLineNo">766</span> return servers[index];<a name="line.766"></a> +<span class="sourceLineNo">767</span> }<a name="line.767"></a> +<span class="sourceLineNo">768</span><a name="line.768"></a> +<span class="sourceLineNo">769</span> private int pickMostLoadedServer(final Cluster cluster, int thisServer) {<a name="line.769"></a> +<span class="sourceLineNo">770</span> Integer[] servers = cluster.serverIndicesSortedByRegionCount;<a name="line.770"></a> +<span class="sourceLineNo">771</span><a name="line.771"></a> +<span class="sourceLineNo">772</span> int index = servers.length - 1;<a name="line.772"></a> +<span class="sourceLineNo">773</span> while (servers[index] == null || servers[index] == thisServer) {<a name="line.773"></a> +<span class="sourceLineNo">774</span> index--;<a name="line.774"></a> +<span class="sourceLineNo">775</span> if (index < 0) {<a name="line.775"></a> +<span class="sourceLineNo">776</span> return -1;<a name="line.776"></a> +<span class="sourceLineNo">777</span> }<a name="line.777"></a> +<span class="sourceLineNo">778</span> }<a name="line.778"></a> +<span class="sourceLineNo">779</span> return servers[index];<a name="line.779"></a> +<span class="sourceLineNo">780</span> }<a name="line.780"></a> +<span class="sourceLineNo">781</span> }<a name="line.781"></a> +<span class="sourceLineNo">782</span><a name="line.782"></a> +<span class="sourceLineNo">783</span> static class LocalityBasedCandidateGenerator extends CandidateGenerator {<a name="line.783"></a> +<span class="sourceLineNo">784</span><a name="line.784"></a> +<span class="sourceLineNo">785</span> private MasterServices masterServices;<a name="line.785"></a> +<span class="sourceLineNo">786</span><a name="line.786"></a> +<span class="sourceLineNo">787</span> LocalityBasedCandidateGenerator(MasterServices masterServices) {<a name="line.787"></a> +<span class="sourceLineNo">788</span> this.masterServices = masterServices;<a name="line.788"></a> +<span class="sourceLineNo">789</span> }<a name="line.789"></a> +<span class="sourceLineNo">790</span><a name="line.790"></a> +<span class="sourceLineNo">791</span> @Override<a name="line.791"></a> +<span class="sourceLineNo">792</span> Cluster.Action generate(Cluster cluster) {<a name="line.792"></a> +<span class="sourceLineNo">793</span> if (this.masterServices == null) {<a name="line.793"></a> +<span class="sourceLineNo">794</span> int thisServer = pickRandomServer(cluster);<a name="line.794"></a> +<span class="sourceLineNo">795</span> // Pick the other server<a name="line.795"></a> +<span class="sourceLineNo">796</span> int otherServer = pickOtherRandomServer(cluster, thisServer);<a name="line.796"></a> +<span class="sourceLineNo">797</span> return pickRandomRegions(cluster, thisServer, otherServer);<a name="line.797"></a> +<span class="sourceLineNo">798</span> }<a name="line.798"></a> +<span class="sourceLineNo">799</span><a name="line.799"></a> +<span class="sourceLineNo">800</span> // Randomly iterate through regions until you find one that is not on ideal host<a name="line.800"></a> +<span class="sourceLineNo">801</span> for (int region : getRandomIterationOrder(cluster.numRegions)) {<a name="line.801"></a> +<span class="sourceLineNo">802</span> int currentServer = cluster.regionIndexToServerIndex[region];<a name="line.802"></a> +<span class="sourceLineNo">803</span> if (currentServer != cluster.getOrComputeRegionsToMostLocalEntities(LocalityType.SERVER)[region]) {<a name="line.803"></a> +<span class="sourceLineNo">804</span> Optional<Action> potential = tryMoveOrSwap(<a name="line.804"></a> +<span class="sourceLineNo">805</span> cluster,<a name="line.805"></a> +<span class="sourceLineNo">806</span> currentServer,<a name="line.806"></a> +<span class="sourceLineNo">807</span> region,<a name="line.807"></a> +<span class="sourceLineNo">808</span> cluster.getOrComputeRegionsToMostLocalEntities(LocalityType.SERVER)[region]<a name="line.808"></a> +<span class="sourceLineNo">809</span> );<a name="line.809"></a> +<span class="sourceLineNo">810</span> if (potential.isPresent()) {<a name="line.810"></a> +<span class="sourceLineNo">811</span> return potential.get();<a name="line.811"></a> +<span class="sourceLineNo">812</span> }<a name="line.812"></a> +<span class="sourceLineNo">813</span> }<a name="line.813"></a> +<span class="sourceLineNo">814</span> }<a name="line.814"></a> +<span class="sourceLineNo">815</span> return Cluster.NullAction;<a name="line.815"></a> +<span class="sourceLineNo">816</span> }<a name="line.816"></a> +<span class="sourceLineNo">817</span><a name="line.817"></a> +<span class="sourceLineNo">818</span> /**<a name="line.818"></a> +<span class="sourceLineNo">819</span> * Try to generate a move/swap fromRegion between fromServer and toServer such that locality is improved.<a name="line.819"></a> +<span class="sourceLineNo">820</span> * Returns empty optional if no move can be found<a name="line.820"></a> +<span class="sourceLineNo">821</span> */<a name="line.821"></a> +<span class="sourceLineNo">822</span> private Optional<Action> tryMoveOrSwap(Cluster cluster,<a name="line.822"></a> +<span class="sourceLineNo">823</span> int fromServer,<a name="line.823"></a> +<span class="sourceLineNo">824</span> int fromRegion,<a name="line.824"></a> +<span class="sourceLineNo">825</span> int toServer) {<a name="line.825"></a> +<span class="sourceLineNo">826</span> // Try move first. We know apriori fromRegion has the highest locality on toServer<a name="line.826"></a> +<span class="sourceLineNo">827</span> if (cluster.serverHasTooFewRegions(toServer)) {<a name="line.827"></a> +<span class="sourceLineNo">828</span> return Optional.of(getAction(fromServer, fromRegion, toServer, -1));<a name="line.828"></a> +<span class="sourceLineNo">829</span> }<a name="line.829"></a> +<span class="sourceLineNo">830</span><a name="line.830"></a> +<span class="sourceLineNo">831</span> // Compare locality gain/loss from swapping fromRegion with regions on toServer<a name="line.831"></a> +<span class="sourceLineNo">832</span> double fromRegionLocalityDelta =<a name="line.832"></a> +<span class="sourceLineNo">833</span> getWeightedLocality(cluster, fromRegion, toServer) - getWeightedLocality(cluster, fromRegion, fromServer);<a name="line.833"></a> +<span class="sourceLineNo">834</span> for (int toRegionIndex : getRandomIterationOrder(cluster.regionsPerServer[toServer].length)) {<a name="line.834"></a> +<span class="sourceLineNo">835</span> int toRegion = cluster.regionsPerServer[toServer][toRegionIndex];<a name="line.835"></a> +<span class="sourceLineNo">836</span> double toRegionLocalityDelta =<a name="line.836"></a> +<span class="sourceLineNo">837</span> getWeightedLocality(cluster, toRegion, fromServer) - getWeightedLocality(cluster, toRegion, toServer);<a name="line.837"></a> +<span class="sourceLineNo">838</span> // If locality would remain neutral or improve, attempt the swap<a name="line.838"></a> +<span class="sourceLineNo">839</span> if (fromRegionLocalityDelta + toRegionLocalityDelta >= 0) {<a name="line.839"></a> +<span class="sourceLineNo">840</span> return Optional.of(getAction(fromServer, fromRegion, toServer, toRegion));<a name="line.840"></a> +<span class="sourceLineNo">841</span> }<a name="line.841"></a> +<span class="sourceLineNo">842</span> }<a name="line.842"></a> +<span class="sourceLineNo">843</span><a name="line.843"></a> +<span class="sourceLineNo">844</span> return Optional.absent();<a name="line.844"></a> +<span class="sourceLineNo">845</span> }<a name="line.845"></a> +<span class="sourceLineNo">846</span><a name="line.846"></a> +<span class="sourceLineNo">847</span> private double getWeightedLocality(Cluster cluster, int region, int server) {<a name="line.847"></a> +<span class="sourceLineNo">848</span> return cluster.getOrComputeWeightedLocality(region, server, LocalityType.SERVER);<a name="line.848"></a> +<span class="sourceLineNo">849</span> }<a name="line.849"></a> +<span class="sourceLineNo">850</span><a name="line.850"></a> +<span class="sourceLineNo">851</span> void setServices(MasterServices services) {<a name="line.851"></a> +<span class="sourceLineNo">852</span> this.masterServices = services;<a name="line.852"></a> +<span class="sourceLineNo">853</span> }<a name="line.853"></a> +<span class="sourceLineNo">854</span> }<a name="line.854"></a> +<span class="sourceLineNo">855</span><a name="line.855"></a> +<span class="sourceLineNo">856</span> /**<a name="line.856"></a> +<span class="sourceLineNo">857</span> * Generates candidates which moves the replicas out of the region server for<a name="line.857"></a> +<span class="sourceLineNo">858</span> * co-hosted region replicas<a name="line.858"></a> +<span class="sourceLineNo">859</span> */<a name="line.859"></a> +<span class="sourceLineNo">860</span> static class RegionReplicaCandidateGenerator extends CandidateGenerator {<a name="line.860"></a> +<span class="sourceLineNo">861</span><a name="line.861"></a> +<span class="sourceLineNo">862</span> RandomCandidateGenerator randomGenerator = new RandomCandidateGenerator();<a name="line.862"></a> +<span class="sourceLineNo">863</span><a name="line.863"></a> +<span class="sourceLineNo">864</span> /**<a name="line.864"></a> +<span class="sourceLineNo">865</span> * Randomly select one regionIndex out of all region replicas co-hosted in the same group<a name="line.865"></a> +<span class="sourceLineNo">866</span> * (a group is a server, host or rack)<a name="line.866"></a> +<span class="sourceLineNo">867</span> * @param primariesOfRegionsPerGroup either Cluster.primariesOfRegionsPerServer,<a name="line.867"></a> +<span class="sourceLineNo">868</span> * primariesOfRegionsPerHost or primariesOfRegionsPerRack<a name="line.868"></a> +<span class="sourceLineNo">869</span> * @param regionsPerGroup either Cluster.regionsPerServer, regionsPerHost or regionsPerRack<a name="line.869"></a> +<span class="sourceLineNo">870</span> * @param regionIndexToPrimaryIndex Cluster.regionsIndexToPrimaryIndex<a name="line.870"></a> +<span class="sourceLineNo">871</span> * @return a regionIndex for the selected primary or -1 if there is no co-locating<a name="line.871"></a> +<span class="sourceLineNo">872</span> */<a name="line.872"></a> +<span class="sourceLineNo">873</span> int selectCoHostedRegionPerGroup(int[] primariesOfRegionsPerGroup, int[] regionsPerGroup<a name="line.873"></a> +<span class="sourceLineNo">874</span> , int[] regionIndexToPrimaryIndex) {<a name="line.874"></a> +<span class="sourceLineNo">875</span> int currentPrimary = -1;<a name="line.875"></a> +<span class="sourceLineNo">876</span> int currentPrimaryIndex = -1;<a name="line.876"></a> +<span class="sourceLineNo">877</span> int selectedPrimaryIndex = -1;<a name="line.877"></a> +<span class="sourceLineNo">878</span> double currentLargestRandom = -1;<a name="line.878"></a> +<span class="sourceLineNo">879</span> // primariesOfRegionsPerGroup is a sorted array. Since it contains the primary region<a name="line.879"></a> +<span class="sourceLineNo">880</span> // ids for the regions hosted in server, a consecutive repetition means that replicas<a name="line.880"></a> +<span class="sourceLineNo">881</span> // are co-hosted<a name="line.881"></a> +<span class="sourceLineNo">882</span> for (int j = 0; j <= primariesOfRegionsPerGroup.length; j++) {<a name="line.882"></a> +<span class="sourceLineNo">883</span> int primary = j < primariesOfRegionsPerGroup.length<a name="line.883"></a> +<span class="sourceLineNo">884</span> ? primariesOfRegionsPerGroup[j] : -1;<a name="line.884"></a> +<span class="sourceLineNo">885</span> if (primary != currentPrimary) { // check for whether we see a new primary<a name="line.885"></a> +<span class="sourceLineNo">886</span> int numReplicas = j - currentPrimaryIndex;<a name="line.886"></a> +<span class="sourceLineNo">887</span> if (numReplicas > 1) { // means consecutive primaries, indicating co-location<a name="line.887"></a> +<span class="sourceLineNo">888</span> // decide to select this primary region id or not<a name="line.888"></a> +<span class="sourceLineNo">889</span> double currentRandom = RANDOM.nextDouble();<a name="line.889"></a> +<span class="sourceLineNo">890</span> // we don't know how many region replicas are co-hosted, we will randomly select one<a name="line.890"></a> +<span cla
<TRUNCATED>