线程同步--生产者消费者

当同时有很多生产者和消费者往仓库里面增加产品减少产品,会产生以下两个问题:

1当生产者和消费者同时改变仓库对象的属性,最后打印出的结果不能反映仓库的情况

2当生产者过多或者消费者过多会使仓库满或者空,如果不把线程从运行态变成就阻塞态的话,会出现异常

解决方式:

问题1:在改变对象的方法加入同步锁,该方法运行时将对象或者对象的属性锁定,当方法运行完才可以访问该对象或者对象的属性

问题2:在方法头部加入判断条件,如果仓库满或空,则调用wait()方法。线程将交出对象锁,并进入阻塞状态。而当其他的生产或者消费方法执行过后,仓库不满或不空则调用notifyall()方法,将线程池中阻塞的方法变成就绪态。

下面我利用三种方法实现了生产者和消费者

方法一:

线程同步synchronized+线程通信wait(),notify()

import java.util.LinkedList;
import java.util.List;

/**
 * Created by marsares on 15/7/7.
 */
public class ProducerAndCustomer1 {
    public static void main(String[]args){
        Storage storage=new Storage();
        Producer1 p1=new Producer1(storage,"p1",10);
        Producer1 p2=new Producer1(storage,"p2",10);
        Producer1 p3=new Producer1(storage,"p3",10);
        Producer1 p4=new Producer1(storage,"p4",10);
        Producer1 p5=new Producer1(storage,"p5",10);
        Customer1 c1=new Customer1(storage,"c1",10);
        Customer1 c2=new Customer1(storage,"c2",10);
        p1.start();
        p2.start();
        p3.start();
        p4.start();
        p5.start();
        c1.start();
        c2.start();
    }
}
class Storage{
    private static final int max=30;
    private int size=0;
    private int count=0;
    LinkedList<String>storage=new LinkedList<String>();
    public synchronized void add(int num){
        notifyAll();
        while(size+num>max){
            System.out.println(Thread.currentThread().getName()+"wait for customer");
            try{
                wait();
            }catch(InterruptedException e){
                throw new RuntimeException(e);
            }
        }
        for(int i=0;i<num;i++){
            storage.add("apple" + count);
            count++;
            size++;
        }
        System.out.println(Thread.currentThread().getName()+" add "+num+" products,"+" size="+size);
    }
    public synchronized void delete(int num){
        notifyAll();
        while(size-num<0){
            System.out.println(Thread.currentThread().getName()+"wait for producer");
            try{
                wait();
            }catch(InterruptedException e){
                throw new RuntimeException(e);
            }
        }
        for(int i=0;i<num;i++){
            storage.remove();
            size--;
        }
        System.out.println(Thread.currentThread().getName()+" delete "+num+" products,"+" size="+size);
    }
}
class Producer1 extends Thread{
    Storage storage;
    String name;
    int num;
    public Producer1(Storage storage,String name,int num){
        this.storage=storage;
        this.name=name;
        this.num=num;
    }
    public void produce(int num){
        storage.add(num);
    }
    public void run(){
        produce(num);
    }
}
class Customer1 extends Thread{
    Storage storage;
    String name;
    int num;
    public Customer1(Storage storage,String name,int num){
        this.storage=storage;
        this.name=name;
        this.num=num;
    }
    public void consume(int num){
        storage.delete(num);
    }
    public void run(){
        consume(num);
    }
}

方法二:

使用lock

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

/**
 * Created by marsares on 15/7/7.
 */
public class ProducerAndCustomer2 {
    public static void main(String[]args){
        Storage2 storage=new Storage2();
        Producer2 p1=new Producer2(storage,"p1",10);
        Producer2 p2=new Producer2(storage,"p2",10);
        Producer2 p3=new Producer2(storage,"p3",10);
        Producer2 p4=new Producer2(storage,"p4",10);
        Producer2 p5=new Producer2(storage,"p5",10);
        Customer2 c1=new Customer2(storage,"c1",10);
        Customer2 c2=new Customer2(storage,"c2",10);
        p1.start();
        p2.start();
        p3.start();
        p4.start();
        p5.start();
        c1.start();
        c2.start();
    }
}
class Storage2{
    private static final int max=30;
    private int size=0;
    private int count=0;
    LinkedList<String> storage=new LinkedList<String>();
    private final Lock lock=new ReentrantLock();
    private final Condition full=lock.newCondition();
    private final Condition empty=lock.newCondition();
    public void add(int num){
        lock.lock();
        while(size+num>max){
            System.out.println(Thread.currentThread().getName()+"wait for customer");
            try{
                full.await();
            }catch(InterruptedException e){
                throw new RuntimeException(e);
            }
        }
        for(int i=0;i<num;i++){
            storage.add("apple" + count);
            count++;
            size++;
        }
        System.out.println(Thread.currentThread().getName()+" add "+num+" products,"+" size="+size);
        empty.signalAll();
        lock.unlock();
    }
    public void delete(int num){
        lock.lock();
        while(size-num<0){
            System.out.println(Thread.currentThread().getName()+"wait for producer");
            try{
                wait();
            }catch(InterruptedException e){
                throw new RuntimeException(e);
            }
        }
        for(int i=0;i<num;i++){
            storage.remove();
            size--;
        }
        System.out.println(Thread.currentThread().getName()+" delete "+num+" products,"+" size="+size);
        full.signalAll();
        lock.unlock();
    }
}
class Producer2 extends Thread{
    Storage2 storage;
    String name;
    int num;
    public Producer2(Storage2 storage,String name,int num){
        this.storage=storage;
        this.name=name;
        this.num=num;
    }
    public void produce(int num){
        storage.add(num);
    }
    public void run(){
        produce(num);
    }
}
class Customer2 extends Thread{
    Storage2 storage;
    String name;
    int num;
    public Customer2(Storage2 storage,String name,int num){
        this.storage=storage;
        this.name=name;
        this.num=num;
    }
    public void consume(int num){
        storage.delete(num);
    }
    public void run(){
        consume(num);
    }
}
方法三:

