Zookeeper节点锁实现

Zookeeper节点锁实现理论分析

    1,该功能基于zookeeper有序节点的小DEMO实现

    2,新增节点后尝试对该节点加锁

    3,加锁失败后,进入线程等待, 并对上一节点进行监听

    4,上一节点状态变更后唤醒线程获取锁执行任务

    5,执行完成后,释放锁

Zookeeper节点锁编码变现

    1,jar包引入

<dependency>
      <groupId>org.apache.curator</groupId>
      <artifactId>curator-framework</artifactId>
      <version>4.0.0</version>
    </dependency>

    2,定义类实现锁及事件接口,重写方法后定义必要的成员变量

           * 基于zookeeper根节点下的/locks节点来实现锁机制

public class ZookeeperLockDemo implements Lock, Watcher {

    // ZK链接
    private ZooKeeper zooKeeper = null;

    // 根节点
    private final String ROUTE_LOCK = "/locks";

    // 等待锁-->即前一个锁
    private String WAIT_LOCK;

    // 当前锁节点
    private String CURR_LOCK;

    // 线程沉睡唤醒
    private CountDownLatch countDownLatch;

    3,通过构造方法初始化链接及根节点,基于zookeeper集群实现

public ZookeeperLockDemo() throws IOException, KeeperException, InterruptedException {
        String host = "192.168.91.128:2181,192.168.91.129:2181,192.168.91.130:2181";
        // this引用当前process方法实现监听
        zooKeeper = new ZooKeeper(host, 4000, this);
        // 判断当前节点是否存在
        Stat stat = zooKeeper.exists(ROUTE_LOCK, false);
        // 创建持久化节点
        if (null == stat) {
            zooKeeper.create(ROUTE_LOCK, "0".getBytes(), ZooDefs.Ids.OPEN_ACL_UNSAFE, CreateMode.PERSISTENT);
        }
    }

    4,对当前链接节点加锁

public void lock() {
        if (tryLock()) {
            System.out.println(Thread.currentThread().getName() + "-->" + CURR_LOCK + "获得锁成功");
        }
        waitForLock(WAIT_LOCK);
    }

