多线程-卖票案例--手写自旋锁--解决CAS版本号偷换问题

卖票

class TrainTicket
{
    private int number = 50;

    Object objectLock = new Object();

    public void sale()
    {
        synchronized (objectLock)
        {
            if(number>0)
            {
                System.out.println(Thread.currentThread().getName()+"\t"+"---卖出第: "+(number--));
            }
        }
    }
}

public class SaleTicketDemo
{
    public static void main(String[] args)
    {
        TrainTicket trainTicket = new TrainTicket();
        new Thread(() -> { for (int i = 1; i <=55 ; i++) trainTicket.sale(); },"t1").start();
        new Thread(() -> { for (int i = 1; i <=55 ; i++) trainTicket.sale(); },"t2").start();
        new Thread(() -> { for (int i = 1; i <=55 ; i++) trainTicket.sale(); },"t3").start();
        new Thread(() -> { for (int i = 1; i <=55 ; i++) trainTicket.sale(); },"t4").start();
    }
}

自旋锁

public class SpinLock {
    
    AtomicReference<Thread> atomicReference = new AtomicReference<>();

    public void myLock(){
        System.out.println(Thread.currentThread().getName()+"----come in");
        while(!atomicReference.compareAndSet(null,Thread.currentThread())){

        }
        System.out.println(Thread.currentThread().getName()+"----持有锁");
    }

    public void myUnLock(){
        atomicReference.compareAndSet(Thread.currentThread(),null);
        System.out.println(Thread.currentThread().getName()+"----释放锁");
    }

    public static void main(String[] args) {
        SpinLock spinLock =new SpinLock();

        new Thread(()->{
            spinLock.myLock();
            try { TimeUnit.SECONDS.sleep(5); } catch (InterruptedException e) { e.printStackTrace(); }
            spinLock.myUnLock();
            },"t1").start();

        new Thread(()->{
            spinLock.myLock();
            spinLock.myUnLock();
                },"t2").start();
    }
}

解决版本号ABA

public class ABA {


  static AtomicStampedReference<Integer> atomicStampedReference=  new AtomicStampedReference<>(100,1);

    public static void main(String[] args) {

        new Thread(()->{
            int stamp =atomicStampedReference.getStamp();
//   刚开始先让t1 t2两个线程都获得一样的个版本号
            try { TimeUnit.SECONDS.sleep(1); } catch (InterruptedException e) { e.printStackTrace(); }
            System.out.println(Thread.currentThread().getName()+"--默认版本号:"+stamp);
            atomicStampedReference.compareAndSet(100,101,stamp,stamp+1);
            System.out.println(Thread.currentThread().getName()+"--第一次cas版本号:"+atomicStampedReference.getStamp());
            atomicStampedReference.compareAndSet(101,100,stamp,stamp+1);
            System.out.println(Thread.currentThread().getName()+"--第2次cas版本号:"+atomicStampedReference.getStamp());
                },"t1").start();

        new Thread(()->{
            int stamp =atomicStampedReference.getStamp();
            System.out.println(Thread.currentThread().getName()+"--默认版本号:"+stamp);
  //延时, 让t1先完成ABA问题
            try { TimeUnit.SECONDS.sleep(4); } catch (InterruptedException e) { e.printStackTrace(); }
          boolean res =  atomicStampedReference.compareAndSet(100,2012,stamp,stamp+1);
            System.out.println(Thread.currentThread().getName()+"--成功交换否?"+res);
            },"t2").start();

    }
}
  • 0
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值