ZooKeeper編程02--多線程的分佈式鎖

面向過程版:

package distributedLockProcess;

import java.util.Collections;
import java.util.List;
import java.util.concurrent.CountDownLatch;

import org.apache.zookeeper.CreateMode;
import org.apache.zookeeper.KeeperException;
import org.apache.zookeeper.WatchedEvent;
import org.apache.zookeeper.Watcher;
import org.apache.zookeeper.Watcher.Event.KeeperState;
import org.apache.zookeeper.data.Stat;
import org.apache.zookeeper.ZooDefs;
import org.apache.zookeeper.ZooKeeper;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

public class dl {
	private static final Logger LOG = LoggerFactory.getLogger(dl.class);

	//确保所有线程运行结束;
	private static final String CONNECTION_STRING = "192.168.1.201:2181,192.168.1.202:2181,192.168.1.203:2181";
	private static final int SESSION_TIMEOUT = 10000;
	private static final String GROUP_PATH = "/disLocks";
	private static final String SUB_PATH = "/disLocks/sub";
	
	private static final int THREAD_NUM = 10; 
	public static CountDownLatch threadSemaphore = new CountDownLatch(THREAD_NUM);

	public static void main(String[] args) {
	        for(int i=0; i < THREAD_NUM; i++){
	            final int threadId = i;
	            new Thread(){
	                @Override
	                public void run() {
	                	final CountDownLatch countDownLatch = new CountDownLatch(1);
	                    try{
	                    	//此線程連接ZooKeeper
	                    	ZooKeeper zk = new ZooKeeper(CONNECTION_STRING, SESSION_TIMEOUT, new Watcher(){
	                    		@Override
	                    		public void process(WatchedEvent event){
	                    			if (event.getState() == KeeperState.SyncConnected){
	                    				countDownLatch.countDown();
	                    			}
	                    		}
	                    	});
	                		countDownLatch.await();
	                		System.out.println(Thread.currentThread().getName() + " --- ZooKeeper.connect()");
	                       			
                			//GROUP_PATH不存在的话,由一个线程创建即可;
                			if(zk.exists(GROUP_PATH, false)==null){
                	            LOG.info( Thread.currentThread().getName() + "节点创建成功, Path: "
                	                    + zk.create( GROUP_PATH,
                	                    ("该节点由线程"+Thread.currentThread().getName() + "创建").getBytes(),
                	                    ZooDefs.Ids.OPEN_ACL_UNSAFE,
                	                    CreateMode.PERSISTENT )
                	                    + ", content: " + ("该节点由线程"+Thread.currentThread().getName() + "创建") );
                	        }
                	      
                			String selfPath = zk.create(SUB_PATH,null, ZooDefs.Ids.OPEN_ACL_UNSAFE, CreateMode.EPHEMERAL_SEQUENTIAL);
                		    LOG.info(Thread.currentThread().getName()+"创建锁路径:"+selfPath);
                		    if(checkMinPath(zk, selfPath)){
                		    	LOG.info(Thread.currentThread().getName() + "获取锁成功,赶紧干活!");
                		    	dosomething();
                			    threadSemaphore.countDown();
                		    	try {
                            		if(zk.exists(selfPath,false) == null){
                            			LOG.error(Thread.currentThread().getName()+"本节点已不在了...");
                            			return;
                            		}
                            		zk.delete(selfPath, -1);
                            		LOG.info(Thread.currentThread().getName() + "删除本节点:"+selfPath);
                            		zk.close();
                          		} catch (InterruptedException e) {
                          			// TODO Auto-generated catch block
                          			e.printStackTrace();
                          		} catch (KeeperException e) {
                          			// TODO Auto-generated catch block
                          			e.printStackTrace();
                          		}
                		        }
                		        	                                    			
	                    } catch (Exception e){
	                        LOG.error("【第"+threadId+"个线程】 抛出的异常:");
	                        e.printStackTrace();
	                    }
	                }
	            }.start();
	        }
	        try {
//	        	Thread.sleep(60000);
	        	threadSemaphore.await();
	            LOG.info("所有线程运行结束!");
	        } catch (Exception e) {
	            e.printStackTrace();
	        }
	    }

