ZooKeeper分布式锁

本文介绍了一种基于ZooKeeper实现的分布式锁机制。该机制通过创建临时有序节点来获取锁,确保了高并发环境下资源操作的一致性和互斥性。文章提供了详细的Java代码示例,展示了如何在实际应用中部署和使用该分布式锁。


package cn.com.lovesimly.zookeeper;


import java.io.IOException;
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.locks.Condition;
import java.util.concurrent.locks.Lock;


import org.apache.zookeeper.CreateMode;
import org.apache.zookeeper.KeeperException;
import org.apache.zookeeper.WatchedEvent;
import org.apache.zookeeper.Watcher;
import org.apache.zookeeper.ZooDefs;
import org.apache.zookeeper.ZooKeeper;
import org.apache.zookeeper.data.Stat;


/**
 * DistributedLock lock = null; try { lock = new
 * DistributedLock("127.0.0.1:2182","test"); lock.lock(); //do something... }
 * catch (Exception e) { e.printStackTrace(); } finally { if(lock != null)
 * lock.unlock(); }
 */
public class DistributedLock implements Lock, Watcher {
    private ZooKeeper       zk;
    private String          root           = "/locks";                  //根
    private String          lockName;                                   //竞争资源的标志
    private String          waitNode;                                   //等待前一个锁
    private String          myZnode;                                    //当前锁
    private CountDownLatch  latch;                                      //计数器
    private int             sessionTimeout = 30000;
    private List<Exception> exception      = new ArrayList<Exception>();


    /**
     * 创建分布式锁,使用前请确认config配置的zookeeper服务可用
     * 
     * @param config 127.0.0.1:2181
     * @param lockName 竞争资源标志,lockName中不能包含单词lock
     */
    public DistributedLock(String config, String lockName) {
        this.lockName = lockName;
        // 创建一个与服务器的连接
        try {
            zk = new ZooKeeper(config, sessionTimeout, this);
            Stat stat = zk.exists(root, false);
            if (stat == null) {
                // 创建根节点
                zk.create(root, new byte[0], ZooDefs.Ids.OPEN_ACL_UNSAFE, CreateMode.PERSISTENT);
            }
        } catch (IOException e) {
            exception.add(e);
        } catch (KeeperException e) {
            exception.add(e);
        } catch (InterruptedException e) {
            exception.add(e);
        }
    }


    /**
     * zookeeper节点的监视器
     */
    public void process(WatchedEvent event) {
        if (this.latch != null) {
            this.latch.countDown();
        }
    }


    public void lock() {
        if (exception.size() > 0) {
            throw new LockException(exception.get(0));
        }
        try {
            if (this.tryLock()) {
                System.out.println("Thread " + Thread.currentThread().getId() + " " + myZnode + " get lock true");
                return;
            } else {
                waitForLock(waitNode, sessionTimeout);//等待锁
            }
        } catch (KeeperException e) {
            throw new LockException(e);
        } catch (InterruptedException e) {
            throw new LockException(e);
        }
    }


    public boolean tryLock() {
        try {
            String splitStr = "_lock_";
            if (lockName.contains(splitStr))
                throw new LockException("lockName can not contains \\u000B");
            //创建临时子节点
            myZnode = zk.create(root + "/" + lockName + splitStr, new byte[0], ZooDefs.Ids.OPEN_ACL_UNSAFE,
                    CreateMode.EPHEMERAL_SEQUENTIAL);
            System.out.println(myZnode + " is created ");
            //取出所有子节点
            List<String> subNodes = zk.getChildren(root, false);
            //取出所有lockName的锁
            List<String> lockObjNodes = new ArrayList<String>();
            for (String node : subNodes) {
                String _node = node.split(splitStr)[0];
                if (_node.equals(lockName)) {
                    lockObjNodes.add(node);
                }
            }
            Collections.sort(lockObjNodes);
            System.out.println(myZnode + "==" + lockObjNodes.get(0));
            if (myZnode.equals(root + "/" + lockObjNodes.get(0))) {
                //如果是最小的节点,则表示取得锁
                return true;
            }
            //如果不是最小的节点,找到比自己小1的节点
            String subMyZnode = myZnode.substring(myZnode.lastIndexOf("/") + 1);
            waitNode = lockObjNodes.get(Collections.binarySearch(lockObjNodes, subMyZnode) - 1);
        } catch (KeeperException e) {
            throw new LockException(e);
        } catch (InterruptedException e) {
            throw new LockException(e);
        }
        return false;
    }


