//CAS问题
//手写负载均衡算法,非IRULE方法
//请求的次数%服务集群数=服务器的下标
private AtomicInteger value=new AtomicInteger(0);
public final int getAndIncrement()
{
int current;
int next;
do {
current=this.value.get();
next=current>=Integer.MAX_VALUE?0:current+1;
}
while (!this.value.compareAndSet(current,next));//期望值,修改值 自旋锁一直比较
//current的值开始是0返回还是0 说明没有被其他线程修改,则current置为next的值 CAS
System.out.println(“next的值”+next);
return next;
}
@Override
public ServiceInstance instance(List serviceInstance) {
int index=getAndIncrement()%serviceInstance.size();
return serviceInstance.get(index);
}