Java语言synchronized与lock实现生产者消费者

synchronized方式

package test;

import java.util.LinkedList;
import java.util.Queue;
import java.util.Random;

public class ProducerConsumer {

    public static void main(String args[]) { 
        Queue<Integer> buffer = new LinkedList<>(); 
        int maxSize = 10; 
        ProducerConsumer producerConsumer = new ProducerConsumer();
        Thread producer = producerConsumer.new Producer(buffer, maxSize, "PRODUCER"); 
        Thread consumer = producerConsumer.new Consumer(buffer, maxSize, "CONSUMER"); 
        producer.start(); 
        consumer.start();  
    } 

    class Producer extends Thread{
        private Queue<Integer> queue;
        private int maxSize;
        public Producer(Queue<Integer> queue,int maxSize,String name) {
            super(name);
            this.queue = queue;
            this.maxSize = maxSize;
        }
        @Override
        public void run() {
            while(true) {
                synchronized (queue) {
                    while(queue.size() == maxSize) {
                        System.out.println("Queue is full");
                        try {
                            queue.wait();
                        } catch (InterruptedException e) {
                            e.printStackTrace();
                        }
                    }
                    Random random = new Random();
                    int i = random.nextInt();
                    System.out.println("Producing value : " + i); 
                    queue.add(i); 
                    queue.notifyAll();
                }
            }
        }


    }

    class Consumer extends Thread{
        private Queue<Integer> queue; 
        private int maxSize; 
        public Consumer(Queue<Integer> queue, int maxSize, String name){ 
            super(name); 
            this.queue = queue; 
            this.maxSize = maxSize; 
        } 
        @Override 
        public void run() { 
            while (true) { 
                synchronized (queue) { 
                    while (queue.isEmpty()) { 
                        System.out.println("Queue is empty"); 
                        try { 
                            queue.wait(); 
                        } catch (Exception ex) { 
                            ex.printStackTrace(); 
                        } 
                    } 
                    System.out.println("Consuming value : " + queue.remove()); 
                    queue.notifyAll(); 
                } 
            } 
        } 
    }
}

lock方式

package test;

import java.util.LinkedList;
import java.util.Queue;
import java.util.Random;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;

public class LockProducerConsumer {
    Lock lock = new ReentrantLock();
    Condition conditionP = lock.newCondition();
    Condition conditionC = lock.newCondition();
    public static void main(String args[]) { 
        Queue<Integer> buffer = new LinkedList<>(); 
        int maxSize = 10; 
        LockProducerConsumer producerConsumer = new LockProducerConsumer();
        Thread producer = producerConsumer.new Producer(buffer, maxSize, "PRODUCER"); 
        Thread consumer = producerConsumer.new Consumer(buffer, "CONSUMER"); 
        producer.start(); 
        consumer.start();  
    } 

    class Producer extends Thread{
        private Queue<Integer> queue;
        private int maxSize;
        public Producer(Queue<Integer> queue,int maxSize,String name) {
            super(name);
            this.queue = queue;
            this.maxSize = maxSize;
        }
        @Override
        public void run() {
            while(true) {
                lock.lock();
                try {
                    while (true) { 

                        while (queue.size() == maxSize) { 
                            System.out.println("Queue is full");
                            try {
                                conditionP.await();
                            } catch (InterruptedException e) {
                                e.printStackTrace();
                            }
                        } 
                        Random random = new Random();
                        int i = random.nextInt();
                        System.out.println("Producing value : " + i); 
                        queue.add(i);
                        conditionC.signal();


                    }
                }finally {
                    lock.unlock();
                }

            }
        }


    }

    class Consumer extends Thread{
        private Queue<Integer> queue; 
        public Consumer(Queue<Integer> queue, String name){ 
            super(name); 
            this.queue = queue;
        } 
        @Override 
        public void run() { 
            lock.lock();
            try {
                while (true) { 

                    while (queue.isEmpty()) { 
                        System.out.println("Queue is empty"); 
                        try {
                            conditionC.await();
                        } catch (InterruptedException e) {
                            e.printStackTrace();
                        }
                    } 
                    System.out.println("Consuming value : " + queue.remove()); 
                    conditionP.signal();

                } 
            }finally {
                lock.unlock();
            }

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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值