Java并发之FairSync和NonfairSync

Java并发中的fairSync和NonfairSync主要区别为:

如果当前线程不是锁的占有者,则NonfairSync并不判断是否有等待队列,直接使用compareAndSwap去进行锁的占用;

如果当前线程不是锁的占有者,则FairSync则会判断当前是否有等待队列,如果有则将自己加到等待队列尾;

 

对应的源码如下:

FairSync (注意FairSync和NonFairSync均继承自AbstractQueuedSynchronizer):

 

 

protected final boolean tryAcquire(int acquires) {
    final Thread current = Thread.currentThread();
    int c = getState();
    if (c == 0) {
//判断是否有等待队列,没有队列时,进行占用,如果占用失败,将自己加到等待队列尾
if(!hasQueuedPredecessors() &&
            compareAndSetState(0, acquires)) {
return true;  
        } 
            setExclusiveOwnerThread(current);
            compareAndSetState(0, acquires)) {
            setExclusiveOwnerThread(current);
            return true;
        }
            compareAndSetState(0, acquires)) {
            setExclusiveOwnerThread(current);
            return true;
        }
            compareAndSetState(0, acquires)) {
            setExclusiveOwnerThread(current);
            return true;
        }
    }
    else if (current == getExclusiveOwnerThread()) {
        int nextc = c + acquires;
        if (nextc < 0)
            throw new Error("Maximum lock count exceeded");
        setState(nextc);
        return true;
    }
    return false;
}

  

NonFairSync:

final boolean nonfairTryAcquire(int acquires) {
    final Thread current = Thread.currentThread();
    int c = getState();
    if (c == 0) {
        //不判断是否有等待队列,直接进行占用,如果占用失败也进到等待队列尾
        if (compareAndSetState(0, acquires)) {  
            setExclusiveOwnerThread(current);
            return true;
        }
    }
    else if (current == getExclusiveOwnerThread()) {
        int nextc = c + acquires;
        if (nextc < 0) // overflow
            throw new Error("Maximum lock count exceeded");
        setState(nextc);
        return true;
    }
    return false;
}

  

占用失败后,将自己加到等待队列尾的动作在AbstractQueuedSynchronizerder类acquire方法中:
public final void acquire(int arg) {
    if (!tryAcquire(arg) &&
        acquireQueued(addWaiter(Node.EXCLUSIVE), arg))
        selfInterrupt();
}

  



由于FairSync和NonFairSync均继承AbstractQueuedSynchronizerder(AQS),
这里使用了到了一个设计模式(模板模式)来设计NonFairSync和FairSync类

转载于:https://www.cnblogs.com/kisf/p/8432976.html

  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
Java并发编程是指在多个线程同时运行时,对共享资源的访问和修改进行协调和管理,以确保程序的正确性和性能。 下面是几个常见的Java并发场景和相应的实现代码: 1. 生产者-消费者模型 生产者-消费者模型是一种常见的并发场景,它涉及到一个或多个生产者线程向一个共享的缓冲区中生产数据,同时一个或多个消费者线程从缓冲区中消费数据。为了协调生产者和消费者线程之间的访问和修改,需要使用锁、条件变量等并发控制机制。 以下是一个简单的生产者-消费者模型的Java实现代码: ```java import java.util.LinkedList; import java.util.Queue; import java.util.Random; public class ProducerConsumerExample { public static void main(String[] args) { Queue<Integer> buffer = new LinkedList<>(); // 缓冲区 int maxSize = 10; // 缓冲区最大容量 Thread producerThread = new Thread(new Producer(buffer, maxSize), "Producer"); Thread consumerThread = new Thread(new Consumer(buffer), "Consumer"); producerThread.start(); consumerThread.start(); } static class Producer implements Runnable { private Queue<Integer> buffer; private int maxSize; public Producer(Queue<Integer> buffer, int maxSize) { this.buffer = buffer; this.maxSize = maxSize; } @Override public void run() { while (true) { synchronized (buffer) { while (buffer.size() == maxSize) { try { buffer.wait(); } catch (InterruptedException e) { e.printStackTrace(); } } Random random = new Random(); int number = random.nextInt(100); buffer.add(number); System.out.println("Produced " + number); buffer.notifyAll(); } } } } static class Consumer implements Runnable { private Queue<Integer> buffer; public Consumer(Queue<Integer> buffer) { this.buffer = buffer; } @Override public void run() { while (true) { synchronized (buffer) { while (buffer.isEmpty()) { try { buffer.wait(); } catch (InterruptedException e) { e.printStackTrace(); } } int number = buffer.poll(); System.out.println("Consumed " + number); buffer.notifyAll(); } } } } } ``` 2. 线程池 线程池是一种管理线程的机制,它通过在应用程序启动时创建一定数量的线程并将它们放入池中,然后在应用程序运行期间重复使用这些线程,以避免因频繁创建和销毁线程而导致的性能问题。Java中提供了Executor和ThreadPoolExecutor两个类来实现线程池。 以下是一个简单的线程池的Java实现代码: ```java import java.util.concurrent.ExecutorService; import java.util.concurrent.Executors; public class ThreadPoolExample { public static void main(String[] args) { ExecutorService executor = Executors.newFixedThreadPool(5); for (int i = 0; i < 10; i++) { Runnable worker = new WorkerThread("Task " + i); executor.execute(worker); } executor.shutdown(); while (!executor.isTerminated()) {} System.out.println("All tasks completed"); } static class WorkerThread implements Runnable { private String taskName; public WorkerThread(String taskName) { this.taskName = taskName; } @Override public void run() { System.out.println(Thread.currentThread().getName() + " " + taskName + " is running"); try { Thread.sleep(1000); } catch (InterruptedException e) { e.printStackTrace(); } System.out.println(Thread.currentThread().getName() + " " + taskName + " is completed"); } } } ``` 3. CountDownLatch CountDownLatch是一种同步工具,它允许一个或多个线程等待一组事件的完成。当CountDownLatch的计数器变为0时,等待线程可以继续执行。Java中提供了CountDownLatch类来实现这种同步机制。 以下是一个简单的CountDownLatch的Java实现代码: ```java import java.util.concurrent.CountDownLatch; public class CountDownLatchExample { public static void main(String[] args) throws InterruptedException { int n = 5; CountDownLatch startSignal = new CountDownLatch(1); CountDownLatch doneSignal = new CountDownLatch(n); for (int i = 0; i < n; i++) { new Thread(new Worker(startSignal, doneSignal)).start(); } System.out.println("Workers are waiting for the start signal"); Thread.sleep(1000); startSignal.countDown(); // 发送开始信号 System.out.println("Workers are started"); doneSignal.await(); // 等待所有任务完成 System.out.println("All tasks are completed"); } static class Worker implements Runnable { private final CountDownLatch startSignal; private final CountDownLatch doneSignal; public Worker(CountDownLatch startSignal, CountDownLatch doneSignal) { this.startSignal = startSignal; this.doneSignal = doneSignal; } @Override public void run() { try { startSignal.await(); // 等待开始信号 System.out.println(Thread.currentThread().getName() + " is working"); Thread.sleep(1000); } catch (InterruptedException e) { e.printStackTrace(); } finally { doneSignal.countDown(); // 发送完成信号 } } } } ```

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

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值