    public boolean tryLock(long time, TimeUnit unit) {
        try {
            if (this.tryLock()) {
                return true;
            }
            return waitForLock(waitNode, time);
        } catch (Exception e) {
            e.printStackTrace();
        }
        return false;
    }


    private boolean waitForLock(String lower, long waitTime) throws InterruptedException, KeeperException {
        Stat stat = zk.exists(root + "/" + lower, true);
        //判断比自己小一个数的节点是否存在,如果不存在则无需等待锁,同时注册监听
        if (stat != null) {
            System.out.println("Thread " + Thread.currentThread().getId() + " waiting for " + root + "/" + lower);
            this.latch = new CountDownLatch(1);
            this.latch.await(waitTime, TimeUnit.MILLISECONDS);
            this.latch = null;
        }
        return true;
    }


    public void unlock() {
        try {
            System.out.println("unlock " + myZnode);
            zk.delete(myZnode, -1);
            myZnode = null;
            zk.close();
        } catch (InterruptedException e) {
            e.printStackTrace();
        } catch (KeeperException e) {
            e.printStackTrace();
        }
    }


    public void lockInterruptibly() throws InterruptedException {
        this.lock();
    }


    public Condition newCondition() {
        return null;
    }


    public class LockException extends RuntimeException {
        private static final long serialVersionUID = 1L;


        public LockException(String e) {
            super(e);
        }


        public LockException(Exception e) {
            super(e);
        }
    }


}

-------------------------------------------------------------------------------------------------------------------------------------------------------------

package cn.com.lovesimly.zookeeper;


import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.concurrent.CopyOnWriteArrayList;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.atomic.AtomicInteger;


/**
 * ConcurrentTask[] task = new ConcurrentTask[5]; for(int
 * i=0;i<task.length;i++){ task[i] = new ConcurrentTask(){ public void run() {
 * System.out.println("=============="); }}; } new ConcurrentTest(task);
 */
public class ConcurrentTest {
    private CountDownLatch             startSignal = new CountDownLatch(1);           //开始阀门
    private CountDownLatch             doneSignal  = null;                            //结束阀门
    private CopyOnWriteArrayList<Long> list        = new CopyOnWriteArrayList<Long>();
    private AtomicInteger              err         = new AtomicInteger();             //原子递增
    private ConcurrentTask[]           task        = null;


    public ConcurrentTest(ConcurrentTask... task) {
        this.task = task;
        if (task == null) {
            System.out.println("task can not null");
            System.exit(1);
        }
        doneSignal = new CountDownLatch(task.length);
        start();
    }


