前往小程序,Get更优阅读体验!
立即前往
首页
学习
活动
专区
工具
TVP
发布
社区首页 >专栏 >Java并发-16.重入锁

Java并发-16.重入锁

作者头像
悠扬前奏
发布2019-05-28 13:24:15
4130
发布2019-05-28 13:24:15
举报
文章被收录于专栏:悠扬前奏的博客
  • 重入锁ReentrantLock,支持重进入的锁,能支持一个线程对资源的重复加锁
  • 支持获取锁时的公平和非公平的选择,默认非公平
  • 锁的公平与否:在绝对时间上,先对锁进行获取的请求一定先被满足,则锁是公平的,反之不公平。
  • 重进入是指任意线程在获取到锁之后能够再次获取该锁,需要解决两个问题:
    • 识别获取锁的线程是否为占据当前锁的线程。
    • 线程重复n次获取锁,随后第n次释放锁后,其他线程能获取到锁。
    • ReentrantLock通过组合自定义同步�器实现锁的获取和释放:
    • nonfairTryAcquire方法非公平获取
    • tryAcquire()方法公平获取,比nonfairTryAcquire多了hasQueuedPredecessors()方法判断同步队列当前节点是否有前驱节点的判断。 公平锁和非公平锁的代码示例:
代码语言:javascript
复制
import org.junit.Test;

import java.util.ArrayList;
import java.util.Collection;
import java.util.Collections;
import java.util.List;
import java.util.concurrent.locks.Lock;
import java.util.concurrent.locks.ReentrantLock;

/**
 * @author pengjunzhe
 */
public class FairAndUnfairTest {
    private static Lock fairLock = new ReentrantLock2(true);
    private static Lock unFairLock = new ReentrantLock2(false);

    @Test
    public void fair() {
        testLock(fairLock);
    }

    @Test
    public void unfair() {
        testLock(unFairLock);
    }

    private void testLock(Lock lock) {
        //TODO:启动5个Job
        for (int i = 0; i < 5; i++) {
            Thread thread = new Thread(new Job(lock), String.valueOf(i));
            thread.start();
        }
        SleepUtils.second(2);
    }

    private static class Job extends Thread {
        private Lock lock;

        public Job(Lock lock) {
            this.lock = lock;
        }

        @Override
        public void run() {
            // TODO:连续两次打印当前的Thread和等待队列中的Thread
            for (int i = 0; i < 2; i++) {
                lock.lock();
                try {
                    System.out.println("Lock by["
                            + Thread.currentThread().getName()
                            + "]"
                            + "Waiting by " + ((ReentrantLock2) lock).getQueuedThreadNames());
                } finally {
                    lock.unlock();
                }
            }
        }
    }

    private static class ReentrantLock2 extends ReentrantLock {
        public ReentrantLock2(boolean fair) {
            super(fair);
        }

        @Override
        public Collection<Thread> getQueuedThreads() {
            List<Thread> threads = new ArrayList<>(super.getQueuedThreads());
            Collections.reverse(threads);
            return threads;
        }

        public Collection<String> getQueuedThreadNames() {
            List<String> names = new ArrayList<>(8);
            getQueuedThreads().forEach((s) -> names.add(s.getName()));
            return names;
        }
    }
}

输出分别为: Fair:

代码语言:javascript
复制
Lock by[0]Waiting by []
Lock by[1]Waiting by [2, 3, 4, 0]
Lock by[2]Waiting by [3, 4, 0, 1]
Lock by[3]Waiting by [4, 0, 1, 2]
Lock by[4]Waiting by [0, 1, 2, 3]
Lock by[0]Waiting by [1, 2, 3, 4]
Lock by[1]Waiting by [2, 3, 4]
Lock by[2]Waiting by [3, 4]
Lock by[3]Waiting by [4]
Lock by[4]Waiting by []

Unfair:

代码语言:javascript
复制
Lock by[0]Waiting by []
Lock by[0]Waiting by [1, 2, 3, 4]
Lock by[1]Waiting by [2, 3, 4]
Lock by[1]Waiting by [2, 3, 4]
Lock by[2]Waiting by [3, 4]
Lock by[2]Waiting by [3, 4]
Lock by[3]Waiting by [4]
Lock by[3]Waiting by [4]
Lock by[4]Waiting by []
Lock by[4]Waiting by []
本文参与 腾讯云自媒体同步曝光计划,分享自作者个人站点/博客。
原始发表:2019.05.12 ,如有侵权请联系 cloudcommunity@tencent.com 删除

本文分享自 作者个人站点/博客 前往查看

如有侵权,请联系 cloudcommunity@tencent.com 删除。

本文参与 腾讯云自媒体同步曝光计划  ,欢迎热爱写作的你一起参与!

评论
登录后参与评论
0 条评论
热度
最新
推荐阅读
领券
问题归档专栏文章快讯文章归档关键词归档开发者手册归档开发者手册 Section 归档