【源码品读】负载均衡策略解析-1

@Override
public Server choose(Object key) {
	return choose(getLoadBalancer(), key);
}
protected int chooseRandomInt(int serverCount) {
	return ThreadLocalRandom.current().nextInt(serverCount);
}
/**
 * Randomly choose from all living servers
 */
@edu.umd.cs.findbugs.annotations.SuppressWarnings(value = "RCN_REDUNDANT_NULLCHECK_OF_NULL_VALUE")
public Server choose(ILoadBalancer lb, Object key) {
	if (lb == null) {
		return null;
	}
	Server server = null;

	while (server == null) {
		if (Thread.interrupted()) {
			return null;
		}
		List<Server> upList = lb.getReachableServers();
		List<Server> allList = lb.getAllServers();

		int serverCount = allList.size();
		if (serverCount == 0) {
			/*
			 * No servers. End regardless of pass, because subsequent passes
			 * only get more restrictive.
			 */
			return null;
		}

		int index = chooseRandomInt(serverCount);
		server = upList.get(index);

		if (server == null) {
			/*
			 * The only time this should happen is if the server list were
			 * somehow trimmed. This is a transient condition. Retry after
			 * yielding.
			 */
			Thread.yield();
			continue;
		}

		if (server.isAlive()) {
			return (server);
		}

		// Shouldn't actually happen.. but must be transient or a bug.
		server = null;
		Thread.yield();
	}

	return server;

}
public Server choose(ILoadBalancer lb, Object key) {
	if (lb == null) {
		log.warn("no load balancer");
		return null;
	}

	Server server = null;
	int count = 0;
	while (server == null && count++ < 10) {
		List<Server> reachableServers = lb.getReachableServers();
		List<Server> allServers = lb.getAllServers();
		int upCount = reachableServers.size();
		int serverCount = allServers.size();

		if ((upCount == 0) || (serverCount == 0)) {
			log.warn("No up servers available from load balancer: " + lb);
			return null;
		}

		int nextServerIndex = incrementAndGetModulo(serverCount);
		server = allServers.get(nextServerIndex);

		if (server == null) {
			/* Transient. */
			Thread.yield();
			continue;
		}

		if (server.isAlive() && (server.isReadyToServe())) {
			return (server);
		}

		// Next.
		server = null;
	}

	if (count >= 10) {
		log.warn("No available alive servers after 10 tries from load balancer: "
				+ lb);
	}
	return server;
}
/**
 * Inspired by the implementation of {@link AtomicInteger#incrementAndGet()}.
 *
 * @param modulo The modulo to bound the value of the counter.
 * @return The next value.
 */
private int incrementAndGetModulo(int modulo) {
	for (;;) {
		int current = nextServerCyclicCounter.get();
		int next = (current + 1) % modulo;
		if (nextServerCyclicCounter.compareAndSet(current, next))
			return next;
	}
}
private AtomicInteger nextServerCyclicCounter;
public final boolean compareAndSet(int expect, int update) {
	return unsafe.compareAndSwapInt(this, valueOffset, expect, update);
}
public final native boolean compareAndSwapInt(Object var1, long var2, int var4, int var5);
public RoundRobinRule() {
	nextServerCyclicCounter = new AtomicInteger(0);
}

 

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值