    /**
     * @param args
     * @throws ClassNotFoundException
     */
    private void start() {
        //创建线程,并将所有线程等待在阀门处
        createThread();
        //打开阀门
        startSignal.countDown();//递减锁存器的计数,如果计数到达零,则释放所有等待的线程
        try {
            doneSignal.await();//等待所有线程都执行完毕
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
        //计算执行时间
        getExeTime();
    }


    /**
     * 初始化所有线程,并在阀门处等待
     */
    private void createThread() {
        long len = doneSignal.getCount();
        for (int i = 0; i < len; i++) {
            final int j = i;
            new Thread(new Runnable() {
                public void run() {
                    try {
                        startSignal.await();//使当前线程在锁存器倒计数至零之前一直等待
                        long start = System.currentTimeMillis();
                        task[j].run();
                        long end = (System.currentTimeMillis() - start);
                        list.add(end);
                    } catch (Exception e) {
                        err.getAndIncrement();//相当于err++
                    }
                    doneSignal.countDown();
                }
            }).start();
        }
    }


    /**
     * 计算平均响应时间
     */
    private void getExeTime() {
        int size = list.size();
        List<Long> _list = new ArrayList<Long>(size);
        _list.addAll(list);
        Collections.sort(_list);
        long min = _list.get(0);
        long max = _list.get(size - 1);
        long sum = 0L;
        for (Long t : _list) {
            sum += t;
        }
        long avg = sum / size;
        System.out.println("min: " + min);
        System.out.println("max: " + max);
        System.out.println("avg: " + avg);
        System.out.println("err: " + err.get());
    }


    public interface ConcurrentTask {
        void run();
    }


}

--------------------------------------------------------------------------------------------------------------------------------------------


package cn.com.lovesimly.zookeeper;


import cn.com.lovesimly.zookeeper.ConcurrentTest.ConcurrentTask;


public class ZkTest {
    public static void main(String[] args) {
        Runnable task1 = new Runnable() {
            public void run() {
                DistributedLock lock = null;
                try {
                    lock = new DistributedLock("10.139.32.187:2181", "love");
                    //lock = new DistributedLock("127.0.0.1:2182","test2");
                    lock.lock();
                    Thread.sleep(3000);
                    System.out.println("===Thread " + Thread.currentThread().getId() + " running");
                } catch (Exception e) {
                    e.printStackTrace();
                } finally {
                    if (lock != null)
                        lock.unlock();
                }


            }


        };
        new Thread(task1).start();
        try {
            Thread.sleep(1000);
        } catch (InterruptedException e1) {
            e1.printStackTrace();
        }
        ConcurrentTask[] tasks = new ConcurrentTask[10];
        for (int i = 0; i < tasks.length; i++) {
            ConcurrentTask task3 = new ConcurrentTask() {
                public void run() {
                    DistributedLock lock = null;
                    try {
                        lock = new DistributedLock("10.139.32.187:2181", "love");
                        lock.lock();
                        System.out.println("Thread " + Thread.currentThread().getId() + " running");
                    } catch (Exception e) {
                        e.printStackTrace();
                    } finally {
                        lock.unlock();
                    }


                }
            };
            tasks[i] = task3;
        }
        new ConcurrentTest(tasks);
    }
}

---------------------------------------------------------------------------

结果:

log4j:WARN No appenders could be found for logger (org.apache.zookeeper.ZooKeeper).
log4j:WARN Please initialize the log4j system properly.
/locks/love_lock_0000000047 is created 
/locks/love_lock_0000000047==love_lock_0000000047
Thread 9 /locks/love_lock_0000000047 get lock true
/locks/love_lock_0000000048 is created 
/locks/love_lock_0000000048==love_lock_0000000047
/locks/love_lock_0000000049 is created 
/locks/love_lock_0000000050 is created 
/locks/love_lock_0000000051 is created 
/locks/love_lock_0000000052 is created 
/locks/love_lock_0000000055 is created 
/locks/love_lock_0000000053 is created 
/locks/love_lock_0000000056 is created 
Thread 12 waiting for /locks/love_lock_0000000047
/locks/love_lock_0000000054 is created 
/locks/love_lock_0000000057 is created 
/locks/love_lock_0000000049==love_lock_0000000047
/locks/love_lock_0000000051==love_lock_0000000047
/locks/love_lock_0000000050==love_lock_0000000047
/locks/love_lock_0000000052==love_lock_0000000047
/locks/love_lock_0000000055==love_lock_0000000047
Thread 14 waiting for /locks/love_lock_0000000048
/locks/love_lock_0000000053==love_lock_0000000047
/locks/love_lock_0000000056==love_lock_0000000047
/locks/love_lock_0000000054==love_lock_0000000047
/locks/love_lock_0000000057==love_lock_0000000047
Thread 15 waiting for /locks/love_lock_0000000049
Thread 20 waiting for /locks/love_lock_0000000050
Thread 18 waiting for /locks/love_lock_0000000051
Thread 19 waiting for /locks/love_lock_0000000054
Thread 13 waiting for /locks/love_lock_0000000052
Thread 16 waiting for /locks/love_lock_0000000055
Thread 17 waiting for /locks/love_lock_0000000053
Thread 21 waiting for /locks/love_lock_0000000056
===Thread 9 running
unlock /locks/love_lock_0000000047
Thread 12 running
unlock /locks/love_lock_0000000048
Thread 14 running
unlock /locks/love_lock_0000000049
Thread 15 running
unlock /locks/love_lock_0000000050
Thread 20 running
unlock /locks/love_lock_0000000051
Thread 18 running
unlock /locks/love_lock_0000000052
Thread 13 running
unlock /locks/love_lock_0000000053
Thread 17 running
unlock /locks/love_lock_0000000054
Thread 19 running
unlock /locks/love_lock_0000000055
Thread 16 running
unlock /locks/love_lock_0000000056
Thread 21 running
unlock /locks/love_lock_0000000057
min: 11351
max: 11699
avg: 11519
err: 0

训练数据保存为deep_convnet_params.pkl,UI使用wxPython编写。卷积神经网络(CNN)是一种专门针对图像、视频等结构化数据设计的深度学习模型,在计算机视觉、语音识别、自然语言处理等多个领域有广泛应用。其核心设计理念源于对生物视觉系统的模拟,主要特点包括局部感知、权重共享、多层级抽象以及空间不变性。 **1. 局部感知与卷积操作** 卷积层是CNN的基本构建块,使用一组可学习的滤波器对输入图像进行扫描。每个滤波器在图像上滑动,以局部区域内的像素值与滤波器权重进行逐元素乘法后求和,生成输出值。这一过程能够捕获图像中的边缘、纹理等局部特征。 **2. 权重共享** 同一滤波器在整个输入图像上保持相同的权重。这显著减少了模型参数数量,增强了泛化能力,并体现了对图像平移不变性的内在假设。 **3. 池化操作** 池化层通常紧随卷积层之后,用于降低数据维度并引入空间不变性。常见方法有最大池化和平均池化,它们可以减少模型对微小位置变化的敏感度,同时保留重要特征。 **4. 多层级抽象** CNN通常包含多个卷积和池化层堆叠在一起。随着网络深度增加,每一层逐渐提取更复杂、更抽象的特征,从底层识别边缘、角点,到高层识别整个对象或场景,使得CNN能够从原始像素数据中自动学习到丰富的表示。 **5. 激活函数与正则化** CNN中使用非线性激活函数来引入非线性表达能力。为防止过拟合,常采用正则化技术,如L2正则化和Dropout,以增强模型的泛化性能。 **6. 应用场景** CNN在诸多领域展现出强大应用价值,包括图像分类、目标检测、语义分割、人脸识别、图像生成、医学影像分析以及自然语言处理等任务。 **7. 发展与演变** CNN的概念起源于20世纪80年代,其影响力在硬件加速和大规模数据集出现后真正显现。经典模型如LeNet-5用于手写数字识别,而AlexNet、VGG、GoogLeNet、ResNet等现代架构推动了CNN技术的快速发展。如今,CNN已成为深度学习图像处理领域的基石,并持续创新。 资源来源于网络分享,仅用于学习交流使用,请勿用于商业,如有侵权请联系我删除!
评论
成就一亿技术人!
拼手气红包6.0元
还能输入1000个字符
 
红包 添加红包
表情包 插入表情
 条评论被折叠 查看
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值