	protected static boolean checkMinPath(final ZooKeeper zk, final String selfPath) throws KeeperException, InterruptedException {
		List<String> subNodes = zk.getChildren(GROUP_PATH, false);
        Collections.sort(subNodes);
        int index = subNodes.indexOf( selfPath.substring(GROUP_PATH.length()+1));
        switch (index){
            case -1:{
                LOG.error(Thread.currentThread().getName()+"本节点已不在了..."+selfPath);
                return false;
            }
            case 0:{
                LOG.info(Thread.currentThread().getName()+"子节点中,我果然是老大"+selfPath);
                return true;
            }
            default:{
                final String waitPath = GROUP_PATH +"/"+ subNodes.get(index - 1);
                LOG.info(Thread.currentThread().getName()+"获取子节点中,排在我前面的"+waitPath);
                try{
                    zk.getData(waitPath, new Watcher(){
                    	@Override
                    	public void process(WatchedEvent event) {
                    		if (event.getType() == Event.EventType.NodeDeleted && event.getPath().equals(waitPath)) {  
                                LOG.info(Thread.currentThread().getName()+ "收到情报,排我前面的家伙已挂,我是不是可以出山了?");  
                                try {  
                                    if(checkMinPath(zk, selfPath)){  
                                    	LOG.info(Thread.currentThread().getName() + "获取锁成功,赶紧干活!");
                                	    dosomething();
                                	    threadSemaphore.countDown();
                                    	
                                    	try {
                                    		if(zk.exists(selfPath,false) == null){
                                    			LOG.error(Thread.currentThread().getName()+"本节点已不在了...");
                                    		} else {
                                    			zk.delete(selfPath, -1);
                                    			LOG.info(Thread.currentThread().getName() + "删除本节点:"+selfPath);
                                    			zk.close();                                    			
                                    		}
	                              		} catch (InterruptedException e) {
	                              			// TODO Auto-generated catch block
	                              			e.printStackTrace();
	                              		} catch (KeeperException e) {
	                              			// TODO Auto-generated catch block
	                              			e.printStackTrace();
	                              		}
                                    }  
                                } catch ( Exception e) {  
                                    e.printStackTrace();  
                                }  
                            } 
                    	}
                    }, new Stat());
         
                }catch(KeeperException e){
                    if(zk.exists(waitPath,false) == null){
                        LOG.info(Thread.currentThread().getName()+"子节点中,排在我前面的"+waitPath+"已失踪,幸福来得太突然?");
                        return checkMinPath(zk, selfPath);
                    }else{
                        throw e;
                    }
                } catch (InterruptedException e) {
					// TODO Auto-generated catch block
					e.printStackTrace();
				}
            }
        }
		return false;
	}

	protected static void dosomething() {
		System.out.println("我正在獨享資源互斥地進行工作。。。");
	}
}

面向對象重構版:

package distributedLockObject;
import java.io.IOException;
import java.util.concurrent.CountDownLatch;

import org.apache.zookeeper.WatchedEvent;
import org.apache.zookeeper.Watcher;
import org.apache.zookeeper.Watcher.Event.KeeperState;
import org.apache.zookeeper.ZooKeeper;


public class AbstractZooKeeper implements Watcher{
	protected ZooKeeper zookeeper;
	protected CountDownLatch countDownLatch = new CountDownLatch(1);
	
	public ZooKeeper connect(String hosts, int SESSION_TIMEOUT) throws IOException, InterruptedException{
		zookeeper = new ZooKeeper(hosts, SESSION_TIMEOUT, this);
		countDownLatch.await();
		System.out.println("AbstractZooKeeper.connect()");
		return zookeeper;
	}
	
	public void process(WatchedEvent event){
		if (event.getState() == KeeperState.SyncConnected){
			countDownLatch.countDown();
		}
	}
	
	public void close() throws InterruptedException{
		zookeeper.close();
	}
}

package distributedLockObject;

import java.util.Collections;
import java.util.List;

