1.公平锁和非公平锁:
公平锁:是指多个线程按照申请锁的顺序来获取锁,类似排队打饭,先来后到。
非公平锁:是指多个线程获取锁的顺序并不是按照申请锁的顺序,有可能后申请的线程比先申请的线程优先获取锁在高并发的情况下,可能会造成优先级反转或者饥饿现象。
公平锁/非公平锁
并发包中ReentrantLock的创建可以指定构造函数的boolean类型来得到公平锁或非公平锁,默认是非公平锁。
两者区别:
公平锁,就是很公平,在并发环境中每个线程都在获取锁时会先查看此锁维护的等待队列,如果为空,或者当前线程是等待队列的第一个,就占有锁,否则就会加入到等待队列中,以后会按照FIFO的规则从对列中取到自己。
非公平锁:比较粗鲁,上来就直接尝试占有锁,如果尝试失败,就再采用类似公平锁那种方式。
2.可重入锁(又名递归锁)
2.1 是什么?
可重入锁(也叫递归锁)
指的是同一线程外层函数获得锁之后,内层递归函数仍然可以获取该锁的代码,在同一个线程在外层方法获取锁的时候,在进入内层方法会自动获取锁。****也就是说,线程可以进入任何一个它已经拥有的锁所同步着的代码块。****
2.2ReentrantLock/Synchronized就是一个经典的可重入锁。
2.3可重入锁最大的作用就是避免死锁。
2.4RennterLockDemo代码案例:
package com.lixiang.Interview.study.thread;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;
class Phone implements Runnable{
public synchronized void senSMS()throws Exception{
System.out.println(Thread.currentThread().getId()+"\t invoked sendSMS()");
senEmail();
}
private synchronized void senEmail() {
System.out.println(Thread.currentThread().getId()+"\t invoked senEmail()");
}
@Override
public void run() {
get();
}
Lock lock = new ReentrantLock();
public void get(){
lock.lock();
try {
System.out.println(Thread.currentThread().getName()+"\t get()");
set();
} finally {
lock.unlock();
}
}
public void set(){
lock.lock();
try {
System.out.println(Thread.currentThread().getName()+"\t set()");
} finally {
lock.unlock();
}
}
}
public class ReenterLockDemo {
public static void main(String[] args) throws Exception{
Phone phone = new Phone();
new Thread(() ->{
try {
phone.senSMS();
} catch (Exception e) {
e.printStackTrace();
}
},"t1").start();
new Thread(() ->{
try {
phone.senSMS();
} catch (Exception e) {
e.printStackTrace();
}
},"t2").start();
Thread.sleep(4000);
System.out.println("*****************************");
Thread t3 = new Thread(phone, "t3");
Thread t4 = new Thread(phone, "t4");
t3.start();
t4.start();
}
}
3.自旋锁(UnSafe类+CAS类):
自旋锁(soinlock):是指尝试获取锁的线程不会立即阻塞,而是采用循环的方式去尝试获取锁,这样的好处是减少线程上下文切换的消耗,缺点是循环会消耗CPU。
public class SpinLockDemo {
AtomicReference<Thread> atomicReference = new AtomicReference<>();
public void mylock(){
Thread thread = Thread.currentThread();//获得当前的线程
System.out.println(Thread.currentThread().getName()+"\t 当前线程上锁了");
while (!atomicReference.compareAndSet(null,thread)){
}
}
public void unlock(){
Thread thread = Thread.currentThread();//获得当前的线程
atomicReference.compareAndSet(thread,null);
System.out.println(Thread.currentThread().getName()+"\t 当前线程解锁了 ");
}
public static void main(String[] args) throws InterruptedException {
SpinLockDemo spinLockDemo = new SpinLockDemo();
new Thread(() ->{
spinLockDemo.mylock();
try {
Thread.sleep(500);
spinLockDemo.unlock();
} catch (InterruptedException e) {
e.printStackTrace();
}
},"AA").start();
Thread.sleep(200);
new Thread(() ->{
spinLockDemo.mylock();
spinLockDemo.unlock();
},"BB").start();
}
}
4.独占锁(写锁)、共享锁(读锁)/互斥锁:
独占锁:指该锁一次只能被一个线程所持有。对ReentranLock和Synchronized而言都是独占锁
共享锁:指该锁可被多个线程所持有。
对ReentrantReadWriteLock其读锁是共享锁,其写锁是独占锁。读锁的共享锁可保证并发读是非常有效的,读写,写读,写写的过程是互斥的。
class myCache{
private volatile Map map = new HashMap();
private ReentrantReadWriteLock lock = new ReentrantReadWriteLock();
public void put(String key,Object value) throws InterruptedException {
lock.writeLock().lock();
try {
System.out.println(Thread.currentThread().getName()+"\t 正在写入"+key);
Thread.sleep(300);
map.put(key,value);
System.out.println(Thread.currentThread().getName()+"\t 写入完成");
} finally {
lock.writeLock().unlock();
}
}
public void get(String key) throws InterruptedException {
lock.readLock().lock();
try {
System.out.println(Thread.currentThread().getName()+"\t 正在读取");
Thread.sleep(300);
Object resout = map.get(key);
System.out.println(Thread.currentThread().getName()+"\t 读取完成"+resout);
} finally {
lock.readLock().unlock();
}
}
}
public class ReadWriteLockDemo
{
public static void main(String[] args)
{
myCache demo = new myCache();
for (int i = 1; i <= 5; i++) {
final int temp = i;
new Thread(() ->{
try {
demo.put(temp+"",temp+"");
} catch (InterruptedException e) {
e.printStackTrace();
}
},String.valueOf(i)).start();
}
for (int i = 1; i <= 5; i++) {
final int temp = i;
new Thread(() ->{
try {
demo.get(temp+"");
} catch (InterruptedException e) {
e.printStackTrace();
}
},String.valueOf(i)).start();
}
}
}