使用LinkedBlockingQueue

import java.util.concurrent.LinkedBlockingQueue;

/**
 * Created by marsares on 15/7/7.
 */
public class ProducerAndCustomer3 {
    public static void main(String[]args){
        Storage3 storage=new Storage3();
        Producer3 p1=new Producer3(storage,"p1",10);
        Producer3 p2=new Producer3(storage,"p2",10);
        Producer3 p3=new Producer3(storage,"p3",10);
        Producer3 p4=new Producer3(storage,"p4",10);
        Producer3 p5=new Producer3(storage,"p5",10);
        Customer3 c1=new Customer3(storage,"c1",10);
        Customer3 c2=new Customer3(storage,"c2",10);
        p1.start();
        p2.start();
        p3.start();
        p4.start();
        p5.start();
        c1.start();
        c2.start();
    }
}
class Storage3{
    private static final int max=30;
    private int size=0;
    private int count=0;
    LinkedBlockingQueue<String> storage=new LinkedBlockingQueue<String>(max);
    public void add(int num){
        for(int i=0;i<num;i++){
            try{
                storage.put("apple" + count);
                count++;
                size++;
            }catch(InterruptedException e){
                throw new RuntimeException(e);
            }
        }
        System.out.println(Thread.currentThread().getName() + " add " + num + " products," + " size=" + size);
    }
    public void delete(int num){
        for(int i=0;i<num;i++){
            try{
                storage.take();
                size--;
            }catch(InterruptedException e){
                throw new RuntimeException(e);
            }
        }
        System.out.println(Thread.currentThread().getName() + " delete " + num + " products," + " size=" + size);
    }
}
class Producer3 extends Thread{
    Storage3 storage;
    String name;
    int num;
    public Producer3(Storage3 storage,String name,int num){
        this.storage=storage;
        this.name=name;
        this.num=num;
    }
    public void produce(int num){
        storage.add(num);
    }
    public void run(){
        produce(num);
    }
}
class Customer3 extends Thread{
    Storage3 storage;
    String name;
    int num;
    public Customer3(Storage3 storage,String name,int num){
        this.storage=storage;
        this.name=name;
        this.num=num;
    }
    public void consume(int num){
        storage.delete(num);
    }
    public void run(){
        consume(num);
    }
}


【最优潮流】直流最优潮流(OPF)课设(Matlab代码实现)内容概要:本文档主要围绕“直流最优潮流(OPF)课设”的Matlab代码实现展开,属于电力系统优化领域的教学与科研实践内容。文档介绍了通过Matlab进行电力系统最优潮流计算的基本原理与编程实现方法,重点聚焦于直流最优潮流模型的构建与求解过程,适用于课程设计或科研入门实践。文中提及使用YALMIP等优化工具包进行建模,并提供了相关资源下载链接,便于读者复现与学习。此外,文档还列举了大量与电力系统、智能优化算法、机器学习、路径规划等相关的Matlab仿真案例,体现出其服务于科研仿真辅导的综合性平台性质。; 适合人群:电气工程、自动化、电力系统及相关专业的本科生、研究生,以及从事电力系统优化、智能算法应用研究的科研人员。; 使用场景及目标:①掌握直流最优潮流的基本原理与Matlab实现方法;②完成课程设计或科研项目中的电力系统优化任务;③借助提供的丰富案例资源,拓展在智能优化、状态估计、微电网调度等方向的研究思路与技术手段。; 阅读建议:建议读者结合文档中提供的网盘资源,下载完整代码与工具包,边学习理论边动手实践。重点关注YALMIP工具的使用方法,并通过复现文中提到的多个案例,加深对电力系统优化问题建模与求解的理解。
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值