import org.apache.zookeeper.CreateMode;
import org.apache.zookeeper.KeeperException;
import org.apache.zookeeper.Watcher;
import org.apache.zookeeper.ZooDefs;
import org.apache.zookeeper.ZooKeeper;
import org.apache.zookeeper.data.Stat;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

public class DistributedLock    {
    private ZooKeeper zk = null;
    private String selfPath;
    private String waitPath;
    private String LOG_PREFIX_OF_THREAD=Thread.currentThread().getName();
    private static final String GROUP_PATH = "/disLocks";
    private static final String SUB_PATH = "/disLocks/sub";
    
    private static final Logger LOG = LoggerFactory.getLogger(DistributedLock.class);
    
    private Watcher  watcher;
    public DistributedLock(ZooKeeper  zk ) {
      
      this.zk = zk; 
    }
    
    
    
    public Watcher getWatcher() {
		return watcher;
	}



	public void setWatcher(Watcher watcher) {
		this.watcher = watcher;
	}



	/**
     * 获取锁
     * @return
     */
    public boolean  getLock()  throws KeeperException, InterruptedException {
        selfPath = zk.create(SUB_PATH,null, ZooDefs.Ids.OPEN_ACL_UNSAFE, CreateMode.EPHEMERAL_SEQUENTIAL);
        LOG.info(LOG_PREFIX_OF_THREAD+"创建锁路径:"+selfPath);
        if(checkMinPath()){
           return true;
        }
        
        return false;
    }
    /**
     * 创建节点
     * @param path 节点path
     * @param data 初始数据内容
     * @return
     */
    public boolean createPath( String path, String data  ) throws KeeperException, InterruptedException {
        if(zk.exists(path, false)==null){
            LOG.info( LOG_PREFIX_OF_THREAD + "节点创建成功, Path: "
                    + this.zk.create( path,
                    data.getBytes(),
                    ZooDefs.Ids.OPEN_ACL_UNSAFE,
                    CreateMode.PERSISTENT )
                    + ", content: " + data );
        }
        return true;
    }
 
      
    
 
    
