zk的curator提供的几种分布式锁

1.pom依赖:

<dependency>
			<groupId>org.apache.curator</groupId>
            <artifactId>curator-framework</artifactId>
			<version>2.4.2</version>
		</dependency>
	    <dependency>  
	        <groupId>org.apache.curator</groupId>  
	        <artifactId>curator-recipes</artifactId>  
	        <version>2.5.0</version>  
   		 </dependency> 

2.重入锁demo:

package lock;

import java.util.concurrent.Semaphore;

import org.apache.curator.RetryPolicy;
import org.apache.curator.framework.CuratorFramework;
import org.apache.curator.framework.CuratorFrameworkFactory;
import org.apache.curator.framework.recipes.locks.InterProcessMutex;
import org.apache.curator.retry.ExponentialBackoffRetry;

public class CuratorDistributeLockTest {
	private int i = 1;
	public void increace() {
		System.out.println(i++);
	}
	public static void main(String[] args) {
        String zkAddr = "192.168.1.202:2181";
        String lockPath = "/distribute-lock";
        RetryPolicy retryPolicy = new ExponentialBackoffRetry(10000, 0);
        CuratorFramework cf = CuratorFrameworkFactory.builder()
                .connectString(zkAddr)
                .sessionTimeoutMs(2000)
                .retryPolicy(retryPolicy)
                .build();
        cf.start();
       final CuratorDistributeLockTest test = new CuratorDistributeLockTest();
       final InterProcessMutex lock = new InterProcessMutex(cf, lockPath);
        Runnable runnable = new Runnable() {
			public void run() {
				try {
					long start = System.currentTimeMillis();
		            lock.acquire();
					Thread.sleep(1000);
					test.increace();
		            //System.out.println("持续时间:"+(System.currentTimeMillis() - start));
		        } catch (Exception e) {
		            e.printStackTrace();
		        } finally {
		            try {
		                lock.release();
		            } catch (Exception e) {
		                e.printStackTrace();
		            }
		        }
			}
		};
		for (int i = 0; i < 50; i++) {
			Thread t = new Thread(runnable);
			t.start();
		}
    }
 
}

curator中还实现了多线程中其他的锁,如InterProcessReadWriteLock(读写锁)

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值