c7b6aab5c4343d0a8a800fedb59b0c44f5d188b0.svn-base 2.9 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485
  1. package com.xxl.job.admin.core.route.strategy;
  2. import com.xxl.job.admin.core.route.ExecutorRouter;
  3. import com.xxl.job.core.biz.model.ReturnT;
  4. import com.xxl.job.core.biz.model.TriggerParam;
  5. import java.io.UnsupportedEncodingException;
  6. import java.security.MessageDigest;
  7. import java.security.NoSuchAlgorithmException;
  8. import java.util.List;
  9. import java.util.SortedMap;
  10. import java.util.TreeMap;
  11. /**
  12. * 分组下机器地址相同,不同JOB均匀散列在不同机器上,保证分组下机器分配JOB平均;且每个JOB固定调度其中一台机器;
  13. * a、virtual node:解决不均衡问题
  14. * b、hash method replace hashCode:String的hashCode可能重复,需要进一步扩大hashCode的取值范围
  15. * Created by xuxueli on 17/3/10.
  16. */
  17. public class ExecutorRouteConsistentHash extends ExecutorRouter {
  18. private static int VIRTUAL_NODE_NUM = 100;
  19. /**
  20. * get hash code on 2^32 ring (md5散列的方式计算hash值)
  21. * @param key
  22. * @return
  23. */
  24. private static long hash(String key) {
  25. // md5 byte
  26. MessageDigest md5;
  27. try {
  28. md5 = MessageDigest.getInstance("MD5");
  29. } catch (NoSuchAlgorithmException e) {
  30. throw new RuntimeException("MD5 not supported", e);
  31. }
  32. md5.reset();
  33. byte[] keyBytes = null;
  34. try {
  35. keyBytes = key.getBytes("UTF-8");
  36. } catch (UnsupportedEncodingException e) {
  37. throw new RuntimeException("Unknown string :" + key, e);
  38. }
  39. md5.update(keyBytes);
  40. byte[] digest = md5.digest();
  41. // hash code, Truncate to 32-bits
  42. long hashCode = ((long) (digest[3] & 0xFF) << 24)
  43. | ((long) (digest[2] & 0xFF) << 16)
  44. | ((long) (digest[1] & 0xFF) << 8)
  45. | (digest[0] & 0xFF);
  46. long truncateHashCode = hashCode & 0xffffffffL;
  47. return truncateHashCode;
  48. }
  49. public String hashJob(int jobId, List<String> addressList) {
  50. // ------A1------A2-------A3------
  51. // -----------J1------------------
  52. TreeMap<Long, String> addressRing = new TreeMap<Long, String>();
  53. for (String address: addressList) {
  54. for (int i = 0; i < VIRTUAL_NODE_NUM; i++) {
  55. long addressHash = hash("SHARD-" + address + "-NODE-" + i);
  56. addressRing.put(addressHash, address);
  57. }
  58. }
  59. long jobHash = hash(String.valueOf(jobId));
  60. SortedMap<Long, String> lastRing = addressRing.tailMap(jobHash);
  61. if (!lastRing.isEmpty()) {
  62. return lastRing.get(lastRing.firstKey());
  63. }
  64. return addressRing.firstEntry().getValue();
  65. }
  66. @Override
  67. public ReturnT<String> route(TriggerParam triggerParam, List<String> addressList) {
  68. String address = hashJob(triggerParam.getJobId(), addressList);
  69. return new ReturnT<String>(address);
  70. }
  71. }