f750bd19f0b1e3e7ab92f85af7d2b60652a8a382.svn-base 3.0 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879
  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.util.*;
  6. import java.util.concurrent.ConcurrentHashMap;
  7. import java.util.concurrent.ConcurrentMap;
  8. /**
  9. * 单个JOB对应的每个执行器,使用频率最低的优先被选举
  10. * a(*)、LFU(Least Frequently Used):最不经常使用,频率/次数
  11. * b、LRU(Least Recently Used):最近最久未使用,时间
  12. *
  13. * Created by xuxueli on 17/3/10.
  14. */
  15. public class ExecutorRouteLFU extends ExecutorRouter {
  16. private static ConcurrentMap<Integer, HashMap<String, Integer>> jobLfuMap = new ConcurrentHashMap<Integer, HashMap<String, Integer>>();
  17. private static long CACHE_VALID_TIME = 0;
  18. public String route(int jobId, List<String> addressList) {
  19. // cache clear
  20. if (System.currentTimeMillis() > CACHE_VALID_TIME) {
  21. jobLfuMap.clear();
  22. CACHE_VALID_TIME = System.currentTimeMillis() + 1000*60*60*24;
  23. }
  24. // lfu item init
  25. HashMap<String, Integer> lfuItemMap = jobLfuMap.get(jobId); // Key排序可以用TreeMap+构造入参Compare;Value排序暂时只能通过ArrayList;
  26. if (lfuItemMap == null) {
  27. lfuItemMap = new HashMap<String, Integer>();
  28. jobLfuMap.putIfAbsent(jobId, lfuItemMap); // 避免重复覆盖
  29. }
  30. // put new
  31. for (String address: addressList) {
  32. if (!lfuItemMap.containsKey(address) || lfuItemMap.get(address) >1000000 ) {
  33. lfuItemMap.put(address, new Random().nextInt(addressList.size())); // 初始化时主动Random一次,缓解首次压力
  34. }
  35. }
  36. // remove old
  37. List<String> delKeys = new ArrayList<>();
  38. for (String existKey: lfuItemMap.keySet()) {
  39. if (!addressList.contains(existKey)) {
  40. delKeys.add(existKey);
  41. }
  42. }
  43. if (delKeys.size() > 0) {
  44. for (String delKey: delKeys) {
  45. lfuItemMap.remove(delKey);
  46. }
  47. }
  48. // load least userd count address
  49. List<Map.Entry<String, Integer>> lfuItemList = new ArrayList<Map.Entry<String, Integer>>(lfuItemMap.entrySet());
  50. Collections.sort(lfuItemList, new Comparator<Map.Entry<String, Integer>>() {
  51. @Override
  52. public int compare(Map.Entry<String, Integer> o1, Map.Entry<String, Integer> o2) {
  53. return o1.getValue().compareTo(o2.getValue());
  54. }
  55. });
  56. Map.Entry<String, Integer> addressItem = lfuItemList.get(0);
  57. String minAddress = addressItem.getKey();
  58. addressItem.setValue(addressItem.getValue() + 1);
  59. return addressItem.getKey();
  60. }
  61. @Override
  62. public ReturnT<String> route(TriggerParam triggerParam, List<String> addressList) {
  63. String address = route(triggerParam.getJobId(), addressList);
  64. return new ReturnT<String>(address);
  65. }
  66. }