多线程之Condition与BlockQueue介绍与用法

本文深入探讨了线程同步机制Condition的使用,包括阻塞与唤醒操作,并详细解析了阻塞队列(BlockQueue)在生产者消费者模型中的应用。通过具体代码示例,展示了如何利用Condition实现线程间的有效通讯,以及如何运用阻塞队列优化多线程环境下的数据处理流程。

摘要生成于 C知道 ,由 DeepSeek-R1 满血版支持, 前往体验 >

一、Condition

              功能介绍:线程间通讯的另一种方式,他的功能和Lock几乎一样

             案例说明:下面案例中Condition通过await进行阻塞,然后用single进行唤醒

package com.gpdi.security.condition;

import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;

public class ConditionAwait implements Runnable {
    private Lock lock;
    private Condition condition;
    public ConditionAwait(Lock lock, Condition condition) {
        this.lock = lock;
        this.condition = condition;
    }

    @Override
    public void run() {
        lock.lock();//获取锁
        try {
            System.out.println("begin Condition await");
            condition.await();//阻塞
            System.out.println("end Condition await");

        } catch (InterruptedException e) {
            e.printStackTrace();
        } finally {
            lock.unlock();//释放锁
        }
    }
}

package com.gpdi.security.condition;

import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;

public class ConditionSingle implements Runnable {
    private Lock lock;
    private Condition condition;

    public ConditionSingle(Lock lock, Condition condition) {
        this.lock = lock;
        this.condition = condition;
    }

    @Override
    public void run() {
        lock.lock();//获取锁
        try {
            System.out.println("begin Condition Single");
            condition.signal();//唤醒
            System.out.println("end Condition Single");

        } finally {
            lock.unlock();//释放锁
        }
    }
}

package com.gpdi.security.condition;

import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;

public class ConditionTest {
    public static void main(String[] args) {
        Lock lock=new ReentrantLock();
        Condition condition=lock.newCondition();
        new Thread(new ConditionAwait(lock,condition),"thread0").start();
        new Thread(new ConditionSingle(lock,condition),"thread0").start();
    }
}

二、BlockQueue

           功能介绍:阻塞队列(主要用于生产者消费者模型)

          案例使用:

                

package com.gpdi.security;




import java.util.concurrent.ArrayBlockingQueue;

/**
 * description:生产者消费者模式
 *
 */

public class ArraysBlockQueueDemo {
    ArrayBlockingQueue<String> ab = new ArrayBlockingQueue<>(10);

    {
        init();
    }

    public void init() {
        new Thread(() -> {
            while (true) {
                try {
                    String data = ab.take();
                    System.out.println("receive data" + data);

                } catch (InterruptedException e) {
                    e.printStackTrace();
                }
            }
        }, "thread1").start();
    }

    public void addData(String data) {
        System.out.println("send data" + data);
        ab.add(data);
        try {
            Thread.sleep(1000);

        } catch (InterruptedException e) {
            e.printStackTrace();
        }

    }

    public static void main(String[] args) {
        ArraysBlockQueueDemo arraysBlockQueue = new ArraysBlockQueueDemo();
        for (int i = 0; i < 100; i++) {
            arraysBlockQueue.addData("data" + i);
        }
    }
}

 

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值