    5,加锁判断

public boolean tryLock() {
        try {
            // 创建临时有序节点
            CURR_LOCK = zooKeeper.create(ROUTE_LOCK + "/", "0".getBytes(),
                    ZooDefs.Ids.OPEN_ACL_UNSAFE, CreateMode.EPHEMERAL_SEQUENTIAL);
            System.out.println(Thread.currentThread().getName() + "-->" + CURR_LOCK + "尝试竞争锁");
            // 获取根节点下的所有子节点
            List<String> lstChildren = zooKeeper.getChildren(ROUTE_LOCK, false);
            // 节点排序
            SortedSet<String> set = new TreeSet<String>();
            for (String child : lstChildren) {
                set.add(ROUTE_LOCK + "/" + child);
            }
            // 获取有序集合中第一个元素
            String firstElement = set.first();
            // 获取当前节点的所有队列靠前节点
            SortedSet<String> headSet = ((TreeSet<String>) set).headSet(CURR_LOCK);
            // 竞争锁
            if (CURR_LOCK.equals(firstElement)) {
                return true;
            }
            // 最后一个节点为当前节点的等待节点
            if (!headSet.isEmpty()) {
                WAIT_LOCK = headSet.last();
            }
        } catch (KeeperException e) {
            e.printStackTrace();
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
        return false;
    }

    6,tryLock()失败后,对上一节点锁进行监听,并进行等待

private boolean waitForLock(String waitLock) {
        try {
            // 监听当前节点上一个节点
            Stat stat = zooKeeper.exists(waitLock, true);
            if (stat != null) {
                System.out.println(Thread.currentThread().getName() + "等待锁 :" + ROUTE_LOCK + "/" + waitLock + "释放");
                countDownLatch = new CountDownLatch(1);
                countDownLatch.await();
                System.out.println(Thread.currentThread().getName() + "获得锁成功");
            }
        } catch (KeeperException e) {
            e.printStackTrace();
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
        return true;
    }

    7,节点任务执行完成后,对锁进行释放(此处为删除节点)

public void unlock() {
        System.out.println(Thread.currentThread().getName() + "释放锁 : " + CURR_LOCK);
        try {
            zooKeeper.delete(CURR_LOCK, -1);
            CURR_LOCK = null;
            zooKeeper.close();
        } catch (InterruptedException e) {
            e.printStackTrace();
        } catch (KeeperException e) {
            e.printStackTrace();
        }
    }

    8,exist()事件监听,监听到节点不存在时,CountDownLatch进行countDown()操作

public void process(WatchedEvent watchedEvent) {
        if (null != countDownLatch) {
            countDownLatch.countDown();
        }
    }

    9,CountDownLatch参数为0后,自动唤醒线程,为当前节点加锁

private boolean waitForLock(String waitLock) {
        try {
            // 监听当前节点上一个节点
            Stat stat = zooKeeper.exists(waitLock, true);
            if (stat != null) {
                System.out.println(Thread.currentThread().getName() + "等待锁 :" + ROUTE_LOCK + "/" + waitLock + "释放");
                // countDownLatch参数为1,线程等待
                countDownLatch = new CountDownLatch(1);
                countDownLatch.await();
                // countDownLatch参数为0后,自动唤醒线程执行
                System.out.println(Thread.currentThread().getName() + "获得锁成功");
            }
        } catch (KeeperException e) {
            e.printStackTrace();
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
        return true;
    }

    10,执行完成后,进行锁释放,下一节点对当前节点进行监听,继续获取锁

public void unlock() {
        System.out.println(Thread.currentThread().getName() + "释放锁 : " + CURR_LOCK);
        try {
            zooKeeper.delete(CURR_LOCK, -1);
            CURR_LOCK = null;
            zooKeeper.close();
        } catch (InterruptedException e) {
            e.printStackTrace();
        } catch (KeeperException e) {
            e.printStackTrace();
        }
    }

    11,客户端调用

public class LockDemoTest {
    public static void main(String[] args) throws Exception {
        final CountDownLatch countDownLatch = new CountDownLatch(10);
        for (int i = 0; i < 10; i++) {
            new Thread(new Runnable() {
                @Override
                public void run() {
                    try {
                        countDownLatch.await();
                        ZookeeperLockDemo zookeeperLockDemo = new ZookeeperLockDemo();
                        zookeeperLockDemo.lock();
                    } catch (InterruptedException e) {
                        e.printStackTrace();
                    } catch (IOException e) {
                        e.printStackTrace();
                    } catch (KeeperException e) {
                        e.printStackTrace();
                    }
                }
            }, "Thread-->" + i).start();
            countDownLatch.countDown();
        }
        System.in.read();
    }
}

    12, 执行效果

         * 手动删除节点9,制造锁释放场景

         * 观察控制台会发现0节点获取锁

         * 可以通过获取锁后直接释放来观察结果

private boolean waitForLock(String waitLock) {
        try {
            // 监听当前节点上一个节点
            Stat stat = zooKeeper.exists(waitLock, true);
            if (stat != null) {
                System.out.println(Thread.currentThread().getName() + "等待锁 :" + ROUTE_LOCK + "/" + waitLock + "释放");
                // countDownLatch参数为1,线程等待
                countDownLatch = new CountDownLatch(1);
                countDownLatch.await();
                // countDownLatch参数为0后,自动唤醒线程执行
                System.out.println(Thread.currentThread().getName() + "获得锁成功");
                Thread.sleep(2000);
                System.out.println(System.currentTimeMillis());
                unlock();
            }
        } catch (KeeperException e) {
            e.printStackTrace();
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
        return true;
    }

       * 最后,基于原生的zookeeper链接,多线程连接判断存在漏洞,第一次执行会报错

  • 0
    点赞
  • 2
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
Zookeeper分布式锁实现原理: 1. 创建一个Zookeeper节点作为的根节点。 2. 当一个进程想要获取时,它在根节点下创建一个临时顺序节点。 3. 进程通过比较自己创建的节点和兄弟节点的名称来判断自己是否获得了。 4. 如果进程没有获得,它就会监听它前面的一个节点,当这个节点被删除时,它就可以再次比较自己的节点和兄弟节点的名称来判断自己是否获得了。 5. 当进程释放时,它会删除它自己创建的节点。 下面是一个简单的Zookeeper分布式锁的Java实现: ```java import org.apache.zookeeper.*; import org.apache.zookeeper.data.Stat; public class DistributedLock implements Watcher { private ZooKeeper zk; private String lockPath; private String myZnode; public DistributedLock(String zkHost, String lockPath) throws Exception { this.lockPath = lockPath; zk = new ZooKeeper(zkHost, 5000, this); if (zk.exists(lockPath, false) == null) { zk.create(lockPath, new byte[0], ZooDefs.Ids.OPEN_ACL_UNSAFE, CreateMode.PERSISTENT); } } public void lock() throws Exception { myZnode = zk.create(lockPath + "/lock_", new byte[0], ZooDefs.Ids.OPEN_ACL_UNSAFE, CreateMode.EPHEMERAL_SEQUENTIAL); while (true) { Stat stat = zk.exists(lockPath + "/" + getPrevNode(myZnode), true); if (stat == null) { return; } waitLock(); } } public void unlock() throws Exception { zk.delete(myZnode, -1); } private void waitLock() throws Exception { synchronized (this) { wait(); } } private String getPrevNode(String myZnode) { int index = myZnode.lastIndexOf("_"); return index == -1 ? "" : myZnode.substring(0, index); } public void process(WatchedEvent event) { synchronized (this) { notifyAll(); } } } ``` 使用示例: ```java public static void main(String[] args) throws Exception { DistributedLock lock = new DistributedLock("localhost:2181", "/mylock"); lock.lock(); try { // 执行任务 } finally { lock.unlock(); } } ```
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值