并发编程:
并发(多线程操作同一个资源)、并行(多个线程同时进行)
并发编程的本质:
充分利用CPU资源
线程有几个状态:
NEW新生、RUNNABLE运行、BLOCKED阻塞、WAITING等待、TIMED_WAITING超时等待、TERMINATED终止
wait和sleep的区别:
1.来自不同的类(sleep——>Thread,wait——>Object)
2.关于锁的释放,sleep休眠了不释放锁,wait释放锁
3.wait必须在同步代码块中,sleep可以在任何地方
4.wait不需要捕获异常,sleep需要捕获异常
公平锁:十分公平,可以先来后到;
非公平锁:十分不公平,可以插队(默认)
synchronized和Lock区别:
1.synchronized是内置的java关键字,Lock是一个java类
2.synchronized无法判断获取锁的状态,Lock可以判断是否获取锁的状态
3.synchronized会自动释放锁,Lock不会自动释放锁,如果不释放则死锁
4.synchronized线程1(获得锁,阻塞),线程2(等待);Lock锁不一样会等待下去
5.synchronized适合锁少量代码同步问题,Lock适合锁大量代码同步问题
线程安全问题:虚假唤醒(if改成while判断解决)
生产者和消费者问题:
synchronized锁和lock锁使用:
public class Test02 {
public static void main(String[] args) {
Data2 data = new Data2();
new Thread(()->{
for (int i = 0; i < 20; i++) {
try {
data.increment();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
},"A").start();
new Thread(()->{
for (int i = 0; i < 20; i++) {
try {
data.decrement();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
},"B").start();
new Thread(()->{
for (int i = 0; i < 20; i++) {
try {
data.increment();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
},"C").start();
new Thread(()->{
for (int i = 0; i < 20; i++) {
try {
data.decrement();
} catch (InterruptedException e) {
e.printStackTrace();
}
}
},"D").start();
}
}
class Data2 {
private int number = 0;
//获取lock锁对象
Lock lock = new ReentrantLock();
//获取condition
Condition condition = lock.newCondition();
public void increment() throws InterruptedException {
lock.lock();
try {
while (number != 0) {
condition.await(); //线程等待
}
number++;
System.out.println(Thread.currentThread().getName()+"=>"+number);
condition.signalAll(); //唤醒所有线程
}finally {
lock.unlock();
}
}
public void decrement() throws InterruptedException {
lock.lock();
try {
while (number == 0) {
condition.await();
}
number--;
System.out.println(Thread.currentThread().getName()+"=>"+number);
condition.signalAll();
}finally {
lock.unlock();
}
}
}
精准唤醒通知:
class Data3 {
private int number = 1; //1A 2B 3C
//获取lock锁对象
Lock lock = new ReentrantLock();
//获取condition
Condition condition1 = lock.newCondition();
Condition condition2 = lock.newCondition();
Condition condition3 = lock.newCondition();
public void printA() throws InterruptedException {
lock.lock();
try {
while (number != 1) {
condition1.await();
}
System.out.println(Thread.currentThread().getName()+"=>" + "AAAAAAA");
//唤醒指定的人B
number = 2;
condition2.signal();
}finally {
lock.unlock();
}
}
public void printB() throws InterruptedException {
lock.lock();
try {
while (number != 2) {
condition2.await();
}
System.out.println(Thread.currentThread().getName()+"=>" + "BBBBBBB");
//唤醒指定的人C
number = 3;
condition3.signal();
}finally {
lock.unlock();
}
}
public void printC() throws InterruptedException {
lock.lock();
try {
while (number != 3) {
condition3.await();
}
System.out.println(Thread.currentThread().getName()+"=>" + "CCCCCCC");
//唤醒指定的人A
number = 1;
condition1.signal();
}finally {
lock.unlock();
}
}
}
8锁现象:
new class锁的是这个对象,不同对象使用不同的锁。
static class类模板锁的是类,使用的同一把锁。
一个对象中有多个 synchronized 方法,某个时刻内只要有一个线程去访问 synchronized 方法了就会被加锁,其他线程就会阻塞
加了一个普通方法后 ,两个对象,无关先后,一个有锁,一个没锁!情况会变化
换成静态同步方法,情况会变化! CLASS ,所有静态同步方法的锁唯一 , 对象实例class 本身
并发下使用ArrayList:
//把ArrayList转换成线程安全类
List<String> list = Collections.synchronizedList(new ArrayList<>());
//写入时复制
//在写入的时候避免覆盖,进行复制一份数组进行添加
//读写分离
List<String> list2 = new CopyOnWriteArrayList<>();
并发下使用HashSet:
Set<String> set = Collections.synchronizedSet(new HashSet<String>());
Set<String> set2 = new CopyOnWriteArraySet<>();
并发下使用HashMap:
Map<String,String> map = Collections.synchronizedMap(new HashMap<>());
Map<String,String> map1 = new ConcurrentHashMap<>();
Callable:
public class CallableTest {
public static void main(String[] args) throws ExecutionException, InterruptedException {
MyThread myThread = new MyThread();
FutureTask futureTask = new FutureTask(myThread);
new Thread(futureTask,"A").start();
Object o = futureTask.get();
System.out.println(o.toString());
}
}
class MyThread implements Callable<Integer> {
@Override
public Integer call() throws Exception {
System.out.println(Thread.currentThread().getName()+":call()");
return 1024;
}
}
常用的辅助类:
1.CountDownLatch加法计数器:
CountDownLatch countDownLatch = new CountDownLatch(6);
for (int i = 0; i < 6; i++) {
new Thread(()->{
System.out.println(Thread.currentThread().getName()+":go out");
countDownLatch.countDown(); //数量-1
}).start();
}
countDownLatch.await();//等待计数器归零,然后再向下执行
System.out.println("close door");
原理:每次有线程调用countDown(),数量-1,假设计数器变为0,则唤醒countDownLatch.await();
2.CyclicBarrier减法计数器:
CyclicBarrier cyclicBarrier = new CyclicBarrier(7, ()-> {
System.out.println("召唤神龙!");
});
for (int i = 1; i <= 7; i++) {
final int temp = i;
new Thread(()->{
System.out.println(Thread.currentThread().getName()+":收集第" + temp +"颗龙珠");
try {
cyclicBarrier.await(); //等待
} catch (InterruptedException e) {
e.printStackTrace();
} catch (BrokenBarrierException e) {
e.printStackTrace();
}
}).start();
}
原理:每个线程都得执行到等待点进行等待,直到所有线程都执行到等待点,才会继续往下执行
3.Semaphore信号量:
//线程数量:停车位 限流操作
Semaphore semaphore = new Semaphore(3);
for (int i = 0; i < 6; i++) {
new Thread(()->{
try {
semaphore.acquire();
System.out.println(Thread.currentThread().getName()+":获得车位");
TimeUnit.SECONDS.sleep(2);
System.out.println(Thread.currentThread().getName()+":离开车位");
} catch (InterruptedException e) {
e.printStackTrace();
}finally {
semaphore.release();//释放
}
}).start();
}
原理: semaphore.acquire(),获得,假设满了则等待,等待被释放为止
semaphore.release(),释放,为将当前的信号量释放+1,然后等待被唤醒的线程
作用:多个共享资源互斥的使用,并发限流,控制最大的线程数
ReadWriteLock 读写锁(独占锁(写锁)、共享锁(读锁)):
public static void main(String[] args) {
MyCache myCache = new MyCache();
for (int i = 0; i < 5; i++) {
final int temp = i;
new Thread(()->{
myCache.put(temp+"",temp+"");
},i+"").start();
}
for (int i = 0; i < 5; i++) {
final int temp = i;
new Thread(()->{
myCache.get(temp+"");
},i+"").start();
}
}
}
class MyCache {
private volatile Map<String,Object> map = new HashMap<>();
private ReadWriteLock readWriteLock = new ReentrantReadWriteLock();
public void put(String key, Object value) {
readWriteLock.writeLock().lock();
try {
System.out.println(Thread.currentThread().getName()+"写入" + key);
map.put(key,value);
System.out.println(Thread.currentThread().getName()+"写入成功");
}finally {
readWriteLock.writeLock().unlock();
}
}
public void get(String key) {
readWriteLock.readLock().lock();
try {
System.out.println(Thread.currentThread().getName()+"读取" + key);
Object o = map.get(key);
System.out.println(Thread.currentThread().getName()+"读取成功");
}finally {
readWriteLock.readLock().unlock();
}
}
}
ReadWriteLock维护着一对关联的locks,一个用于只读操作,一个用于写入;read lock可以由多个阅读线程同时进行,write lock是独家的。
阻塞队列BlockingQueue:
写入:如果队列满了,就必须阻塞等待
取出:如果队列是空的,必须阻塞等待生产
关系图:
四组API:
//声明队列,长度为3
ArrayBlockingQueue blockingQueue = new ArrayBlockingQueue(3);
方式 | 抛出异常 | 有返回值,不抛出异常 | 阻塞 等待 | 超时等待 |
---|---|---|---|---|
添加 | add | offer | put | offer(, ,) |
移除 | remove | poll | take | poll(, ,) |
检测队首元素 | element | peek | - | - |
同步队列SynchronousQueue:
SynchronousQueue不存储元素,put了一个元素,必须从
里面take出来,否则不能进行put进去值
线程池Executors:
程序的运行,本质:占用系统的资源!优化资源的使用=》池化技术
池化技术:事先准备好一些资源,有人要用,就来拿,用完之后还回去
线程池的好处:
1.降低资源的消耗
2.提高响应的速度
3.方便管理
线程复用,可以控制最大的并发数,管理线程
三大方法:
ExecutorService service = Executors.newCachedThreadPool(); //可伸缩的线程池
// ExecutorService service1 = Executors.newFixedThreadPool(5); //创建固定大小的线程池
// ExecutorService service2 = Executors.newSingleThreadExecutor(); //单个线程
try {
for (int i = 0; i < 10; i++) {
//使用线程池来创建线程
service.execute(()->{
System.out.println(Thread.currentThread().getName()+":ok");
});
}
}finally {
//线程使用完,程序结束,关闭线程池
service.shutdown();
}
七大参数:
//源码分析:
public static ExecutorService newCachedThreadPool() {
return new ThreadPoolExecutor(0, Integer.MAX_VALUE,
60L, TimeUnit.SECONDS,
new SynchronousQueue<Runnable>());
}
public static ExecutorService newFixedThreadPool(int nThreads) {
return new ThreadPoolExecutor(nThreads, nThreads,
0L, TimeUnit.MILLISECONDS,
new LinkedBlockingQueue<Runnable>());
}
public static ExecutorService newSingleThreadExecutor() {
return new FinalizableDelegatedExecutorService
(new ThreadPoolExecutor(1, 1,
0L, TimeUnit.MILLISECONDS,
new LinkedBlockingQueue<Runnable>()));
}
//实际调用的方法
public ThreadPoolExecutor(int corePoolSize, //核心线程池大小
int maximumPoolSize, //最大核心线程池大小
long keepAliveTime, //超时了没有人调用就会释放
TimeUnit unit, //时间单位
BlockingQueue<Runnable> workQueue,//阻塞队列
ThreadFactory threadFactory, //线程工厂:创建线程的,一般不用动
RejectedExecutionHandler handler //拒绝策略) {
if (corePoolSize < 0 ||
maximumPoolSize <= 0 ||
maximumPoolSize < corePoolSize ||
keepAliveTime < 0)
throw new IllegalArgumentException();
if (workQueue == null || threadFactory == null || handler == null)
throw new NullPointerException();
this.acc = System.getSecurityManager() == null ?
null :
AccessController.getContext();
this.corePoolSize = corePoolSize;
this.maximumPoolSize = maximumPoolSize;
this.workQueue = workQueue;
this.keepAliveTime = unit.toNanos(keepAliveTime);
this.threadFactory = threadFactory;
this.handler = handler;
}
四种拒绝策略:
线程池不允许使用Executors去创建,而是通过ThreadPoolExecutor的方式,
这是的处理方式能让开发者更加明确线程池的使用规则,避免资源耗尽的风险。
四大函数式接口:
只有一个方法的接口
@FunctionalInterface
public interface Runnable {
public abstract void run();
}
//超级多FunctionalInterface
//简化编程模型,在新版本的底层框架大量应用
//foreach(消费者类的函数式接口)
//函数式接口:有一个输入参数,有一个输出
Function<String,String> function = (str) -> {return str;};
System.out.println(function.apply("hello"));
//断定型接口:有一个输入参数,返回值只能是布尔值
Predicate<String> predicate = (str) -> {return str.isEmpty();};
System.out.println(predicate.test("asdasdad"));
//消费型接口:只有输入,没有返回值
Consumer<String> consumer = (str) -> {
System.out.println(str);
};
consumer.accept("ssss");
//供给型接口:没有参数,只有返回值
Supplier<String> supplier = () -> {
System.out.println("get()");
return "ssssd";
};
System.out.println(supplier.get());
Stream流计算:
//1.id为偶数 2.年龄大于23 3.名字转为大写 4.降序排列 5.输出一个用户
User u1 = new User(1,"a",21);
User u2 = new User(2,"b",22);
User u3 = new User(3,"c",23);
User u4 = new User(4,"d",24);
User u5 = new User(5,"e",25);
List<User> users = Arrays.asList(u1, u2, u3, u4, u5);
users.stream().filter(u->{return u.getId()%2==0;})
.filter(u->{return u.getAge()>23;})
.map(u-> {return u.getName().toUpperCase();})
.sorted((uu1,uu2)->{return uu2.compareTo(uu1);})
.limit(1)
.forEach(System.out::println);
ForkJoin:
ForkJoin在JDK1.7之后,并行执行任务,提高效率,把大任务拆分成小任务
//计算求和
public class ForkjoinDemo extends RecursiveTask<Long> {
private Long start;
private Long end;
private Long temp = 10000L; //临界值
public ForkjoinDemo(Long start, Long end) {
this.start = start;
this.end = end;
}
//计算方法
@Override
protected Long compute() {
if((end - start) < temp) {
Long sum = 0L;
for (Long i = sum; i < end; i++) {
sum += i;
}
return sum;
}else {
long middle = (end + start)/2;
ForkjoinDemo task1 = new ForkjoinDemo(start, middle);
task1.fork(); //拆分任务,把任务压入线程队列
ForkjoinDemo task2 = new ForkjoinDemo(middle+1, end);
task2.fork(); //拆分任务,把任务压入线程队列
return task1.join()+task2.join();
}
}
}
//测试调用
public static void main(String[] args) throws ExecutionException, InterruptedException {
long start = System.currentTimeMillis();
// ForkJoinPool forkJoinPool = new ForkJoinPool();
// ForkjoinDemo forkjoinDemo = new ForkjoinDemo(0L, 1000_0000L);
// ForkJoinTask<Long> submit = forkJoinPool.submit(forkjoinDemo);
// Long sum = submit.get();
//stream并行流
long sum = LongStream.rangeClosed(0L, 10_0000_9999L).parallel().reduce(0, Long::sum);
long end = System.currentTimeMillis();
System.out.println("forkjoin时间为:" +(end-start)/1000+"秒。结果为"+sum);
}
异步回调:
Future设计的初衷,将对将来的某个事件的结果进行建模
//有返回值的supplyAsync异步回调
CompletableFuture<Integer> completableFuture = CompletableFuture.supplyAsync(()->{
System.out.println(Thread.currentThread().getName()+"supplyAsync=Integer");
int a = 1/0;
return 1024;
});
System.out.println(completableFuture.whenComplete((t,u)->{
System.out.println("t="+t); //正确的返回信息
System.out.println("u="+u); //错误的返回信息,没有错误返回null
}).exceptionally(e->{
System.out.println(e.getMessage());
return 500;
}).get());
JMM:
Volatile关键字:
Volatile是java虚拟机提供的轻量级的同步机制
1、保证可见性
//不加volatile会死循环
//加了volatile可以保证可见性
private volatile static int num = 0;
public static void main(String[] args) {
new Thread(()->{
while (num == 0) {
}
}).start();
try {
TimeUnit.SECONDS.sleep(1);
} catch (InterruptedException e) {
e.printStackTrace();
}
num = 1;
System.out.println(num);
}
2、不保证原子性
原子性:不可分割
线程A在执行任务的时候,不能被打扰的,也不能被分割,
要么同时成功,要么同时失败
3、禁止指令重排
(禁止指令重排原理:内存屏障、CPU指令,作用:
1.保证特定的操作的执行顺序
2.可以保证某些变量的内存可见性(利用这些特征volatile实现了可见性))
指令重排:你写的程序,计算机并不是按照你写的那样去执行的。
源代码->编译器优化的重排->指令并行也可能会重排->内存系统也会重排->执行
处理器在执行指令重排的时候,会考虑数据之间的依赖性
JMM:java内存模型,不存在的东西,概念,约定。
关于JMM的一些同步的约定:
1.线程解锁前,必须要把共享变量立刻刷回主存
2.线程加锁前,必须读取主存中的最新值到工作内存中
3.加锁和解锁是同一把锁
CAS:
比较当前工作内存中的值和主内存中的值,如果这个值是期望的,则执行操作,如果不是那就一直循环(自旋锁)!
缺点:
1、循环会超时
2、一次性只能保证一个共享变量的原子性
3、ABA问题
AtomicInteger atomicInteger = new AtomicInteger(2020);
//期望,更新
//如果我期望的值达到了,那么久更新;否则就不更新,CAS是CPU的并发源语
System.out.println(atomicInteger.compareAndSet(2020,2021));
System.out.println(atomicInteger.get());
System.out.println(atomicInteger.compareAndSet(2020,2021));
System.out.println(atomicInteger.get());
ABA问题(狸猫换太子)
原子引用:
//注意:如果泛型是一个包装类,注意对象的引用问题
//正常在业务操作,这里面比较的是对象
static AtomicStampedReference<Integer> atomicStampedReference = new AtomicStampedReference<>(1,1);
//compareAndSet比较并交换
public static void main(String[] args) {
new Thread(()->{
int stamp = atomicStampedReference.getStamp(); //获得版本号
System.out.println("a1="+stamp);
try {
TimeUnit.SECONDS.sleep(1);
} catch (InterruptedException e) {
e.printStackTrace();
}
System.out.println(atomicStampedReference.compareAndSet(1,2,
atomicStampedReference.getStamp(),atomicStampedReference.getStamp()+1));
System.out.println("a2="+atomicStampedReference.getStamp());
System.out.println(atomicStampedReference.compareAndSet(2,1,
atomicStampedReference.getStamp(),atomicStampedReference.getStamp()+1));
System.out.println("a3="+atomicStampedReference.getStamp());
},"a").start();
//和乐观锁的原理相同
new Thread(()->{
int stamp = atomicStampedReference.getStamp();
System.out.println("b1="+stamp);
try {
TimeUnit.SECONDS.sleep(2);
} catch (InterruptedException e) {
e.printStackTrace();
}
System.out.println(atomicStampedReference.compareAndSet(1,8,
stamp,stamp+1));
System.out.println("b2="+atomicStampedReference.getStamp());
},"b").start();
}
锁
1.公平锁:非常公平,不能够插队,必须先来后到
非公平锁:非常不公平,可以插队(默认都是非公平锁)
//源码:默认都是非公平锁
public ReentrantLock() {
sync = new NonfairSync();
}
//源码:通过有参构造设置
public ReentrantLock(boolean fair) {
sync = fair ? new FairSync() : new NonfairSync();
}
2.可重入锁(递归锁)
拿到了外面的锁就可以拿到里面的锁,自动获得
//synchronized同理
public class LockDemo {
public static void main(String[] args) {
Phone phone = new Phone();
new Thread(()->{
phone.sms();
},"a").start();
new Thread(()->{
phone.sms();
},"b").start();
}
}
class Phone {
Lock lock = new ReentrantLock();
public void sms() {
lock.lock();
try {
System.out.println(Thread.currentThread().getName()+"sms");
call(); //这里也有锁
}finally {
lock.unlock();
}
}
public void call() {
lock.lock();
lock.lock(); //细节问题:lock锁必须配对,否则就会死在里面
try {
System.out.println(Thread.currentThread().getName()+"call");
}finally {
lock.unlock();
lock.unlock();
}
}
}
自旋锁:
当一个线程在获取锁的时候,如果锁已经被其它线程获取,那么该线程将循环等待,然后不断的判断锁是否能够被成功获取,直到获取到锁才会退出循环。
public class SpinLock {
private AtomicReference cas = new AtomicReference();
public void lock() {
Thread current = Thread.currentThread();
// 利用CAS
while (!cas.compareAndSet(null, current)) {
}
}
public void unlock() {
Thread current = Thread.currentThread();
cas.compareAndSet(current, null);
}
}