    public void unlock(){
    	 try {
    		  if(zk.exists(this.selfPath,false) == null){
    	            LOG.error(LOG_PREFIX_OF_THREAD+"本节点已不在了...");
    	            return;
    	        }
			 zk.delete(this.selfPath, -1);
			 LOG.info(LOG_PREFIX_OF_THREAD + "删除本节点:"+selfPath);
	         zk.close();
		} catch (InterruptedException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (KeeperException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
    	
    }
    
 
    /**
     * 检查自己是不是最小的节点
     * @return
     */
    public  boolean checkMinPath() throws KeeperException, InterruptedException {
         List<String> subNodes = zk.getChildren(GROUP_PATH, false);
         Collections.sort(subNodes);
         int index = subNodes.indexOf( selfPath.substring(GROUP_PATH.length()+1));
         switch (index){
             case -1:{
                 LOG.error(LOG_PREFIX_OF_THREAD+"本节点已不在了..."+selfPath);
                 return false;
             }
             case 0:{
                 LOG.info(LOG_PREFIX_OF_THREAD+"子节点中,我果然是老大"+selfPath);
                 return true;
             }
             default:{
                 this.waitPath = GROUP_PATH +"/"+ subNodes.get(index - 1);
                 LOG.info(LOG_PREFIX_OF_THREAD+"获取子节点中,排在我前面的"+waitPath);
                 try{
                     zk.getData(waitPath, this.watcher, new Stat());
                     return false;
                 }catch(KeeperException e){
                     if(zk.exists(waitPath,false) == null){
                         LOG.info(LOG_PREFIX_OF_THREAD+"子节点中,排在我前面的"+waitPath+"已失踪,幸福来得太突然?");
                         return checkMinPath();
                     }else{
                         throw e;
                     }
                 }
             }
         }
     
    }

	public String getWaitPath() {
		return waitPath;
	}
 
    
   
}

package distributedLockObject;

public interface DoTemplate {
	void dodo();
}

package distributedLockObject;

import java.io.IOException;
import java.util.concurrent.CountDownLatch;

import org.apache.zookeeper.KeeperException;
import org.apache.zookeeper.ZooKeeper;


public class LockService {

	 //确保所有线程运行结束;
	private static final String CONNECTION_STRING = "192.168.1.201:2181,192.168.1.202:2181,192.168.1.203:2181";
	private static final int THREAD_NUM = 10; 
	public static   CountDownLatch threadSemaphore = new CountDownLatch(THREAD_NUM);
	private static final String GROUP_PATH = "/disLocks";

	private static final int SESSION_TIMEOUT = 10000;
	AbstractZooKeeper az = new AbstractZooKeeper();
	
	
	public void doService(DoTemplate doTemplate){
		try {
			ZooKeeper zk = az.connect(CONNECTION_STRING,SESSION_TIMEOUT);
			DistributedLock dc = new DistributedLock(zk);
			LockWatcher lw = new LockWatcher(dc,doTemplate);
			dc.setWatcher(lw);
			//GROUP_PATH不存在的话,由一个线程创建即可;
			dc.createPath(GROUP_PATH, "该节点由线程"+Thread.currentThread().getName() + "创建");
			boolean rs = dc.getLock();
			if (rs==true) {
				lw.dosomething();
				dc.unlock();
			}
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (InterruptedException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (KeeperException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
}

package distributedLockObject;
import org.apache.zookeeper.WatchedEvent;
import org.apache.zookeeper.Watcher;
import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

public class LockWatcher implements Watcher{
	private static final Logger LOG = LoggerFactory.getLogger(LockWatcher.class);

	private DistributedLock distributedLock;
	private  DoTemplate doTemplate;
	public LockWatcher(DistributedLock distributedLock,DoTemplate doTemplate) {
		// TODO Auto-generated constructor stub
		this.distributedLock = distributedLock;
		this.doTemplate = doTemplate;
	}
	
	
	@Override
	public void process(WatchedEvent event) {
		// TODO Auto-generated method stub
		if (event.getType() == Event.EventType.NodeDeleted && event.getPath().equals(distributedLock.getWaitPath())) {  
            LOG.info(Thread.currentThread().getName()+ "收到情报,排我前面的家伙已挂,我是不是可以出山了?");  
            try {  
                if(distributedLock.checkMinPath()){  
                	dosomething();
                	distributedLock.unlock();
                }  
            } catch ( Exception e) {  
                e.printStackTrace();  
            }  
        } 
	}
	
	public   void dosomething(){
	    LOG.info(Thread.currentThread().getName() + "获取锁成功,赶紧干活!");
	    doTemplate.dodo();
	    TestLock.threadSemaphore.countDown();
	    
	    
	}

}

package distributedLockObject;
import java.util.concurrent.CountDownLatch;

import org.slf4j.Logger;
import org.slf4j.LoggerFactory;

public class TestLock {
	private static final Logger LOG = LoggerFactory.getLogger(TestLock.class);
	 //确保所有线程运行结束;

	private static final int THREAD_NUM = 10; 
	public static   CountDownLatch threadSemaphore = new CountDownLatch(THREAD_NUM);

	public static void main(String[] args) {
	        for(int i=0; i < THREAD_NUM; i++){
	            final int threadId = i;
	            new Thread(){
	                @Override
	                public void run() {
	                    try{
	                    	 new LockService().doService(new DoTemplate() {
								
								@Override
								public void dodo() {
									// TODO Auto-generated method stub
									LOG.info("我要修改一个文件。。。。"+threadId);
								}
							});
	                    } catch (Exception e){
	                        LOG.error("【第"+threadId+"个线程】 抛出的异常:");
	                        e.printStackTrace();
	                    }
	                }
	            }.start();
	        }
	        try {
//	        	Thread.sleep(60000);
	        	threadSemaphore.await();
	            LOG.info("所有线程运行结束!");
	        } catch (Exception e) {
	            e.printStackTrace();
	        }
	    }
}


  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
1 目标检测的定义 目标检测(Object Detection)的任务是找出图像中所有感兴趣的目标(物体),确定它们的类别和位置,是计算机视觉领域的核心问题之一。由于各类物体有不同的外观、形状和姿态,加上成像时光照、遮挡等因素的干扰,目标检测一直是计算机视觉领域最具有挑战性的问题。 目标检测任务可为两个关键的子任务,目标定位和目标类。首先检测图像中目标的位置(目标定位),然后给出每个目标的具体类别(目标类)。输出结果是一个边界框(称为Bounding-box,一般形式为(x1,y1,x2,y2),表示框的左上角坐标和右下角坐标),一个置信度数(Confidence Score),表示边界框中是否包含检测对象的概率和各个类别的概率(首先得到类别概率,经过Softmax可得到类别标签)。 1.1 Two stage方法 目前主流的基于深度学习的目标检测算法主要为两类:Two stage和One stage。Two stage方法将目标检测过程为两个阶段。第一个阶段是 Region Proposal 生成阶段,主要用于生成潜在的目标候选框(Bounding-box proposals)。这个阶段通常使用卷积神经网络(CNN)从输入图像中提取特征,然后通过一些技巧(如选择性搜索)来生成候选框。第二个阶段是类和位置精修阶段,将第一个阶段生成的候选框输入到另一个 CNN 中进行类,并根据类结果对候选框的位置进行微调。Two stage 方法的优点是准确度较高,缺点是速度相对较慢。 常见Tow stage目标检测算法有:R-CNN系列、SPPNet等。 1.2 One stage方法 One stage方法直接利用模型提取特征值,并利用这些特征值进行目标的类和定位,不需要生成Region Proposal。这种方法的优点是速度快,因为省略了Region Proposal生成的过程。One stage方法的缺点是准确度相对较低,因为它没有对潜在的目标进行预先筛选。 常见的One stage目标检测算法有:YOLO系列、SSD系列和RetinaNet等。 2 常见名词解释 2.1 NMS(Non-Maximum Suppression) 目标检测模型一般会给出目标的多个预测边界框,对成百上千的预测边界框都进行调整肯定是不可行的,需要对这些结果先进行一个大体的挑选。NMS称为非极大值抑制,作用是从众多预测边界框中挑选出最具代表性的结果,这样可以加快算法效率,其主要流程如下: 设定一个置信度数阈值,将置信度数小于阈值的直接过滤掉 将剩下框的置信度数从大到小排序,选中值最大的框 遍历其余的框,如果和当前框的重叠面积(IOU)大于设定的阈值(一般为0.7),就将框删除(超过设定阈值,认为两个框的里面的物体属于同一个类别) 从未处理的框中继续选一个置信度数最大的,重复上述过程,直至所有框处理完毕 2.2 IoU(Intersection over Union) 定义了两个边界框的重叠度,当预测边界框和真实边界框差异很小时,或重叠度很大时,表示模型产生的预测边界框很准确。边界框A、B的IOU计算公式为: 2.3 mAP(mean Average Precision) mAP即均值平均精度,是评估目标检测模型效果的最重要指标,这个值介于0到1之间,且越大越好。mAP是AP(Average Precision)的平均值,那么首先需要了解AP的概念。想要了解AP的概念,还要首先了解目标检测中Precision和Recall的概念。 首先我们设置置信度阈值(Confidence Threshold)和IoU阈值(一般设置为0.5,也会衡量0.75以及0.9的mAP值): 当一个预测边界框被认为是True Positive(TP)时,需要同时满足下面三个条件: Confidence Score > Confidence Threshold 预测类别匹配真实值(Ground truth)的类别 预测边界框的IoU大于设定的IoU阈值 不满足条件2或条件3,则认为是False Positive(FP)。当对应同一个真值有多个预测结果时,只有最高置信度数的预测结果被认为是True Positive,其余被认为是False Positive。 Precision和Recall的概念如下图所示: Precision表示TP与预测边界框数量的比值 Recall表示TP与真实边界框数量的比值 改变不同的置信度阈值,可以获得多组Precision和Recall,Recall放X轴,Precision放Y轴,可以画出一个Precision-Recall曲线,简称P-R
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值