http://git-wip-us.apache.org/repos/asf/hbase-site/blob/e0fb1fde/devapidocs/src-html/org/apache/hadoop/hbase/master/RegionPlacementMaintainer.RandomizedMatrix.html ---------------------------------------------------------------------- diff --git a/devapidocs/src-html/org/apache/hadoop/hbase/master/RegionPlacementMaintainer.RandomizedMatrix.html b/devapidocs/src-html/org/apache/hadoop/hbase/master/RegionPlacementMaintainer.RandomizedMatrix.html index bcb65f1..a9d5986 100644 --- a/devapidocs/src-html/org/apache/hadoop/hbase/master/RegionPlacementMaintainer.RandomizedMatrix.html +++ b/devapidocs/src-html/org/apache/hadoop/hbase/master/RegionPlacementMaintainer.RandomizedMatrix.html @@ -39,1086 +39,1087 @@ <span class="sourceLineNo">031</span>import java.util.Scanner;<a name="line.31"></a> <span class="sourceLineNo">032</span>import java.util.Set;<a name="line.32"></a> <span class="sourceLineNo">033</span>import java.util.TreeMap;<a name="line.33"></a> -<span class="sourceLineNo">034</span>import org.apache.commons.cli.CommandLine;<a name="line.34"></a> -<span class="sourceLineNo">035</span>import org.apache.commons.cli.GnuParser;<a name="line.35"></a> -<span class="sourceLineNo">036</span>import org.apache.commons.cli.HelpFormatter;<a name="line.36"></a> -<span class="sourceLineNo">037</span>import org.apache.commons.cli.Options;<a name="line.37"></a> -<span class="sourceLineNo">038</span>import org.apache.commons.cli.ParseException;<a name="line.38"></a> -<span class="sourceLineNo">039</span>import org.apache.commons.lang3.StringUtils;<a name="line.39"></a> -<span class="sourceLineNo">040</span>import org.apache.hadoop.conf.Configuration;<a name="line.40"></a> -<span class="sourceLineNo">041</span>import org.apache.hadoop.fs.FileSystem;<a name="line.41"></a> -<span class="sourceLineNo">042</span>import org.apache.hadoop.hbase.ClusterMetrics.Option;<a name="line.42"></a> -<span class="sourceLineNo">043</span>import org.apache.hadoop.hbase.HBaseConfiguration;<a name="line.43"></a> -<span class="sourceLineNo">044</span>import org.apache.hadoop.hbase.HConstants;<a name="line.44"></a> -<span class="sourceLineNo">045</span>import org.apache.hadoop.hbase.ServerName;<a name="line.45"></a> -<span class="sourceLineNo">046</span>import org.apache.hadoop.hbase.TableName;<a name="line.46"></a> -<span class="sourceLineNo">047</span>import org.apache.hadoop.hbase.client.Admin;<a name="line.47"></a> -<span class="sourceLineNo">048</span>import org.apache.hadoop.hbase.client.ClusterConnection;<a name="line.48"></a> -<span class="sourceLineNo">049</span>import org.apache.hadoop.hbase.client.Connection;<a name="line.49"></a> -<span class="sourceLineNo">050</span>import org.apache.hadoop.hbase.client.ConnectionFactory;<a name="line.50"></a> -<span class="sourceLineNo">051</span>import org.apache.hadoop.hbase.client.RegionInfo;<a name="line.51"></a> -<span class="sourceLineNo">052</span>import org.apache.hadoop.hbase.favored.FavoredNodeAssignmentHelper;<a name="line.52"></a> -<span class="sourceLineNo">053</span>import org.apache.hadoop.hbase.favored.FavoredNodesPlan;<a name="line.53"></a> -<span class="sourceLineNo">054</span>import org.apache.hadoop.hbase.util.FSUtils;<a name="line.54"></a> -<span class="sourceLineNo">055</span>import org.apache.hadoop.hbase.util.MunkresAssignment;<a name="line.55"></a> -<span class="sourceLineNo">056</span>import org.apache.hadoop.hbase.util.Pair;<a name="line.56"></a> -<span class="sourceLineNo">057</span>import org.apache.yetus.audience.InterfaceAudience;<a name="line.57"></a> -<span class="sourceLineNo">058</span>import org.slf4j.Logger;<a name="line.58"></a> -<span class="sourceLineNo">059</span>import org.slf4j.LoggerFactory;<a name="line.59"></a> -<span class="sourceLineNo">060</span><a name="line.60"></a> -<span class="sourceLineNo">061</span>import org.apache.hadoop.hbase.shaded.protobuf.ProtobufUtil;<a name="line.61"></a> -<span class="sourceLineNo">062</span>import org.apache.hadoop.hbase.shaded.protobuf.RequestConverter;<a name="line.62"></a> -<span class="sourceLineNo">063</span>import org.apache.hadoop.hbase.shaded.protobuf.generated.AdminProtos.AdminService.BlockingInterface;<a name="line.63"></a> -<span class="sourceLineNo">064</span>import org.apache.hadoop.hbase.shaded.protobuf.generated.AdminProtos.UpdateFavoredNodesRequest;<a name="line.64"></a> -<span class="sourceLineNo">065</span>import org.apache.hadoop.hbase.shaded.protobuf.generated.AdminProtos.UpdateFavoredNodesResponse;<a name="line.65"></a> -<span class="sourceLineNo">066</span><a name="line.66"></a> -<span class="sourceLineNo">067</span>/**<a name="line.67"></a> -<span class="sourceLineNo">068</span> * A tool that is used for manipulating and viewing favored nodes information<a name="line.68"></a> -<span class="sourceLineNo">069</span> * for regions. Run with -h to get a list of the options<a name="line.69"></a> -<span class="sourceLineNo">070</span> */<a name="line.70"></a> -<span class="sourceLineNo">071</span>@InterfaceAudience.Private<a name="line.71"></a> -<span class="sourceLineNo">072</span>// TODO: Remove? Unused. Partially implemented only.<a name="line.72"></a> -<span class="sourceLineNo">073</span>public class RegionPlacementMaintainer {<a name="line.73"></a> -<span class="sourceLineNo">074</span> private static final Logger LOG = LoggerFactory.getLogger(RegionPlacementMaintainer.class<a name="line.74"></a> -<span class="sourceLineNo">075</span> .getName());<a name="line.75"></a> -<span class="sourceLineNo">076</span> //The cost of a placement that should never be assigned.<a name="line.76"></a> -<span class="sourceLineNo">077</span> private static final float MAX_COST = Float.POSITIVE_INFINITY;<a name="line.77"></a> -<span class="sourceLineNo">078</span><a name="line.78"></a> -<span class="sourceLineNo">079</span> // The cost of a placement that is undesirable but acceptable.<a name="line.79"></a> -<span class="sourceLineNo">080</span> private static final float AVOID_COST = 100000f;<a name="line.80"></a> -<span class="sourceLineNo">081</span><a name="line.81"></a> -<span class="sourceLineNo">082</span> // The amount by which the cost of a placement is increased if it is the<a name="line.82"></a> -<span class="sourceLineNo">083</span> // last slot of the server. This is done to more evenly distribute the slop<a name="line.83"></a> -<span class="sourceLineNo">084</span> // amongst servers.<a name="line.84"></a> -<span class="sourceLineNo">085</span> private static final float LAST_SLOT_COST_PENALTY = 0.5f;<a name="line.85"></a> -<span class="sourceLineNo">086</span><a name="line.86"></a> -<span class="sourceLineNo">087</span> // The amount by which the cost of a primary placement is penalized if it is<a name="line.87"></a> -<span class="sourceLineNo">088</span> // not the host currently serving the region. This is done to minimize moves.<a name="line.88"></a> -<span class="sourceLineNo">089</span> private static final float NOT_CURRENT_HOST_PENALTY = 0.1f;<a name="line.89"></a> -<span class="sourceLineNo">090</span><a name="line.90"></a> -<span class="sourceLineNo">091</span> private static boolean USE_MUNKRES_FOR_PLACING_SECONDARY_AND_TERTIARY = false;<a name="line.91"></a> -<span class="sourceLineNo">092</span><a name="line.92"></a> -<span class="sourceLineNo">093</span> private Configuration conf;<a name="line.93"></a> -<span class="sourceLineNo">094</span> private final boolean enforceLocality;<a name="line.94"></a> -<span class="sourceLineNo">095</span> private final boolean enforceMinAssignmentMove;<a name="line.95"></a> -<span class="sourceLineNo">096</span> private RackManager rackManager;<a name="line.96"></a> -<span class="sourceLineNo">097</span> private Set<TableName> targetTableSet;<a name="line.97"></a> -<span class="sourceLineNo">098</span> private final Connection connection;<a name="line.98"></a> -<span class="sourceLineNo">099</span><a name="line.99"></a> -<span class="sourceLineNo">100</span> public RegionPlacementMaintainer(Configuration conf) {<a name="line.100"></a> -<span class="sourceLineNo">101</span> this(conf, true, true);<a name="line.101"></a> -<span class="sourceLineNo">102</span> }<a name="line.102"></a> -<span class="sourceLineNo">103</span><a name="line.103"></a> -<span class="sourceLineNo">104</span> public RegionPlacementMaintainer(Configuration conf, boolean enforceLocality,<a name="line.104"></a> -<span class="sourceLineNo">105</span> boolean enforceMinAssignmentMove) {<a name="line.105"></a> -<span class="sourceLineNo">106</span> this.conf = conf;<a name="line.106"></a> -<span class="sourceLineNo">107</span> this.enforceLocality = enforceLocality;<a name="line.107"></a> -<span class="sourceLineNo">108</span> this.enforceMinAssignmentMove = enforceMinAssignmentMove;<a name="line.108"></a> -<span class="sourceLineNo">109</span> this.targetTableSet = new HashSet<>();<a name="line.109"></a> -<span class="sourceLineNo">110</span> this.rackManager = new RackManager(conf);<a name="line.110"></a> -<span class="sourceLineNo">111</span> try {<a name="line.111"></a> -<span class="sourceLineNo">112</span> this.connection = ConnectionFactory.createConnection(this.conf);<a name="line.112"></a> -<span class="sourceLineNo">113</span> } catch (IOException e) {<a name="line.113"></a> -<span class="sourceLineNo">114</span> throw new RuntimeException(e);<a name="line.114"></a> -<span class="sourceLineNo">115</span> }<a name="line.115"></a> -<span class="sourceLineNo">116</span> }<a name="line.116"></a> -<span class="sourceLineNo">117</span><a name="line.117"></a> -<span class="sourceLineNo">118</span> private static void printHelp(Options opt) {<a name="line.118"></a> -<span class="sourceLineNo">119</span> new HelpFormatter().printHelp(<a name="line.119"></a> -<span class="sourceLineNo">120</span> "RegionPlacement < -w | -u | -n | -v | -t | -h | -overwrite -r regionName -f favoredNodes " +<a name="line.120"></a> -<span class="sourceLineNo">121</span> "-diff>" +<a name="line.121"></a> -<span class="sourceLineNo">122</span> " [-l false] [-m false] [-d] [-tables t1,t2,...tn] [-zk zk1,zk2,zk3]" +<a name="line.122"></a> -<span class="sourceLineNo">123</span> " [-fs hdfs://a.b.c.d:9000] [-hbase_root /HBASE]", opt);<a name="line.123"></a> -<span class="sourceLineNo">124</span> }<a name="line.124"></a> -<span class="sourceLineNo">125</span><a name="line.125"></a> -<span class="sourceLineNo">126</span> public void setTargetTableName(String[] tableNames) {<a name="line.126"></a> -<span class="sourceLineNo">127</span> if (tableNames != null) {<a name="line.127"></a> -<span class="sourceLineNo">128</span> for (String table : tableNames)<a name="line.128"></a> -<span class="sourceLineNo">129</span> this.targetTableSet.add(TableName.valueOf(table));<a name="line.129"></a> -<span class="sourceLineNo">130</span> }<a name="line.130"></a> -<span class="sourceLineNo">131</span> }<a name="line.131"></a> -<span class="sourceLineNo">132</span><a name="line.132"></a> -<span class="sourceLineNo">133</span> /**<a name="line.133"></a> -<span class="sourceLineNo">134</span> * @return the new RegionAssignmentSnapshot<a name="line.134"></a> -<span class="sourceLineNo">135</span> * @throws IOException<a name="line.135"></a> -<span class="sourceLineNo">136</span> */<a name="line.136"></a> -<span class="sourceLineNo">137</span> public SnapshotOfRegionAssignmentFromMeta getRegionAssignmentSnapshot()<a name="line.137"></a> -<span class="sourceLineNo">138</span> throws IOException {<a name="line.138"></a> -<span class="sourceLineNo">139</span> SnapshotOfRegionAssignmentFromMeta currentAssignmentShapshot =<a name="line.139"></a> -<span class="sourceLineNo">140</span> new SnapshotOfRegionAssignmentFromMeta(ConnectionFactory.createConnection(conf));<a name="line.140"></a> -<span class="sourceLineNo">141</span> currentAssignmentShapshot.initialize();<a name="line.141"></a> -<span class="sourceLineNo">142</span> return currentAssignmentShapshot;<a name="line.142"></a> -<span class="sourceLineNo">143</span> }<a name="line.143"></a> -<span class="sourceLineNo">144</span><a name="line.144"></a> -<span class="sourceLineNo">145</span> /**<a name="line.145"></a> -<span class="sourceLineNo">146</span> * Verify the region placement is consistent with the assignment plan<a name="line.146"></a> -<span class="sourceLineNo">147</span> * @param isDetailMode<a name="line.147"></a> -<span class="sourceLineNo">148</span> * @return reports<a name="line.148"></a> -<span class="sourceLineNo">149</span> * @throws IOException<a name="line.149"></a> -<span class="sourceLineNo">150</span> */<a name="line.150"></a> -<span class="sourceLineNo">151</span> public List<AssignmentVerificationReport> verifyRegionPlacement(boolean isDetailMode)<a name="line.151"></a> -<span class="sourceLineNo">152</span> throws IOException {<a name="line.152"></a> -<span class="sourceLineNo">153</span> System.out.println("Start to verify the region assignment and " +<a name="line.153"></a> -<span class="sourceLineNo">154</span> "generate the verification report");<a name="line.154"></a> -<span class="sourceLineNo">155</span> // Get the region assignment snapshot<a name="line.155"></a> -<span class="sourceLineNo">156</span> SnapshotOfRegionAssignmentFromMeta snapshot = this.getRegionAssignmentSnapshot();<a name="line.156"></a> -<span class="sourceLineNo">157</span><a name="line.157"></a> -<span class="sourceLineNo">158</span> // Get all the tables<a name="line.158"></a> -<span class="sourceLineNo">159</span> Set<TableName> tables = snapshot.getTableSet();<a name="line.159"></a> -<span class="sourceLineNo">160</span><a name="line.160"></a> -<span class="sourceLineNo">161</span> // Get the region locality map<a name="line.161"></a> -<span class="sourceLineNo">162</span> Map<String, Map<String, Float>> regionLocalityMap = null;<a name="line.162"></a> -<span class="sourceLineNo">163</span> if (this.enforceLocality == true) {<a name="line.163"></a> -<span class="sourceLineNo">164</span> regionLocalityMap = FSUtils.getRegionDegreeLocalityMappingFromFS(conf);<a name="line.164"></a> -<span class="sourceLineNo">165</span> }<a name="line.165"></a> -<span class="sourceLineNo">166</span> List<AssignmentVerificationReport> reports = new ArrayList<>();<a name="line.166"></a> -<span class="sourceLineNo">167</span> // Iterate all the tables to fill up the verification report<a name="line.167"></a> -<span class="sourceLineNo">168</span> for (TableName table : tables) {<a name="line.168"></a> -<span class="sourceLineNo">169</span> if (!this.targetTableSet.isEmpty() &&<a name="line.169"></a> -<span class="sourceLineNo">170</span> !this.targetTableSet.contains(table)) {<a name="line.170"></a> -<span class="sourceLineNo">171</span> continue;<a name="line.171"></a> -<span class="sourceLineNo">172</span> }<a name="line.172"></a> -<span class="sourceLineNo">173</span> AssignmentVerificationReport report = new AssignmentVerificationReport();<a name="line.173"></a> -<span class="sourceLineNo">174</span> report.fillUp(table, snapshot, regionLocalityMap);<a name="line.174"></a> -<span class="sourceLineNo">175</span> report.print(isDetailMode);<a name="line.175"></a> -<span class="sourceLineNo">176</span> reports.add(report);<a name="line.176"></a> -<span class="sourceLineNo">177</span> }<a name="line.177"></a> -<span class="sourceLineNo">178</span> return reports;<a name="line.178"></a> -<span class="sourceLineNo">179</span> }<a name="line.179"></a> -<span class="sourceLineNo">180</span><a name="line.180"></a> -<span class="sourceLineNo">181</span> /**<a name="line.181"></a> -<span class="sourceLineNo">182</span> * Generate the assignment plan for the existing table<a name="line.182"></a> -<span class="sourceLineNo">183</span> *<a name="line.183"></a> -<span class="sourceLineNo">184</span> * @param tableName<a name="line.184"></a> -<span class="sourceLineNo">185</span> * @param assignmentSnapshot<a name="line.185"></a> -<span class="sourceLineNo">186</span> * @param regionLocalityMap<a name="line.186"></a> -<span class="sourceLineNo">187</span> * @param plan<a name="line.187"></a> -<span class="sourceLineNo">188</span> * @param munkresForSecondaryAndTertiary if set on true the assignment plan<a name="line.188"></a> -<span class="sourceLineNo">189</span> * for the tertiary and secondary will be generated with Munkres algorithm,<a name="line.189"></a> -<span class="sourceLineNo">190</span> * otherwise will be generated using placeSecondaryAndTertiaryRS<a name="line.190"></a> -<span class="sourceLineNo">191</span> * @throws IOException<a name="line.191"></a> -<span class="sourceLineNo">192</span> */<a name="line.192"></a> -<span class="sourceLineNo">193</span> private void genAssignmentPlan(TableName tableName,<a name="line.193"></a> -<span class="sourceLineNo">194</span> SnapshotOfRegionAssignmentFromMeta assignmentSnapshot,<a name="line.194"></a> -<span class="sourceLineNo">195</span> Map<String, Map<String, Float>> regionLocalityMap, FavoredNodesPlan plan,<a name="line.195"></a> -<span class="sourceLineNo">196</span> boolean munkresForSecondaryAndTertiary) throws IOException {<a name="line.196"></a> -<span class="sourceLineNo">197</span> // Get the all the regions for the current table<a name="line.197"></a> -<span class="sourceLineNo">198</span> List<RegionInfo> regions =<a name="line.198"></a> -<span class="sourceLineNo">199</span> assignmentSnapshot.getTableToRegionMap().get(tableName);<a name="line.199"></a> -<span class="sourceLineNo">200</span> int numRegions = regions.size();<a name="line.200"></a> -<span class="sourceLineNo">201</span><a name="line.201"></a> -<span class="sourceLineNo">202</span> // Get the current assignment map<a name="line.202"></a> -<span class="sourceLineNo">203</span> Map<RegionInfo, ServerName> currentAssignmentMap =<a name="line.203"></a> -<span class="sourceLineNo">204</span> assignmentSnapshot.getRegionToRegionServerMap();<a name="line.204"></a> -<span class="sourceLineNo">205</span><a name="line.205"></a> -<span class="sourceLineNo">206</span> // Get the all the region servers<a name="line.206"></a> -<span class="sourceLineNo">207</span> List<ServerName> servers = new ArrayList<>();<a name="line.207"></a> -<span class="sourceLineNo">208</span> try (Admin admin = this.connection.getAdmin()) {<a name="line.208"></a> -<span class="sourceLineNo">209</span> servers.addAll(admin.getClusterMetrics(EnumSet.of(Option.LIVE_SERVERS))<a name="line.209"></a> -<span class="sourceLineNo">210</span> .getLiveServerMetrics().keySet());<a name="line.210"></a> -<span class="sourceLineNo">211</span> }<a name="line.211"></a> -<span class="sourceLineNo">212</span><a name="line.212"></a> -<span class="sourceLineNo">213</span> LOG.info("Start to generate assignment plan for " + numRegions +<a name="line.213"></a> -<span class="sourceLineNo">214</span> " regions from table " + tableName + " with " +<a name="line.214"></a> -<span class="sourceLineNo">215</span> servers.size() + " region servers");<a name="line.215"></a> -<span class="sourceLineNo">216</span><a name="line.216"></a> -<span class="sourceLineNo">217</span> int slotsPerServer = (int) Math.ceil((float) numRegions /<a name="line.217"></a> -<span class="sourceLineNo">218</span> servers.size());<a name="line.218"></a> -<span class="sourceLineNo">219</span> int regionSlots = slotsPerServer * servers.size();<a name="line.219"></a> -<span class="sourceLineNo">220</span><a name="line.220"></a> -<span class="sourceLineNo">221</span> // Compute the primary, secondary and tertiary costs for each region/server<a name="line.221"></a> -<span class="sourceLineNo">222</span> // pair. These costs are based only on node locality and rack locality, and<a name="line.222"></a> -<span class="sourceLineNo">223</span> // will be modified later.<a name="line.223"></a> -<span class="sourceLineNo">224</span> float[][] primaryCost = new float[numRegions][regionSlots];<a name="line.224"></a> -<span class="sourceLineNo">225</span> float[][] secondaryCost = new float[numRegions][regionSlots];<a name="line.225"></a> -<span class="sourceLineNo">226</span> float[][] tertiaryCost = new float[numRegions][regionSlots];<a name="line.226"></a> -<span class="sourceLineNo">227</span><a name="line.227"></a> -<span class="sourceLineNo">228</span> if (this.enforceLocality && regionLocalityMap != null) {<a name="line.228"></a> -<span class="sourceLineNo">229</span> // Transform the locality mapping into a 2D array, assuming that any<a name="line.229"></a> -<span class="sourceLineNo">230</span> // unspecified locality value is 0.<a name="line.230"></a> -<span class="sourceLineNo">231</span> float[][] localityPerServer = new float[numRegions][regionSlots];<a name="line.231"></a> -<span class="sourceLineNo">232</span> for (int i = 0; i < numRegions; i++) {<a name="line.232"></a> -<span class="sourceLineNo">233</span> Map<String, Float> serverLocalityMap =<a name="line.233"></a> -<span class="sourceLineNo">234</span> regionLocalityMap.get(regions.get(i).getEncodedName());<a name="line.234"></a> -<span class="sourceLineNo">235</span> if (serverLocalityMap == null) {<a name="line.235"></a> -<span class="sourceLineNo">236</span> continue;<a name="line.236"></a> -<span class="sourceLineNo">237</span> }<a name="line.237"></a> -<span class="sourceLineNo">238</span> for (int j = 0; j < servers.size(); j++) {<a name="line.238"></a> -<span class="sourceLineNo">239</span> String serverName = servers.get(j).getHostname();<a name="line.239"></a> -<span class="sourceLineNo">240</span> if (serverName == null) {<a name="line.240"></a> -<span class="sourceLineNo">241</span> continue;<a name="line.241"></a> -<span class="sourceLineNo">242</span> }<a name="line.242"></a> -<span class="sourceLineNo">243</span> Float locality = serverLocalityMap.get(serverName);<a name="line.243"></a> -<span class="sourceLineNo">244</span> if (locality == null) {<a name="line.244"></a> -<span class="sourceLineNo">245</span> continue;<a name="line.245"></a> -<span class="sourceLineNo">246</span> }<a name="line.246"></a> -<span class="sourceLineNo">247</span> for (int k = 0; k < slotsPerServer; k++) {<a name="line.247"></a> -<span class="sourceLineNo">248</span> // If we can't find the locality of a region to a server, which occurs<a name="line.248"></a> -<span class="sourceLineNo">249</span> // because locality is only reported for servers which have some<a name="line.249"></a> -<span class="sourceLineNo">250</span> // blocks of a region local, then the locality for that pair is 0.<a name="line.250"></a> -<span class="sourceLineNo">251</span> localityPerServer[i][j * slotsPerServer + k] = locality.floatValue();<a name="line.251"></a> -<span class="sourceLineNo">252</span> }<a name="line.252"></a> -<span class="sourceLineNo">253</span> }<a name="line.253"></a> -<span class="sourceLineNo">254</span> }<a name="line.254"></a> -<span class="sourceLineNo">255</span><a name="line.255"></a> -<span class="sourceLineNo">256</span> // Compute the total rack locality for each region in each rack. The total<a name="line.256"></a> -<span class="sourceLineNo">257</span> // rack locality is the sum of the localities of a region on all servers in<a name="line.257"></a> -<span class="sourceLineNo">258</span> // a rack.<a name="line.258"></a> -<span class="sourceLineNo">259</span> Map<String, Map<RegionInfo, Float>> rackRegionLocality = new HashMap<>();<a name="line.259"></a> -<span class="sourceLineNo">260</span> for (int i = 0; i < numRegions; i++) {<a name="line.260"></a> -<span class="sourceLineNo">261</span> RegionInfo region = regions.get(i);<a name="line.261"></a> -<span class="sourceLineNo">262</span> for (int j = 0; j < regionSlots; j += slotsPerServer) {<a name="line.262"></a> -<span class="sourceLineNo">263</span> String rack = rackManager.getRack(servers.get(j / slotsPerServer));<a name="line.263"></a> -<span class="sourceLineNo">264</span> Map<RegionInfo, Float> rackLocality = rackRegionLocality.get(rack);<a name="line.264"></a> -<span class="sourceLineNo">265</span> if (rackLocality == null) {<a name="line.265"></a> -<span class="sourceLineNo">266</span> rackLocality = new HashMap<>();<a name="line.266"></a> -<span class="sourceLineNo">267</span> rackRegionLocality.put(rack, rackLocality);<a name="line.267"></a> -<span class="sourceLineNo">268</span> }<a name="line.268"></a> -<span class="sourceLineNo">269</span> Float localityObj = rackLocality.get(region);<a name="line.269"></a> -<span class="sourceLineNo">270</span> float locality = localityObj == null ? 0 : localityObj.floatValue();<a name="line.270"></a> -<span class="sourceLineNo">271</span> locality += localityPerServer[i][j];<a name="line.271"></a> -<span class="sourceLineNo">272</span> rackLocality.put(region, locality);<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> for (int i = 0; i < numRegions; i++) {<a name="line.275"></a> -<span class="sourceLineNo">276</span> for (int j = 0; j < regionSlots; j++) {<a name="line.276"></a> -<span class="sourceLineNo">277</span> String rack = rackManager.getRack(servers.get(j / slotsPerServer));<a name="line.277"></a> -<span class="sourceLineNo">278</span> Float totalRackLocalityObj =<a name="line.278"></a> -<span class="sourceLineNo">279</span> rackRegionLocality.get(rack).get(regions.get(i));<a name="line.279"></a> -<span class="sourceLineNo">280</span> float totalRackLocality = totalRackLocalityObj == null ?<a name="line.280"></a> -<span class="sourceLineNo">281</span> 0 : totalRackLocalityObj.floatValue();<a name="line.281"></a> -<span class="sourceLineNo">282</span><a name="line.282"></a> -<span class="sourceLineNo">283</span> // Primary cost aims to favor servers with high node locality and low<a name="line.283"></a> -<span class="sourceLineNo">284</span> // rack locality, so that secondaries and tertiaries can be chosen for<a name="line.284"></a> -<span class="sourceLineNo">285</span> // nodes with high rack locality. This might give primaries with<a name="line.285"></a> -<span class="sourceLineNo">286</span> // slightly less locality at first compared to a cost which only<a name="line.286"></a> -<span class="sourceLineNo">287</span> // considers the node locality, but should be better in the long run.<a name="line.287"></a> -<span class="sourceLineNo">288</span> primaryCost[i][j] = 1 - (2 * localityPerServer[i][j] -<a name="line.288"></a> -<span class="sourceLineNo">289</span> totalRackLocality);<a name="line.289"></a> -<span class="sourceLineNo">290</span><a name="line.290"></a> -<span class="sourceLineNo">291</span> // Secondary cost aims to favor servers with high node locality and high<a name="line.291"></a> -<span class="sourceLineNo">292</span> // rack locality since the tertiary will be chosen from the same rack as<a name="line.292"></a> -<span class="sourceLineNo">293</span> // the secondary. This could be negative, but that is okay.<a name="line.293"></a> -<span class="sourceLineNo">294</span> secondaryCost[i][j] = 2 - (localityPerServer[i][j] + totalRackLocality);<a name="line.294"></a> -<span class="sourceLineNo">295</span><a name="line.295"></a> -<span class="sourceLineNo">296</span> // Tertiary cost is only concerned with the node locality. It will later<a name="line.296"></a> -<span class="sourceLineNo">297</span> // be restricted to only hosts on the same rack as the secondary.<a name="line.297"></a> -<span class="sourceLineNo">298</span> tertiaryCost[i][j] = 1 - localityPerServer[i][j];<a name="line.298"></a> -<span class="sourceLineNo">299</span> }<a name="line.299"></a> -<span class="sourceLineNo">300</span> }<a name="line.300"></a> -<span class="sourceLineNo">301</span> }<a name="line.301"></a> -<span class="sourceLineNo">302</span><a name="line.302"></a> -<span class="sourceLineNo">303</span> if (this.enforceMinAssignmentMove && currentAssignmentMap != null) {<a name="line.303"></a> -<span class="sourceLineNo">304</span> // We want to minimize the number of regions which move as the result of a<a name="line.304"></a> -<span class="sourceLineNo">305</span> // new assignment. Therefore, slightly penalize any placement which is for<a name="line.305"></a> -<span class="sourceLineNo">306</span> // a host that is not currently serving the region.<a name="line.306"></a> -<span class="sourceLineNo">307</span> for (int i = 0; i < numRegions; i++) {<a name="line.307"></a> -<span class="sourceLineNo">308</span> for (int j = 0; j < servers.size(); j++) {<a name="line.308"></a> -<span class="sourceLineNo">309</span> ServerName currentAddress = currentAssignmentMap.get(regions.get(i));<a name="line.309"></a> -<span class="sourceLineNo">310</span> if (currentAddress != null &&<a name="line.310"></a> -<span class="sourceLineNo">311</span> !currentAddress.equals(servers.get(j))) {<a name="line.311"></a> -<span class="sourceLineNo">312</span> for (int k = 0; k < slotsPerServer; k++) {<a name="line.312"></a> -<span class="sourceLineNo">313</span> primaryCost[i][j * slotsPerServer + k] += NOT_CURRENT_HOST_PENALTY;<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> }<a name="line.316"></a> -<span class="sourceLineNo">317</span> }<a name="line.317"></a> -<span class="sourceLineNo">318</span> }<a name="line.318"></a> -<span class="sourceLineNo">319</span><a name="line.319"></a> -<span class="sourceLineNo">320</span> // Artificially increase cost of last slot of each server to evenly<a name="line.320"></a> -<span class="sourceLineNo">321</span> // distribute the slop, otherwise there will be a few servers with too few<a name="line.321"></a> -<span class="sourceLineNo">322</span> // regions and many servers with the max number of regions.<a name="line.322"></a> -<span class="sourceLineNo">323</span> for (int i = 0; i < numRegions; i++) {<a name="line.323"></a> -<span class="sourceLineNo">324</span> for (int j = 0; j < regionSlots; j += slotsPerServer) {<a name="line.324"></a> -<span class="sourceLineNo">325</span> primaryCost[i][j] += LAST_SLOT_COST_PENALTY;<a name="line.325"></a> -<span class="sourceLineNo">326</span> secondaryCost[i][j] += LAST_SLOT_COST_PENALTY;<a name="line.326"></a> -<span class="sourceLineNo">327</span> tertiaryCost[i][j] += LAST_SLOT_COST_PENALTY;<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><a name="line.330"></a> -<span class="sourceLineNo">331</span> RandomizedMatrix randomizedMatrix = new RandomizedMatrix(numRegions,<a name="line.331"></a> -<span class="sourceLineNo">332</span> regionSlots);<a name="line.332"></a> -<span class="sourceLineNo">333</span> primaryCost = randomizedMatrix.transform(primaryCost);<a name="line.333"></a> -<span class="sourceLineNo">334</span> int[] primaryAssignment = new MunkresAssignment(primaryCost).solve();<a name="line.334"></a> -<span class="sourceLineNo">335</span> primaryAssignment = randomizedMatrix.invertIndices(primaryAssignment);<a name="line.335"></a> -<span class="sourceLineNo">336</span><a name="line.336"></a> -<span class="sourceLineNo">337</span> // Modify the secondary and tertiary costs for each region/server pair to<a name="line.337"></a> -<span class="sourceLineNo">338</span> // prevent a region from being assigned to the same rack for both primary<a name="line.338"></a> -<span class="sourceLineNo">339</span> // and either one of secondary or tertiary.<a name="line.339"></a> -<span class="sourceLineNo">340</span> for (int i = 0; i < numRegions; i++) {<a name="line.340"></a> -<span class="sourceLineNo">341</span> int slot = primaryAssignment[i];<a name="line.341"></a> -<span class="sourceLineNo">342</span> String rack = rackManager.getRack(servers.get(slot / slotsPerServer));<a name="line.342"></a> -<span class="sourceLineNo">343</span> for (int k = 0; k < servers.size(); k++) {<a name="line.343"></a> -<span class="sourceLineNo">344</span> if (!rackManager.getRack(servers.get(k)).equals(rack)) {<a name="line.344"></a> -<span class="sourceLineNo">345</span> continue;<a name="line.345"></a> -<span class="sourceLineNo">346</span> }<a name="line.346"></a> -<span class="sourceLineNo">347</span> if (k == slot / slotsPerServer) {<a name="line.347"></a> -<span class="sourceLineNo">348</span> // Same node, do not place secondary or tertiary here ever.<a name="line.348"></a> -<span class="sourceLineNo">349</span> for (int m = 0; m < slotsPerServer; m++) {<a name="line.349"></a> -<span class="sourceLineNo">350</span> secondaryCost[i][k * slotsPerServer + m] = MAX_COST;<a name="line.350"></a> -<span class="sourceLineNo">351</span> tertiaryCost[i][k * slotsPerServer + m] = MAX_COST;<a name="line.351"></a> -<span class="sourceLineNo">352</span> }<a name="line.352"></a> -<span class="sourceLineNo">353</span> } else {<a name="line.353"></a> -<span class="sourceLineNo">354</span> // Same rack, do not place secondary or tertiary here if possible.<a name="line.354"></a> -<span class="sourceLineNo">355</span> for (int m = 0; m < slotsPerServer; m++) {<a name="line.355"></a> -<span class="sourceLineNo">356</span> secondaryCost[i][k * slotsPerServer + m] = AVOID_COST;<a name="line.356"></a> -<span class="sourceLineNo">357</span> tertiaryCost[i][k * slotsPerServer + m] = AVOID_COST;<a name="line.357"></a> -<span class="sourceLineNo">358</span> }<a name="line.358"></a> -<span class="sourceLineNo">359</span> }<a name="line.359"></a> -<span class="sourceLineNo">360</span> }<a name="line.360"></a> -<span class="sourceLineNo">361</span> }<a name="line.361"></a> -<span class="sourceLineNo">362</span> if (munkresForSecondaryAndTertiary) {<a name="line.362"></a> -<span class="sourceLineNo">363</span> randomizedMatrix = new RandomizedMatrix(numRegions, regionSlots);<a name="line.363"></a> -<span class="sourceLineNo">364</span> secondaryCost = randomizedMatrix.transform(secondaryCost);<a name="line.364"></a> -<span class="sourceLineNo">365</span> int[] secondaryAssignment = new MunkresAssignment(secondaryCost).solve();<a name="line.365"></a> -<span class="sourceLineNo">366</span> secondaryAssignment = randomizedMatrix.invertIndices(secondaryAssignment);<a name="line.366"></a> -<span class="sourceLineNo">367</span><a name="line.367"></a> -<span class="sourceLineNo">368</span> // Modify the tertiary costs for each region/server pair to ensure that a<a name="line.368"></a> -<span class="sourceLineNo">369</span> // region is assigned to a tertiary server on the same rack as its secondary<a name="line.369"></a> -<span class="sourceLineNo">370</span> // server, but not the same server in that rack.<a name="line.370"></a> -<span class="sourceLineNo">371</span> for (int i = 0; i < numRegions; i++) {<a name="line.371"></a> -<span class="sourceLineNo">372</span> int slot = secondaryAssignment[i];<a name="line.372"></a> -<span class="sourceLineNo">373</span> String rack = rackManager.getRack(servers.get(slot / slotsPerServer));<a name="line.373"></a> -<span class="sourceLineNo">374</span> for (int k = 0; k < servers.size(); k++) {<a name="line.374"></a> -<span class="sourceLineNo">375</span> if (k == slot / slotsPerServer) {<a name="line.375"></a> -<span class="sourceLineNo">376</span> // Same node, do not place tertiary here ever.<a name="line.376"></a> -<span class="sourceLineNo">377</span> for (int m = 0; m < slotsPerServer; m++) {<a name="line.377"></a> -<span class="sourceLineNo">378</span> tertiaryCost[i][k * slotsPerServer + m] = MAX_COST;<a name="line.378"></a> -<span class="sourceLineNo">379</span> }<a name="line.379"></a> -<span class="sourceLineNo">380</span> } else {<a name="line.380"></a> -<span class="sourceLineNo">381</span> if (rackManager.getRack(servers.get(k)).equals(rack)) {<a name="line.381"></a> -<span class="sourceLineNo">382</span> continue;<a name="line.382"></a> -<span class="sourceLineNo">383</span> }<a name="line.383"></a> -<span class="sourceLineNo">384</span> // Different rack, do not place tertiary here if possible.<a name="line.384"></a> -<span class="sourceLineNo">385</span> for (int m = 0; m < slotsPerServer; m++) {<a name="line.385"></a> -<span class="sourceLineNo">386</span> tertiaryCost[i][k * slotsPerServer + m] = AVOID_COST;<a name="line.386"></a> -<span class="sourceLineNo">387</span> }<a name="line.387"></a> -<span class="sourceLineNo">388</span> }<a name="line.388"></a> -<span class="sourceLineNo">389</span> }<a name="line.389"></a> -<span class="sourceLineNo">390</span> }<a name="line.390"></a> -<span class="sourceLineNo">391</span><a name="line.391"></a> -<span class="sourceLineNo">392</span> randomizedMatrix = new RandomizedMatrix(numRegions, regionSlots);<a name="line.392"></a> -<span class="sourceLineNo">393</span> tertiaryCost = randomizedMatrix.transform(tertiaryCost);<a name="line.393"></a> -<span class="sourceLineNo">394</span> int[] tertiaryAssignment = new MunkresAssignment(tertiaryCost).solve();<a name="line.394"></a> -<span class="sourceLineNo">395</span> tertiaryAssignment = randomizedMatrix.invertIndices(tertiaryAssignment);<a name="line.395"></a> -<span class="sourceLineNo">396</span><a name="line.396"></a> -<span class="sourceLineNo">397</span> for (int i = 0; i < numRegions; i++) {<a name="line.397"></a> -<span class="sourceLineNo">398</span> List<ServerName> favoredServers<a name="line.398"></a> -<span class="sourceLineNo">399</span> = new ArrayList<>(FavoredNodeAssignmentHelper.FAVORED_NODES_NUM);<a name="line.399"></a> -<span class="sourceLineNo">400</span> ServerName s = servers.get(primaryAssignment[i] / slotsPerServer);<a name="line.400"></a> -<span class="sourceLineNo">401</span> favoredServers.add(ServerName.valueOf(s.getHostname(), s.getPort(),<a name="line.401"></a> -<span class="sourceLineNo">402</span> ServerName.NON_STARTCODE));<a name="line.402"></a> -<span class="sourceLineNo">403</span><a name="line.403"></a> -<span class="sourceLineNo">404</span> s = servers.get(secondaryAssignment[i] / slotsPerServer);<a name="line.404"></a> -<span class="sourceLineNo">405</span> favoredServers.add(ServerName.valueOf(s.getHostname(), s.getPort(),<a name="line.405"></a> -<span class="sourceLineNo">406</span> ServerName.NON_STARTCODE));<a name="line.406"></a> -<span class="sourceLineNo">407</span><a name="line.407"></a> -<span class="sourceLineNo">408</span> s = servers.get(tertiaryAssignment[i] / slotsPerServer);<a name="line.408"></a> -<span class="sourceLineNo">409</span> favoredServers.add(ServerName.valueOf(s.getHostname(), s.getPort(),<a name="line.409"></a> -<span class="sourceLineNo">410</span> ServerName.NON_STARTCODE));<a name="line.410"></a> -<span class="sourceLineNo">411</span> // Update the assignment plan<a name="line.411"></a> -<span class="sourceLineNo">412</span> plan.updateFavoredNodesMap(regions.get(i), favoredServers);<a name="line.412"></a> -<span class="sourceLineNo">413</span> }<a name="line.413"></a> -<span class="sourceLineNo">414</span> LOG.info("Generated the assignment plan for " + numRegions +<a name="line.414"></a> -<span class="sourceLineNo">415</span> " regions from table " + tableName + " with " +<a name="line.415"></a> -<span class="sourceLineNo">416</span> servers.size() + " region servers");<a name="line.416"></a> -<span class="sourceLineNo">417</span> LOG.info("Assignment plan for secondary and tertiary generated " +<a name="line.417"></a> -<span class="sourceLineNo">418</span> "using MunkresAssignment");<a name="line.418"></a> -<span class="sourceLineNo">419</span> } else {<a name="line.419"></a> -<span class="sourceLineNo">420</span> Map<RegionInfo, ServerName> primaryRSMap = new HashMap<>();<a name="line.420"></a> -<span class="sourceLineNo">421</span> for (int i = 0; i < numRegions; i++) {<a name="line.421"></a> -<span class="sourceLineNo">422</span> primaryRSMap.put(regions.get(i), servers.get(primaryAssignment[i] / slotsPerServer));<a name="line.422"></a> -<span class="sourceLineNo">423</span> }<a name="line.423"></a> -<span class="sourceLineNo">424</span> FavoredNodeAssignmentHelper favoredNodeHelper =<a name="line.424"></a> -<span class="sourceLineNo">425</span> new FavoredNodeAssignmentHelper(servers, conf);<a name="line.425"></a> -<span class="sourceLineNo">426</span> favoredNodeHelper.initialize();<a name="line.426"></a> -<span class="sourceLineNo">427</span> Map<RegionInfo, ServerName[]> secondaryAndTertiaryMap =<a name="line.427"></a> -<span class="sourceLineNo">428</span> favoredNodeHelper.placeSecondaryAndTertiaryWithRestrictions(primaryRSMap);<a name="line.428"></a> -<span class="sourceLineNo">429</span> for (int i = 0; i < numRegions; i++) {<a name="line.429"></a> -<span class="sourceLineNo">430</span> List<ServerName> favoredServers<a name="line.430"></a> -<span class="sourceLineNo">431</span> = new ArrayList<>(FavoredNodeAssignmentHelper.FAVORED_NODES_NUM);<a name="line.431"></a> -<span class="sourceLineNo">432</span> RegionInfo currentRegion = regions.get(i);<a name="line.432"></a> -<span class="sourceLineNo">433</span> ServerName s = primaryRSMap.get(currentRegion);<a name="line.433"></a> -<span class="sourceLineNo">434</span> favoredServers.add(ServerName.valueOf(s.getHostname(), s.getPort(),<a name="line.434"></a> -<span class="sourceLineNo">435</span> ServerName.NON_STARTCODE));<a name="line.435"></a> -<span class="sourceLineNo">436</span><a name="line.436"></a> -<span class="sourceLineNo">437</span> ServerName[] secondaryAndTertiary =<a name="line.437"></a> -<span class="sourceLineNo">438</span> secondaryAndTertiaryMap.get(currentRegion);<a name="line.438"></a> -<span class="sourceLineNo">439</span> s = secondaryAndTertiary[0];<a name="line.439"></a> -<span class="sourceLineNo">440</span> favoredServers.add(ServerName.valueOf(s.getHostname(), s.getPort(),<a name="line.440"></a> -<span class="sourceLineNo">441</span> ServerName.NON_STARTCODE));<a name="line.441"></a> -<span class="sourceLineNo">442</span><a name="line.442"></a> -<span class="sourceLineNo">443</span> s = secondaryAndTertiary[1];<a name="line.443"></a> -<span class="sourceLineNo">444</span> favoredServers.add(ServerName.valueOf(s.getHostname(), s.getPort(),<a name="line.444"></a> -<span class="sourceLineNo">445</span> ServerName.NON_STARTCODE));<a name="line.445"></a> -<span class="sourceLineNo">446</span> // Update the assignment plan<a name="line.446"></a> -<span class="sourceLineNo">447</span> plan.updateFavoredNodesMap(regions.get(i), favoredServers);<a name="line.447"></a> -<span class="sourceLineNo">448</span> }<a name="line.448"></a> -<span class="sourceLineNo">449</span> LOG.info("Generated the assignment plan for " + numRegions +<a name="line.449"></a> -<span class="sourceLineNo">450</span> " regions from table " + tableName + " with " +<a name="line.450"></a> -<span class="sourceLineNo">451</span> servers.size() + " region servers");<a name="line.451"></a> -<span class="sourceLineNo">452</span> LOG.info("Assignment plan for secondary and tertiary generated " +<a name="line.452"></a> -<span class="sourceLineNo">453</span> "using placeSecondaryAndTertiaryWithRestrictions method");<a name="line.453"></a> -<span class="sourceLineNo">454</span> }<a name="line.454"></a> -<span class="sourceLineNo">455</span> }<a name="line.455"></a> -<span class="sourceLineNo">456</span><a name="line.456"></a> -<span class="sourceLineNo">457</span> public FavoredNodesPlan getNewAssignmentPlan() throws IOException {<a name="line.457"></a> -<span class="sourceLineNo">458</span> // Get the current region assignment snapshot by scanning from the META<a name="line.458"></a> -<span class="sourceLineNo">459</span> SnapshotOfRegionAssignmentFromMeta assignmentSnapshot =<a name="line.459"></a> -<span class="sourceLineNo">460</span> this.getRegionAssignmentSnapshot();<a name="line.460"></a> -<span class="sourceLineNo">461</span><a name="line.461"></a> -<span class="sourceLineNo">462</span> // Get the region locality map<a name="line.462"></a> -<span class="sourceLineNo">463</span> Map<String, Map<String, Float>> regionLocalityMap = null;<a name="line.463"></a> -<span class="sourceLineNo">464</span> if (this.enforceLocality) {<a name="line.464"></a> -<span class="sourceLineNo">465</span> regionLocalityMap = FSUtils.getRegionDegreeLocalityMappingFromFS(conf);<a name="line.465"></a> -<span class="sourceLineNo">466</span> }<a name="line.466"></a> -<span class="sourceLineNo">467</span> // Initialize the assignment plan<a name="line.467"></a> -<span class="sourceLineNo">468</span> FavoredNodesPlan plan = new FavoredNodesPlan();<a name="line.468"></a> -<span class="sourceLineNo">469</span><a name="line.469"></a> -<span class="sourceLineNo">470</span> // Get the table to region mapping<a name="line.470"></a> -<span class="sourceLineNo">471</span> Map<TableName, List<RegionInfo>> tableToRegionMap =<a name="line.471"></a> -<span class="sourceLineNo">472</span> assignmentSnapshot.getTableToRegionMap();<a name="line.472"></a> -<span class="sourceLineNo">473</span> LOG.info("Start to generate the new assignment plan for the " +<a name="line.473"></a> -<span class="sourceLineNo">474</span> + tableToRegionMap.keySet().size() + " tables" );<a name="line.474"></a> -<span class="sourceLineNo">475</span> for (TableName table : tableToRegionMap.keySet()) {<a name="line.475"></a> -<span class="sourceLineNo">476</span> try {<a name="line.476"></a> -<span class="sourceLineNo">477</span> if (!this.targetTableSet.isEmpty() &&<a name="line.477"></a> -<span class="sourceLineNo">478</span> !this.targetTableSet.contains(table)) {<a name="line.478"></a> -<span class="sourceLineNo">479</span> continue;<a name="line.479"></a> -<span class="sourceLineNo">480</span> }<a name="line.480"></a> -<span class="sourceLineNo">481</span> // TODO: maybe run the placement in parallel for each table<a name="line.481"></a> -<span class="sourceLineNo">482</span> genAssignmentPlan(table, assignmentSnapshot, regionLocalityMap, plan,<a name="line.482"></a> -<span class="sourceLineNo">483</span> USE_MUNKRES_FOR_PLACING_SECONDARY_AND_TERTIARY);<a name="line.483"></a> -<span class="sourceLineNo">484</span> } catch (Exception e) {<a name="line.484"></a> -<span class="sourceLineNo">485</span> LOG.error("Get some exceptions for placing primary region server" +<a name="line.485"></a> -<span class="sourceLineNo">486</span> "for table " + table + " because " + e);<a name="line.486"></a> -<span class="sourceLineNo">487</span> }<a name="line.487"></a> -<span class="sourceLineNo">488</span> }<a name="line.488"></a> -<span class="sourceLineNo">489</span> LOG.info("Finish to generate the new assignment plan for the " +<a name="line.489"></a> -<span class="sourceLineNo">490</span> + tableToRegionMap.keySet().size() + " tables" );<a name="line.490"></a> -<span class="sourceLineNo">491</span> return plan;<a name="line.491"></a> -<span class="sourceLineNo">492</span> }<a name="line.492"></a> -<span class="sourceLineNo">493</span><a name="line.493"></a> -<span class="sourceLineNo">494</span> /**<a name="line.494"></a> -<span class="sourceLineNo">495</span> * Some algorithms for solving the assignment problem may traverse workers or<a name="line.495"></a> -<span class="sourceLineNo">496</span> * jobs in linear order which may result in skewing the assignments of the<a name="line.496"></a> -<span class="sourceLineNo">497</span> * first jobs in the matrix toward the last workers in the matrix if the<a name="line.497"></a> -<span class="sourceLineNo">498</span> * costs are uniform. To avoid this kind of clumping, we can randomize the<a name="line.498"></a> -<span class="sourceLineNo">499</span> * rows and columns of the cost matrix in a reversible way, such that the<a name="line.499"></a> -<span class="sourceLineNo">500</span> * solution to the assignment problem can be interpreted in terms of the<a name="line.500"></a> -<span class="sourceLineNo">501</span> * original untransformed cost matrix. Rows and columns are transformed<a name="line.501"></a> -<span class="sourceLineNo">502</span> * independently such that the elements contained in any row of the input<a name="line.502"></a> -<span class="sourceLineNo">503</span> * matrix are the same as the elements in the corresponding output matrix,<a name="line.503"></a> -<span class="sourceLineNo">504</span> * and each row has its elements transformed in the same way. Similarly for<a name="line.504"></a> -<span class="sourceLineNo">505</span> * columns.<a name="line.505"></a> -<span class="sourceLineNo">506</span> */<a name="line.506"></a> -<span class="sourceLineNo">507</span> protected static class RandomizedMatrix {<a name="line.507"></a> -<span class="sourceLineNo">508</span> private final int rows;<a name="line.508"></a> -<span class="sourceLineNo">509</span> private final int cols;<a name="line.509"></a> -<span class="sourceLineNo">510</span> private final int[] rowTransform;<a name="line.510"></a> -<span class="sourceLineNo">511</span> private final int[] rowInverse;<a name="line.511"></a> -<span class="sourceLineNo">512</span> private final int[] colTransform;<a name="line.512"></a> -<span class="sourceLineNo">513</span> private final int[] colInverse;<a name="line.513"></a> -<span class="sourceLineNo">514</span><a name="line.514"></a> -<span class="sourceLineNo">515</span> /**<a name="line.515"></a> -<span class="sourceLineNo">516</span> * Create a randomization scheme for a matrix of a given size.<a name="line.516"></a> -<span class="sourceLineNo">517</span> * @param rows the number of rows in the matrix<a name="line.517"></a> -<span class="sourceLineNo">518</span> * @param cols the number of columns in the matrix<a name="line.518"></a> -<span class="sourceLineNo">519</span> */<a name="line.519"></a> -<span class="sourceLineNo">520</span> public RandomizedMatrix(int rows, int cols) {<a name="line.520"></a> -<span class="sourceLineNo">521</span> this.rows = rows;<a name="line.521"></a> -<span class="sourceLineNo">522</span> this.cols = cols;<a name="line.522"></a> -<span class="sourceLineNo">523</span> Random random = new Random();<a name="line.523"></a> -<span class="sourceLineNo">524</span> rowTransform = new int[rows];<a name="line.524"></a> -<span class="sourceLineNo">525</span> rowInverse = new int[rows];<a name="line.525"></a> -<span class="sourceLineNo">526</span> for (int i = 0; i < rows; i++) {<a name="line.526"></a> -<span class="sourceLineNo">527</span> rowTransform[i] = i;<a name="line.527"></a> -<span class="sourceLineNo">528</span> }<a name="line.528"></a> -<span class="sourceLineNo">529</span> // Shuffle the row indices.<a name="line.529"></a> -<span class="sourceLineNo">530</span> for (int i = rows - 1; i >= 0; i--) {<a name="line.530"></a> -<span class="sourceLineNo">531</span> int r = random.nextInt(i + 1);<a name="line.531"></a> -<span class="sourceLineNo">532</span> int temp = rowTransform[r];<a name="line.532"></a> -<span class="sourceLineNo">533</span> rowTransform[r] = rowTransform[i];<a name="line.533"></a> -<span class="sourceLineNo">534</span> rowTransform[i] = temp;<a name="line.534"></a> -<span class="sourceLineNo">535</span> }<a name="line.535"></a> -<span class="sourceLineNo">536</span> // Generate the inverse row indices.<a name="line.536"></a> -<span class="sourceLineNo">537</span> for (int i = 0; i < rows; i++) {<a name="line.537"></a> -<span class="sourceLineNo">538</span> rowInverse[rowTransform[i]] = i;<a name="line.538"></a> -<span class="sourceLineNo">539</span> }<a name="line.539"></a> -<span class="sourceLineNo">540</span><a name="line.540"></a> -<span class="sourceLineNo">541</span> colTransform = new int[cols];<a name="line.541"></a> -<span class="sourceLineNo">542</span> colInverse = new int[cols];<a name="line.542"></a> -<span class="sourceLineNo">543</span> for (int i = 0; i < cols; i++) {<a name="line.543"></a> -<span class="sourceLineNo">544</span> colTransform[i] = i;<a name="line.544"></a> -<span class="sourceLineNo">545</span> }<a name="line.545"></a> -<span class="sourceLineNo">546</span> // Shuffle the column indices.<a name="line.546"></a> -<span class="sourceLineNo">547</span> for (int i = cols - 1; i >= 0; i--) {<a name="line.547"></a> -<span class="sourceLineNo">548</span> int r = random.nextInt(i + 1);<a name="line.548"></a> -<span class="sourceLineNo">549</span> int temp = colTransform[r];<a name="line.549"></a> -<span class="sourceLineNo">550</span> colTransform[r] = colTransform[i];<a name="line.550"></a> -<span class="sourceLineNo">551</span> colTransform[i] = temp;<a name="line.551"></a> -<span class="sourceLineNo">552</span> }<a name="line.552"></a> -<span class="sourceLineNo">553</span> // Generate the inverse column indices.<a name="line.553"></a> -<span class="sourceLineNo">554</span> for (int i = 0; i < cols; i++) {<a name="line.554"></a> -<span class="sourceLineNo">555</span> colInverse[colTransform[i]] = i;<a name="line.555"></a> -<span class="sourceLineNo">556</span> }<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> * Copy a given matrix into a new matrix, transforming each row index and<a name="line.560"></a> -<span class="sourceLineNo">561</span> * each column index according to the randomization scheme that was created<a name="line.561"></a> -<span class="sourceLineNo">562</span> * at construction time.<a name="line.562"></a> -<span class="sourceLineNo">563</span> * @param matrix the cost matrix to transform<a name="line.563"></a> -<span class="sourceLineNo">564</span> * @return a new matrix with row and column indices transformed<a name="line.564"></a> -<span class="sourceLineNo">565</span> */<a name="line.565"></a> -<span class="sourceLineNo">566</span> public float[][] transform(float[][] matrix) {<a name="line.566"></a> -<span class="sourceLineNo">567</span> float[][] result = new float[rows][cols];<a name="line.567"></a> -<span class="sourceLineNo">568</span> for (int i = 0; i < rows; i++) {<a name="line.568"></a> -<span class="sourceLineNo">569</span> for (int j = 0; j < cols; j++) {<a name="line.569"></a> -<span class="sourceLineNo">570</span> result[rowTransform[i]][colTransform[j]] = matrix[i][j];<a name="line.570"></a> -<span class="sourceLineNo">571</span> }<a name="line.571"></a> -<span class="sourceLineNo">572</span> }<a name="line.572"></a> -<span class="sourceLineNo">573</span> return result;<a name="line.573"></a> -<span class="sourceLineNo">574</span> }<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> * Copy a given matrix into a new matrix, transforming each row index and<a name="line.577"></a> -<span class="sourceLineNo">578</span> * each column index according to the inverse of the randomization scheme<a name="line.578"></a> -<span class="sourceLineNo">579</span> * that was created at construction time.<a name="line.579"></a> -<span class="sourceLineNo">580</span> * @param matrix the cost matrix to be inverted<a name="line.580"></a> -<span class="sourceLineNo">581</span> * @return a new matrix with row and column indices inverted<a name="line.581"></a> -<span class="sourceLineNo">582</span> */<a name="line.582"></a> -<span class="sourceLineNo">583</span> public float[][] invert(float[][] matrix) {<a name="line.583"></a> -<span class="sourceLineNo">584</span> float[][] result = new float[rows][cols];<a name="line.584"></a> -<span class="sourceLineNo">585</span> for (int i = 0; i < rows; i++) {<a name="line.585"></a> -<span class="sourceLineNo">586</span> for (int j = 0; j < cols; j++) {<a name="line.586"></a> -<span class="sourceLineNo">587</span> result[rowInverse[i]][colInverse[j]] = matrix[i][j];<a name="line.587"></a> -<span class="sourceLineNo">588</span> }<a name="line.588"></a> -<span class="sourceLineNo">589</span> }<a name="line.589"></a> -<span class="sourceLineNo">590</span> return result;<a name="line.590"></a> -<span class="sourceLineNo">591</span> }<a name="line.591"></a> -<span class="sourceLineNo">592</span><a name="line.592"></a> -<span class="sourceLineNo">593</span> /**<a name="line.593"></a> -<span class="sourceLineNo">594</span> * Given an array where each element {@code indices[i]} represents the<a name="line.594"></a> -<span class="sourceLineNo">595</span> * randomized column index corresponding to randomized row index {@code i},<a name="line.595"></a> -<span class="sourceLineNo">596</span> * create a new array with the corresponding inverted indices.<a name="line.596"></a> -<span class="sourceLineNo">597</span> * @param indices an array of transformed indices to be inverted<a name="line.597"></a> -<span class="sourceLineNo">598</span> * @return an array of inverted indices<a name="line.598"></a> -<span class="sourceLineNo">599</span> */<a name="line.599"></a> -<span class="sourceLineNo">600</span> public int[] invertIndices(int[] indices) {<a name="line.600"></a> -<span class="sourceLineNo">601</span> int[] result = new int[indices.length];<a name="line.601"></a> -<span class="sourceLineNo">602</span> for (int i = 0; i < indices.length; i++) {<a name="line.602"></a> -<span class="sourceLineNo">603</span> result[rowInverse[i]] = colInverse[indices[i]];<a name="line.603"></a> -<span class="sourceLineNo">604</span> }<a name="line.604"></a> -<span class="sourceLineNo">605</span> return result;<a name="line.605"></a> -<span class="sourceLineNo">606</span> }<a name="line.606"></a> -<span class="sourceLineNo">607</span> }<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> * Print the assignment plan to the system output stream<a name="line.610"></a> -<span class="sourceLineNo">611</span> * @param plan<a name="line.611"></a> -<span class="sourceLineNo">612</span> */<a name="line.612"></a> -<span class="sourceLineNo">613</span> public static void printAssignmentPlan(FavoredNodesPlan plan) {<a name="line.613"></a> -<span class="sourceLineNo">614</span> if (plan == null) return;<a name="line.614"></a> -<span class="sourceLineNo">615</span> LOG.info("========== Start to print the assignment plan ================");<a name="line.615"></a> -<span class="sourceLineNo">616</span> // sort the map based on region info<a name="line.616"></a> -<span class="sourceLineNo">617</span> Map<String, List<ServerName>> assignmentMap = new TreeMap<>(plan.getAssignmentMap());<a name="line.617"></a> -<span class="sourceLineNo">618</span><a name="line.618"></a> -<span class="sourceLineNo">619</span> for (Map.Entry<String, List<ServerName>> entry : assignmentMap.entrySet()) {<a name="line.619"></a> -<span class="sourceLineNo">620</span><a name="line.620"></a> -<span class="sourceLineNo">621</span> String serverList = FavoredNodeAssignmentHelper.getFavoredNodesAsString(entry.getValue());<a name="line.621"></a> -<span class="sourceLineNo">622</span> String regionName = entry.getKey();<a name="line.622"></a> -<span class="sourceLineNo">623</span> LOG.info("Region: " + regionName );<a name="line.623"></a> -<span class="sourceLineNo">624</span> LOG.info("Its favored nodes: " + serverList);<a name="line.624"></a> -<span class="sourceLineNo">625</span> }<a name="line.625"></a> -<span class="sourceLineNo">626</span> LOG.info("========== Finish to print the assignment plan ================");<a name="line.626"></a> -<span class="sourceLineNo">627</span> }<a name="line.627"></a> -<span class="sourceLineNo">628</span><a name="line.628"></a> -<span class="sourceLineNo">629</span> /**<a name="line.629"></a> -<span class="sourceLineNo">630</span> * Update the assignment plan into hbase:meta<a name="line.630"></a> -<span class="sourceLineNo">631</span> * @param plan the assignments plan to be updated into hbase:meta<a name="line.631"></a> -<span class="sourceLineNo">632</span> * @throws IOException if cannot update assignment plan in hbase:meta<a name="line.632"></a> -<span class="sourceLineNo">633</span> */<a name="line.633"></a> -<span class="sourceLineNo">634</span> public void updateAssignmentPlanToMeta(FavoredNodesPlan plan)<a name="line.634"></a> -<span class="sourceLineNo">635</span> throws IOException {<a name="line.635"></a> -<span class="sourceLineNo">636</span> try {<a name="line.636"></a> -<span class="sourceLineNo">637</span> LOG.info("Start to update the hbase:meta with the new assignment plan");<a name="line.637"></a> -<span class="sourceLineNo">638</span> Map<String, List<ServerName>> assignmentMap = plan.getAssignmentMap();<a name="line.638"></a> -<span class="sourceLineNo">639</span> Map<RegionInfo, List<ServerName>> planToUpdate = new HashMap<>(assignmentMap.size());<a name="line.639"></a> -<span class="sourceLineNo">640</span> Map<String, RegionInfo> regionToRegionInfoMap =<a name="line.640"></a> -<span class="sourceLineNo">641</span> getRegionAssignmentSnapshot().getRegionNameToRegionInfoMap();<a name="line.641"></a> -<span class="sourceLineNo">642</span> for (Map.Entry<String, List<ServerName>> entry : assignmentMap.entrySet()) {<a name="line.642"></a> -<span class="sourceLineNo">643</span> planToUpdate.put(regionToRegionInfoMap.get(entry.getKey()), entry.getValue());<a name="line.643"></a> -<span class="sourceLineNo">644</span> }<a name="line.644"></a> -<span class="sourceLineNo">645</span><a name="line.645"></a> -<span class="sourceLineNo">646</span> FavoredNodeAssignmentHelper.updateMetaWithFavoredNodesInfo(planToUpdate, conf);<a name="line.646"></a> -<span class="sourceLineNo">647</span> LOG.info("Updated the hbase:meta with the new assignment plan");<a name="line.647"></a> -<span class="sourceLineNo">648</span> } catch (Exception e) {<a name="line.648"></a> -<span class="sourceLineNo">649</span> LOG.error("Failed to update hbase:meta with the new assignment" +<a name="line.649"></a> -<span class="sourceLineNo">650</span> "plan because " + e.getMessage());<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><a name="line.653"></a> -<span class="sourceLineNo">654</span> /**<a name="line.654"></a> -<span class="sourceLineNo">655</span> * Update the assignment plan to all the region servers<a name="line.655"></a> -<span class="sourceLineNo">656</span> * @param plan<a name="line.656"></a> -<span class="sourceLineNo">657</span> * @throws IOException<a name="line.657"></a> -<span class="sourceLineNo">658</span> */<a name="line.658"></a> -<span class="sourceLineNo">659</span> private void updateAssignmentPlanToRegionServers(FavoredNodesPlan plan)<a name="line.659"></a> -<span class="sourceLineNo">660</span> throws IOException{<a name="line.660"></a> -<span class="sourceLineNo">661</span> LOG.info("Start to update the region servers with the new assignment plan");<a name="line.661"></a> -<span class="sourceLineNo">662</span> // Get the region to region server map<a name="line.662"></a> -<span class="sourceLineNo">663</span> Map<ServerName, List<RegionInfo>> currentAssignment =<a name="line.663"></a> -<span class="sourceLineNo">664</span> this.getRegionAssignmentSnapshot().getRegionServerToRegionMap();<a name="line.664"></a> -<span class="sourceLineNo">665</span><a name="line.665"></a> -<span class="sourceLineNo">666</span> // track of the failed and succeeded updates<a name="line.666"></a> -<span class="sourceLineNo">667</span> int succeededNum = 0;<a name="line.667"></a> -<span class="sourceLineNo">668</span> Map<ServerName, Exception> failedUpdateMap = new HashMap<>();<a name="line.668"></a> -<span class="sourceLineNo">669</span><a name="line.669"></a> -<span class="sourceLineNo">670</span> for (Map.Entry<ServerName, List<RegionInfo>> entry :<a name="line.670"></a> -<span class="sourceLineNo">671</span> currentAssignment.entrySet()) {<a name="line.671"></a> -<span class="sourceLineNo">672</span> List<Pair<RegionInfo, List<ServerName>>> regionUpdateInfos = new ArrayList<>();<a name="line.672"></a> -<span class="sourceLineNo">673</span> try {<a name="line.673"></a> -<span class="sourceLineNo">674</span> // Keep track of the favored updates for the current region server<a name="line.674"></a> -<span class="sourceLineNo">675</span> FavoredNodesPlan singleServerPlan = null;<a name="line.675"></a> -<span class="sourceLineNo">676</span> // Find out all the updates for the current region server<a name="line.676"></a> -<span class="sourceLineNo">677</span> for (RegionInfo region : entry.getValue()) {<a name="line.677"></a> -<span class="sourceLineNo">678</span> List<ServerName> favoredServerList = plan.getFavoredNodes(region);<a name="line.678"></a> -<span class="sourceLineNo">679</span> if (favoredServerList != null &&<a name="line.679"></a> -<span class="sourceLineNo">680</span> favoredServerList.size() == FavoredNodeAssignmentHelper.FAVORED_NODES_NUM) {<a name="line.680"></a> -<span class="sourceLineNo">681</span> // Create the single server plan if necessary<a name="line.681"></a> -<span class="sourceLineNo">682</span> if (singleServerPlan == null) {<a name="line.682"></a> -<span class="sourceLineNo">683</span> singleServerPlan = new FavoredNodesPlan();<a name="line.683"></a> -<span class="sourceLineNo">684</span> }<a name="line.684"></a> -<span class="sourceLineNo">685</span> // Update the single server update<a name="line.685"></a> -<span class="sourceLineNo">686</span> singleServerPlan.updateFavoredNodesMap(region, favoredServerList);<a name="line.686"></a> -<span class="sourceLineNo">687</span> regionUpdateInfos.add(new Pair<>(region, favoredServerList));<a name="line.687"></a> -<span class="sourceLineNo">688</span> }<a name="line.688"></a> -<span class="sourceLineNo">689</span> }<a name="line.689"></a> -<span class="sourceLineNo">690</span> if (singleServerPlan != null) {<a name="line.690"></a> -<span class="sourceLineNo">691</span> // Update the current region server with its updated favored nodes<a name="line.691"></a> -<span class="sourceLineNo">692</span> BlockingInterface currentRegionServer =<a name="line.692"></a> -<span class="sourceLineNo">693</span> ((ClusterConnection)this.connection).getAdmin(entry.getKey());<a name="line.693"></a> -<span class="sourceLineNo">694</span> UpdateFavoredNodesRequest request =<a name="line.694"></a> -<span class="sourceLineNo">695</span> RequestConverter.buildUpdateFavoredNodesRequest(regionUpdateInfos);<a name="line.695"></a> -<span class="sourceLineNo">696</span><a name="line.696"></a> -<span class="sourceLineNo">697</span> UpdateFavoredNodesResponse updateFavoredNodesResponse =<a name="line.697"></a> -<span class="sourceLineNo">698</span> currentRegionServer.updateFavoredNodes(null, request);<a name="line.698"></a> -<span class="sourceLineNo">699</span> LOG.info("Region server " +<a name="line.699"></a> -<span class="sourceLineNo">700</span> ProtobufUtil.getServerInfo(null, currentRegionServer).getServerName() +<a name="line.700"></a> -<span class="sourceLineNo">701</span> " has updated " + updateFavoredNodesResponse.getResponse() + " / " +<a name="line.701"></a> -<span class="sourceLineNo">702</span> singleServerPlan.getAssignmentMap().size() +<a name="line.702"></a> -<span class="sourceLineNo">703</span> " regions with the assignment plan");<a name="line.703"></a> -<span class="sourceLineNo">704</span> succeededNum ++;<a name="line.704"></a> -<span class="sourceLineNo">705</span> }<a name="line.705"></a> -<span class="sourceLineNo">706</span> } catch (Exception e) {<a name="line.706"></a> -<span class="sourceLineNo">707</span> failedUpdateMap.put(entry.getKey(), e);<a name="line.707"></a> -<span class="sourceLineNo">708</span> }<a name="line.708"></a> -<span class="sourceLineNo">709</span> }<a name="line.709"></a> -<span class="sourceLineNo">710</span> // log the succeeded updates<a name="line.710"></a> -<span class="sourceLineNo">711</span> LOG.info("Updated " + succeededNum + " region servers with " +<a name="line.711"></a> -<span class="sourceLineNo">712</span> "the new assignment plan");<a name="line.712"></a> -<span class="sourceLineNo">713</span><a name="line.713"></a> -<span class="sourceLineNo">714</span> // log the failed updates<a name="line.714"></a> -<span class="sourceLineNo">715</span> int failedNum = failedUpdateMap.size();<a name="line.715"></a> -<span class="sourceLineNo">716</span> if (failedNum != 0) {<a name="line.716"></a> -<span class="sourceLineNo">717</span> LOG.error("Failed to update the following + " + failedNum +<a name="line.717"></a> -<span class="sourceLineNo">718</span> " region servers with its corresponding favored nodes");<a name="line.718"></a> -<span class="sourceLineNo">719</span> for (Map.Entry<ServerName, Exception> entry :<a name="line.719"></a> -<span class="sourceLineNo">720</span> failedUpdateMap.entrySet() ) {<a name="line.720"></a> -<span class="sourceLineNo">721</span> LOG.error("Failed to update " + entry.getKey().getHostAndPort() +<a name="line.721"></a> -<span class="sourceLineNo">722</span> " because of " + entry.getValue().getMessage());<a name="line.722"></a> -<span class="sourceLineNo">723</span> }<a name="line.723"></a> -<span class="sourceLineNo">724</span> }<a name="line.724"></a> -<span class="sourceLineNo">725</span> }<a name="line.725"></a> -<span class="sourceLineNo">726</span><a name="line.726"></a> -<span class="sourceLineNo">727</span> public void updateAssignmentPlan(FavoredNodesPlan plan)<a name="line.727"></a> -<span class="sourceLineNo">728</span> throws IOException {<a name="line.728"></a> -<span class="sourceLineNo">729</span> LOG.info("Start to update the new assignment plan for the hbase:meta table and" +<a name="line.729"></a> -<span class="sourceLineNo">730</span> " the region servers");<a name="line.730"></a> -<span class="sourceLineNo">731</span> // Update the new assignment plan to META<a name="line.731"></a> -<span class="sourceLineNo">732</span> updateAssignmentPlanToMeta(plan);<a name="line.732"></a> -<span class="sourceLineNo">733</span> // Update the new assignment plan to Region Servers<a name="line.733"></a> -<span class="sourceLineNo">734</span> updateAssignmentPlanToRegionServers(plan);<a name="line.734"></a> -<span class="sourceLineNo">735</span> LOG.info("Finish to update the new assignment plan for the hbase:meta table and" +<a name="line.735"></a> -<span class="sourceLineNo">736</span> " the region servers");<a name="line.736"></a> -<span class="sourceLineNo">737</span> }<a name="line.737"></a> -<span class="sourceLineNo">738</span><a name="line.738"></a> -<span class="sourceLineNo">739</span> /**<a name="line.739"></a> -<span class="sourceLineNo">740</span> * Return how many regions will move per table since their primary RS will<a name="line.740"></a> -<span class="sourceLineNo">741</span> * change<a name="line.741"></a> -<span class="sourceLineNo">742</span> *<a name="line.742"></a> -<span class="sourceLineNo">743</span> * @param newPlan - new AssignmentPlan<a name="line.743"></a> -<span class="sourceLineNo">744</span> * @return how many primaries will move per table<a name="line.744"></a> -<span class="sourceLineNo">745</span> */<a name="line.745"></a> -<span class="sourceLineNo">746</span> public Map<TableName, Integer> getRegionsMovement(FavoredNodesPlan newPlan)<a name="line.746"></a> -<span class="sourceLineNo">747</span> throws IOException {<a name="line.747"></a> -<span class="sourceLineNo">748</span> Map<TableName, Integer> movesPerTable = new HashMap<>();<a name="line.748"></a> -<span class="sourceLineNo">749</span> SnapshotOfRegionAssignmentFromMeta snapshot = this.getRegionAssignmentSnapshot();<a name="line.749"></a> -<span class="sourceLineNo">750</span> Map<TableName, List<RegionInfo>> tableToRegions = snapshot<a name="line.750"></a> -<span class="sourceLineNo">751</span> .getTableToRegionMap();<a name="line.751"></a> -<span class="sourceLineNo">752</span> FavoredNodesPlan oldPlan = snapshot.getExistingAssignmentPlan();<a name="line.752"></a> -<span class="sourceLineNo">753</span> Set<TableName> tables = snapshot.getTableSet();<a name="line.753"></a> -<span class="sourceLineNo">754</span> for (TableName table : tables) {<a name="line.754"></a> -<span class="sourceLineNo">755</span> int movedPrimaries = 0;<a name="line.755"></a> -<span class="sourceLineNo">756</span> if (!this.targetTableSet.isEmpty()<a name="line.756"></a> -<span class="sourceLineNo">757</span> && !this.targetTableSet.contains(table)) {<a name="line.757"></a> -<span class="sourceLineNo">758</span> continue;<a name="line.758"></a> -<span class="sourceLineNo">759</span> }<a name="line.759"></a> -<span class="sourceLineNo">760</span> List<RegionInfo> regions = tableToRegions.get(table);<a name="line.760"></a> -<span class="sourceLineNo">761</span> for (RegionInfo region : regions) {<a name="line.761"></a> -<span class="sourceLineNo">762</span> List<ServerName> oldServers = oldPlan.getFavoredNodes(region);<a name="line.762"></a> -<span class="sourceLineNo">763</span> List<ServerName> newServers = newPlan.getFavoredNodes(region);<a name="line.763"></a> -<span class="sourceLineNo">764</span> if (oldServers != null && newServers != null) {<a name="line.764"></a> -<span class="sourceLineNo">765</span> ServerName oldPrimary = oldServers.get(0);<a name="line.765"></a> -<span class="sourceLineNo">766</span> ServerName newPrimary = newServers.get(0);<a name="line.766"></a> -<span class="sourceLineNo">767</span> if (oldPrimary.compareTo(newPrimary) != 0) {<a name="line.767"></a> -<span class="sourceLineNo">768</span> movedPrimaries++;<a name="line.768"></a> -<span class="sourceLineNo">769</span> }<a name="line.769"></a> -<span class="sourceLineNo">770</span> }<a name="line.770"></a> -<span class="sourceLineNo">771</span> }<a name="line.771"></a> -<span class="sourceLineNo">772</span> movesPerTable.put(table, movedPrimaries);<a name="line.772"></a> -<span class="sourceLineNo">773</span> }<a name="line.773"></a> -<span class="sourceLineNo">774</span> return movesPerTable;<a name="line.774"></a> -<span class="sourceLineNo">775</span> }<a name="line.775"></a> -<span class="sourceLineNo">776</span><a name="line.776"></a> -<span class="sourceLineNo">777</span> /**<a name="line.777"></a> -<span class="sourceLineNo">778</span> * Compares two plans and check whether the locality dropped or increased<a name="line.778"></a> -<span class="sourceLineNo">779</span> * (prints the information as a string) also prints the baseline locality<a name="line.779"></a> -<span class="sourceLineNo">780</span> *<a name="line.780"></a> -<span class="sourceLineNo">781</span> * @param movesPerTable - how many primary regions will move per table<a name="line.781"></a> -<span class="sourceLineNo">782</span> * @param regionLocalityMap - locality map from FS<a name="line.782"></a> -<span class="sourceLineNo">783</span> * @param newPlan - new assignment plan<a name="line.783"></a> -<span class="sourceLineNo">784</span> * @throws IOException<a name="line.784"></a> -<span class="sourceLineNo">785</span> */<a name="line.785"></a> -<span class="sourceLineNo">786</span> public void checkDifferencesWithOldPlan(Map<TableName, Integer> movesPerTable,<a name="line.786"></a> -<span class="sourceLineNo">787</span> Map<String, Map<String, Float>> regionLocalityMap, FavoredNodesPlan newPlan)<a name="line.787"></a> -<span class="sourceLineNo">788</span> throws IOException {<a name="line.788"></a> -<span class="sourceLineNo">789</span> // localities for primary, secondary and tertiary<a name="line.789"></a> -<span class="sourceLineNo">790</span> SnapshotOfRegionAssignmentFromMeta snapshot = this.getRegionAssignmentSnapshot();<a name="line.790"></a> -<span class="sourceLineNo">791</span> FavoredNodesPlan oldPlan = snapshot.getExistingAssignmentPlan();<a name="line.791"></a> -<span class="sourceLineNo">792</span> Set<TableName> tables = snapshot.getTableSet();<a name="line.792"></a> -<span class="sourceLineNo">793</span> Map<TableName, List<RegionInfo>> tableToRegionsMap = snapshot.getTableToRegionMap();<a name="line.793"></a> -<span class="sourceLineNo">794</span> for (TableName table : tables) {<a name="line.794"></a> -<span class="sourceLineNo">795</span> float[] deltaLocality = new float[3];<a name="line.795"></a> -<span class="sourceLineNo">796</span> float[] locality = new float[3];<a name="line.796"></a> -<span class="sourceLineNo">797</span> if (!this.targetTableSet.isEmpty()<a name="line.797"></a> -<span class="sourceLineNo">798</span> && !this.targetTableSet.contains(table)) {<a name="line.798"></a> -<span class="sourceLineNo">799</span> continue;<a name="line.799"></a> -<span class="sourceLineNo">800</span> }<a name="line.800"></a> -<span class="sourceLineNo">801</span> List<RegionInfo> regions = tableToRegionsMap.get(table);<a name="line.801"></a> -<span class="sourceLineNo">802</span> System.out.println("==================================================");<a name="line.802"></a> -<span class="sourceLineNo">803</span> System.out.println("Assignment Plan Projection Report For Table: " + table);<a name="line.803"></a> -<span class="sourceLineNo">804</span> System.out.println("\t Total regions: " + regions.size());<a name="line.804"></a> -<span class="sourceLineNo">805</span> System.out.println("\t" + movesPerTable.get(table)<a name="line.805"></a> -<span class="sourceLineNo">806</span> + " primaries will move due to their primary has changed");<a name="line.806"></a> -<span class="sourceLineNo">807</span> for (RegionInfo currentRegion : regions) {<a name="line.807"></a> -<span class="sourceLineNo">808</span> Map<String, Float> regionLocality = regionLocalityMap.get(currentRegion<a name="line.808"></a> -<span class="sourceLineNo">809</span> .getEncodedName());<a name="line.809"></a> -<span class="sourceLineNo">810</span> if (regionLocality == null) {<a name="line.810"></a> -<span class="sourceLineNo">811</span> continue;<a name="line.811"></a> -<span class="sourceLineNo">812</span> }<a name="line.812"></a> -<span class="sourceLineNo">813</span> List<ServerName> oldServers = oldPlan.getFavoredNodes(currentRegion);<a name="line.813"></a> -<span class="sourceLineNo">814</span> List<ServerName> newServers = newPlan.getFavoredNodes(currentRegion);<a name="line.814"></a> -<span class="sourceLineNo">815</span> if (newServers != null && oldServers != null) {<a name="line.815"></a> -<span class="sourceLineNo">816</span> int i=0;<a name="line.816"></a> -<span class="sourceLineNo">817</span> for (FavoredNodesPlan.Position p : FavoredNodesPlan.Position.values()) {<a name="line.817"></a> -<span class="sourceLineNo">818</span> ServerName newServer = newServers.get(p.ordinal());<a name="line.818"></a> -<span class="sourceLineNo">819</span> ServerName oldServer = oldServers.get(p.ordinal());<a name="line.819"></a> -<span class="sourceLineNo">820</span> Float oldLocality = 0f;<a name="line.820"></a> -<span class="sourceLineNo">821</span> if (oldServers != null) {<a name="line.821"></a> -<span class="sourceLineNo">822</span> oldLocality = regionLocality.get(oldServer.getHostname());<a name="line.822"></a> -<span class="sourceLineNo">823</span> if (oldLocality == null) {<a name="line.823"></a> -<span class="sourceLineNo">824</span> oldLocality = 0f;<a name="line.824"></a> -<span class="sourceLineNo">825</span> }<a name="line.825"></a> -<span class="sourceLineNo">826</span> locality[i] += oldLocality;<a name="line.826"></a> -<span class="sourceLineNo">827</span> }<a name="line.827"></a> -<span class="sourceLineNo">828</span> Float newLocality = regionLocality.get(newServer.getHostname());<a name="line.828"></a> -<span class="sourceLineNo">829</span> if (newLocality == null) {<a name="line.829"></a> -<span class="sourceLineNo">830</span> newLocality = 0f;<a name="line.830"></a> -<span class="sourceLineNo">831</span> }<a name="line.831"></a> -<span class="sourceLineNo">832</span> deltaLocality[i] += newLocality - oldLocality;<a name="line.832"></a> -<span class="sourceLineNo">833</span> i++;<a name="line.833"></a> -<span class="sourceLineNo">834</span> }<a name="line.834"></a> -<span class="sourceLineNo">835</span> }<a name="line.835"></a> -<span class="sourceLineNo">836</span> }<a name="line.836"></a> -<span class="sourceLineNo">837</span> DecimalFormat df = new java.text.DecimalFormat( "#.##");<a name="line.837"></a> -<span class="sourceLineNo">838</span> for (int i = 0; i < deltaLocality.length; i++) {<a name="line.838"></a> -<span class="sourceLineNo">839</span> System.out.print("\t\t Baseline locality for ");<a name="line.839"></a> -<span class="sourceLineNo">840</span> if (i == 0) {<a name="line.840"></a> -<span class="sourceLineNo">841</span> System.out.print("primary ");<a name="line.841"></a> -<span class="sourceLineNo">842</span> } else if (i == 1) {<a name="line.842"></a> -<span class="sourceLineNo">843</span> System.out.print("secondary ");<a name="line.843"></a> -<span class="sourceLineNo">844</span> } else if (i == 2) {<a name="line.844"></a> -<span class="sourceLineNo">845</span> System.out.print("tertiary ");<a name="line.845"></a> -<span class="sourceLineNo">846</span> }<a name="line.846"></a> -<span class="sourceLineNo">847</span> System.out.println(df.format(100 * locality[i] / regions.size()) + "%");<a name="line.847"></a> -<span class="sourceLineNo">848</span> System.out.print("\t\t Locality will change with the new plan: ");<a name="line.848"></a> -<span class="sourceLineNo">849</span> System.out.println(df.format(100 * deltaLocality[i] / regions.size())<a name="line.849"></a> -<span class="sourceLineNo">850</span> + "%");<a name="line.850"></a> -<span class="sourceLineNo">851</span> }<a name="line.851"></a> -<span class="sourceLineNo">852</span> System.out.println("\t Baseline dispersion");<a name="line.852"></a> -<span class="sourceLineNo">853</span> printDispersionScores(table, snapshot, regions.size(), null, true);<a name="line.853"></a> -<span class="sourceLineNo">854</span> System.out.println("\t Projected dispersion");<a name="line.854"></a> -<span class="sourceLineNo">855</span> printDispersionScores(table, snapshot, regions.size(), newPlan, true);<a name="line.855"></a> -<span class="sourceLineNo">856</span> }<a name="line.856"></a> -<span class="sourceLineNo">857</span> }<a name="line.857"></a> -<span class="sourceLineNo">858</span><a name="line.858"></a> -<span class="sourceLineNo">859</span> public void printDispersionScores(TableName table,<a name="line.859"></a> -<span class="sourceLineNo">860</span> SnapshotOfRegionAssignmentFromMeta snapshot, int numRegions, FavoredNodesPlan newPlan,<a name="line.860"></a> -<span class="sourceLineNo">861</span> boolean simplePrint) {<a name="line.861"></a> -<span class="sourceLineNo">862</span> if (!this.targetTableSet.isEmpty() && !this.targetTableSet.contains(table)) {<a name="line.862"></a> -<span class="sourceLineNo">863</span> return;<a name="line.863"></a> -<span class="sourceLineNo">864</span> }<a name="line.864"></a> -<span class="sourceLineNo">865</span> AssignmentVerificationReport report = new AssignmentVerificationReport();<a name="line.865"></a> -<span class="sourceLineNo">866</span> report.fillUpDispersion(table, snapshot, newPlan);<a name="line.866"></a> -<span class="sourceLineNo">867</span> List<Float> dispersion = report.getDispersionInformation();<a name="line.867"></a> -<span class="sourceLineNo">868</span> if (simplePrint) {<a name="line.868"></a> -<span class="sourceLineNo">869</span> DecimalFormat df = new java.text.DecimalFormat("#.##");<a name="line.869"></a> -<span class="sourceLineNo">870</span> System.out.println("\tAvg dispersion score: "<a name="line.870"></a> -<span class="sourceLineNo">871</span> + df.format(dispersion.get(0)) + " hosts;\tMax dispersion score: "<a name="line.871"></a> -<span class="sourceLineNo">872</span> + df.format(dispersion.get(1)) + " hosts;\tMin dispersion score: "<a name="line.872"></a> -<span class="sourceLineNo">873</span> + df.format(dispersion.get(2)) + " hosts;");<a name="line.873"></a> -<span class="sourceLineNo">874</span> } else {<a name="line.874"></a> -<span class="sourceLineNo">875</span> LOG.info("For Table: " + table + " ; #Total Regions: " + numRegions<a name="line.875"></a> -<span class="sourceLineNo">876</span> + " ; The average dispersion score is " + dispersion.get(0));<a name="line.876"></a> -<span class="sourceLineNo">877</span> }<a name="line.877"></a> -<span class="sourceLineNo">878</span> }<a name="line.878"></a> -<span class
<TRUNCATED>
