juc

4 篇文章 0 订阅

解决多线程安全问题的方式:

 * synchronzed

 * 1,同步代码块

 * 2,同步方法

 * 3,同步锁Lock

 *      lock()上锁,用unlock()释放锁

        1,volatitle

        2,虚假唤醒

        3,condition线程间通信

        4,CountDownLatch

            闭锁,只有其他所有线程的运算全部完成,但前运算才继续执行

        5,CopyOnWriteArrayList

写入并复制

            * 添加操作低时,效率低,支持并发操作,并发迭代操作多时可以选择

6,生产者消费者实例

/*package ProductAndCustomer;


 * 为了避免虚假唤醒,应该使用while循环
 
public class ProCus {
public static void main(String[] args) {
Clerk clerk=new Clerk();
Productor productor=new Productor(clerk);
Customer customer=new Customer(clerk);
new Thread(productor,"生产者A").start();
new Thread(customer,"消费者B").start();
new Thread(productor,"生产者C").start();
new Thread(customer,"消费者D").start();
}
}
class Clerk{
private int pro=0;
public synchronized void get() {
while(pro>=10) {
System.out.println("产品已满");
try {
this.wait();
} catch (InterruptedException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
System.out.println(Thread.currentThread().getName()+":"+ ++pro);
this.notifyAll();

}
public synchronized void sale() {
while(pro<=0) {

System.out.println("缺货");
try {
this.wait();
} catch (InterruptedException e) {
// TODO Auto-generated catch block
e.printStackTrace();
}
}
System.out.println(Thread.currentThread().getName()+":"+ --pro);
this.notifyAll();

}
}


class Productor implements Runnable{
private Clerk clerk;

public Productor(Clerk clerk) {
this.clerk=clerk;
}


@Override
public void run() {
// TODO Auto-generated method stub
for (int i = 0; i < 20; i++) {
clerk.get();
}
}


}
class Customer implements Runnable{
private Clerk clerk;

public Customer(Clerk clerk) {
this.clerk=clerk;
}


@Override
public void run() {
// TODO Auto-generated method stub
for (int i = 0; i < 20; i++) {
clerk.sale();
}
}


}
*/

7,ReadWriteLock

读写锁
 * 写写和读写 需要互斥
 * 读读不需要互斥

public class ReadWrite {
public static void main(String[] args) {
ReadWriteDemo rDemo=new ReadWriteDemo();
new Thread(new Runnable() {

@Override
public void run() {
// TODO Auto-generated method stub
rDemo.write((int)(Math.random()*101));
}
},"write").start();

for (int i = 0; i < 100; i++) {
new Thread(new Runnable() {

@Override
public void run() {
// TODO Auto-generated method stub
rDemo.read();
}
},"read").start();
}
}
}
class ReadWriteDemo{
private ReadWriteLock lock=new ReentrantReadWriteLock();

private int Number=0;

public void read() {
lock.readLock().lock();

try {
System.out.println(Thread.currentThread().getName()+":"+Number);
} finally {
// TODO: handle finally clause
lock.readLock().unlock();
}
}

public void write(int Number) {
lock.writeLock().lock();

try {
System.out.println(Thread.currentThread().getName());
this.Number=Number;
} finally {
// TODO: handle finally clause
lock.writeLock().unlock();
}
}
}


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

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值