ZooKeeper实现读写锁

  • 时间:
  • 浏览:8
  • 来源:大发pk10_pk10辅助_大发pk10辅助

在上一篇文章,亲戚亲戚亲们将会实现了分布式锁。今天更进一步,在分布式锁的基础之上,实现读写锁。

完整代码在 https://github.com/SeemSilly/codestory/tree/master/research-zoo-keeper

1 读写锁的概念

参考维基百科的条目: https://zh.wikipedia.org/wiki/读写锁

读写锁是计算机tcp连接的并发控制的一种同步机制,用于外理读写问提,读操作可并发重入,写操作是互斥的。 读写锁有多种读写权限的优先级策略,回会 设计为读优先、写优先或不指定优先级。

  • 读优先:允许最大并发的读操作,但将会会饿死写操作;将会写操作只能在这麼 任何读操作的过后才并能执行。
  • 写优先:假若排队队列中有 写操作,读操作就只能停留;
  • 不指定优先级:对读操作和写操作不做任何优先级的假设

不指定优先级的策略,最适合使用ZooKeeper的子节点模式来实现,今天就来尝试一种策略。

2 锁设计

同前面介绍的普通分布式锁,也使用子节点模式实现。先用容器模式(CreateMode.CONTAINER)创建唯一的锁节点,每个锁客户端在锁节点下使用临时循序模式(CreateMode. SEQUENTIAL)创建子节点。哪些地方地方子节点会自动在名称上边追加10位数字。

2.1 咋样标识读锁还是写锁?

一种简单的方案:在子节点名中标识、在节点的值中标识。将会采用在值中标识,每次子节点列表后,还只能再分别读一下子节点的值,并能判断是读锁还是写锁,会比较耗时。将会在子节点名称中标识,会面临一好几个 多多问提:在同一好几个 多多节点中创建的子节点,将会给定的名称不同,追加的10位数字与非 仍然是递归的?

写个测试用例验证一下。

public class SequentialTest extends TestBase {
  @Test
  public void testSequential() throws Exception {
    String rootNodeName = "/container-" + System.currentTimeMillis();
    ZooKeeperBase zooKeeper = new ZooKeeperBase(address);
    zooKeeper.createRootNode(rootNodeName, CreateMode.CONTAINER);

    Random random = new SecureRandom();
    long lastNumber = -1L;
    String[] prefixs = new String[] {"/a", "/b", "/c", "/d", "/e", "/f", "/g"};
    for (int i = 0; i < 10; i++) {
      int index = random.nextInt(prefixs.length);
      String childNodeName = rootNodeName + prefixs[index];
      String fullNodeName = zooKeeper.getZooKeeper().create(childNodeName, new byte[0],
          ZooDefs.Ids.OPEN_ACL_UNSAFE, CreateMode.EPHEMERAL_SEQUENTIAL);
      long number = Long.parseLong(fullNodeName.substring(childNodeName.length()));
      assert number == lastNumber + 1;
      lastNumber = number;
    }
  }
}

测试用例通过,说明在同一好几个 多多Container中创建的子节点,不论提供的节点名是哪些地方,后续追加的10位数字回会 顺序递增的。过后,就回会 使用节点名来区分读锁和写锁。

2.2   类设计

介绍分布式锁的过后,将会创建了阻塞锁 ChildrenBlockingLock,读写锁正好回会 基于一种类做重载。

 

2.3   获取锁的逻辑

写锁是一好几个 多多独占锁,逻辑跟普通分布式锁相同,假若它过后有锁就只能停留。可是我,完整沿用阻塞锁的逻辑即可。

读锁允许并发,它过后回会 有任意读锁,但只能有写锁。可是我只只能判断有这麼 写锁即可。

3      关键代码

3.1   ChildrenNodeLock.java

一种类,主可是我增加了一好几个 多多获取排序后子节点列表的法律土方式,过后方便实现读写锁的代码。当然,一种操作会增加但会 耗时,将会子节点数量不要 ,将会不适用。

首先定义一好几个 多多函数,用来返回子节点的前缀

/** 子节点的前缀,缺省是element,子类回会



重载 */
protected String getChildPrefix() {
  return "element";
}

但会 定义一好几个 多多内部管理类,子节点排序回会 用到

/** 子节点名称比较 */
private class StringCompare implements Comparator<String> {
  @Override
  public int compare(String string1, String string2) {
    return string1.substring(string1.length() - 10)
        .compareTo(string2.substring(string2.length() - 10));
  }
}

最后实现子节点排序法律土方式,用于代替 getChildren 函数

/** 获取排好序的子节点列表 */
final public List<String> getOrderedChildren(String path, boolean watch)
    throws KeeperException, InterruptedException {
  List<String> children = getZooKeeper().getChildren(path, watch);
  Collections.sort(children, new StringCompare());
  return children;
}

3.2   ChildrenBlockingLock.java

在多客户端随机测试时,总爱出现tcp连接卡死的清况 ,无法正常退出。经过加进去去日志跟踪,发现WatchedEvent将会会丢失,也将会会发送给并回会 注册事件的ZooKeeper客户端。在网上搜索,发现可是我人也碰到之类问提。

简单修改了一下ChildrenBlockingLock#isLockSuccess停留信号的代码,从无参数的死等变成设置一定超时时间停留。关键代码如下

protected boolean isLockSuccess() {
  boolean lockSuccess;
  try {
    while (true) {
      String prevElementName = getPrevElementName();
      if (prevElementName == null) {
        log.trace("{} 这麼

更靠前的子节点,加锁成功", elementNodeName);
        lockSuccess = true;
        break;
      } else {
        // 有更小的节点,说明当前节点没抢到锁,注册前一好几个



多多节点的监听。
        log.trace("{} 监控 {} 的事件", elementNodeName, prevElementName);
        getZooKeeper().exists(this.guidNodeName + "/" + prevElementName, true);
        synchronized (mutex) {
          // 停留最多一秒
          mutex.wait(100);
          log.trace("{} 监控的 {} 有子节点变化", elementNodeName, guidNodeName);
        }
      }
    }
  } catch (KeeperException e) {
    lockSuccess = false;
  } catch (InterruptedException e) {
    lockSuccess = false;
  }
  return lockSuccess;
}

3.3   写锁 ZooKeeperWriteLock.java

代码基本是沿用父类,只只能重载getChildPrefix()法律土方式,

/** 返回写锁的前缀 */
protected String getChildPrefix() {
  return "w-lock-";
}

3.4   读锁 ZooKeeperReadLock.java

同写锁相比,除了重载getChildPrefix()法律土方式,还重载了getPrevElementName()用来查找最近一好几个 多多写锁。

/** 返回读锁的前缀 */
protected String getChildPrefix() {
  return "r-lock-";
}

/** 是写锁 */
private boolean isWriteLock(String elementName) {
  return elementName.startsWith(ZooKeeperWriteLock.FLAG);
}

/** 读取前一好几个



多多写锁 */
protected String getPrevElementName() throws KeeperException, InterruptedException {
  List<String> elementNames = super.getOrderedChildren(this.guidNodeName, false);
  super.traceOrderedChildren(this.guidNodeName, elementNames);
  String prevWriteElementName = null;
  for (String oneElementName : elementNames) {
    if (this.elementNodeFullName.endsWith(oneElementName)) {
      // 将会到了当前节点
      break;
    }
    if (isWriteLock(oneElementName)) {
      prevWriteElementName = oneElementName;
    }
  }
  return prevWriteElementName;
}

4      测试用例

测试用例没想到好的判断法律土方式,先要使用assert判断结果,但会 做了复杂化,根据日志输出,靠人眼判断与非 正确。

4.1   测试tcp连接类

分别为都锁和写锁构建了一好几个 多多内部管理类

/** 写锁tcp连接 */
class WriteLockClient extends Thread {
  ZooKeeperWriteLock writeLock;

  public WriteLockClient() {
    try {
      this.writeLock = new ZooKeeperWriteLock(address);
    } catch (IOException e) {
    }
  }

  public void run() {
    writeLock.lock(guidNodeName, this.getName());
    try {
      Thread.sleep(100 + random.nextInt(20) * 100);
    } catch (InterruptedException e) {
    }
    writeLock.release(guidNodeName, this.getName());
  }
}

/** 读锁tcp连接 */
class ReadLockClient extends Thread {
  ZooKeeperReadLock readLock;

  public ReadLockClient() {
    try {
      this.readLock = new ZooKeeperReadLock(address);
    } catch (IOException e) {
    }
  }

public void run() { readLock.lock(guidNodeName, this.getName()); try { Thread.sleep(100 + random.nextInt(20) * 100); } catch (InterruptedException e) { } readLock.release(guidNodeName, this.getName()); try { readLock.getZooKeeper().close(); } catch (InterruptedException e) { } } }

4.2   读-读锁测试

代码

@Test
public void testReadRead() throws IOException, InterruptedException {
  ReadLockClient readLock1 = new ReadLockClient();
  ReadLockClient readLock2 = new ReadLockClient();
  readLock1.start();
  readLock2.start();
  readLock1.join();
  readLock2.join();
}

测试结果回会 看一遍,一好几个 多多读锁并发执行

22:18.861 [Thread-2 INFO] r-lock-0000000000 get read lock : true
22:18.865 [Thread-1 INFO] r-lock-0000000001 get read lock : true
22:20.065 [Thread-2 INFO] r-lock-0000000000 release read lock
22:21.366 [Thread-1 INFO] r-lock-0000000001 release read lock

4.3   读-写锁测试

代码

@Test
public void testReadWrite() throws IOException, InterruptedException {
  ReadLockClient readLock1 = new ReadLockClient();
  WriteLockClient writeLock1 = new WriteLockClient();
  readLock1.start();
  Thread.sleep(100);
  writeLock1.start();
  readLock1.join();
  writeLock1.join();
}

测试结果回会 看一遍,首先获取读锁,释放过后才获取到写锁。

27:40.100 [Thread-1 INFO] r-lock-0000000000 get read lock : true
27:43.310 [Thread-1 INFO] r-lock-0000000000 release read lock
27:43.423 [Thread-2 INFO] w-lock-0000000001 get write lock : true
27:44.423 [Thread-2 INFO] w-lock-0000000001 release write lock

4.4   写-读锁测试

代码

@Test
public void testWriteRead() throws IOException, InterruptedException {
  ReadLockClient readLock1 = new ReadLockClient();
  WriteLockClient writeLock1 = new WriteLockClient();
  writeLock1.start();
  Thread.sleep(100);
  readLock1.start();
  writeLock1.join();
  readLock1.join();
}

测试结果回会 看一遍,首先获取写锁,释放过后才获取到读锁。

29:17.661 [Thread-2 INFO] w-lock-0000000000 get write lock : true
29:19.966 [Thread-2 INFO] w-lock-0000000000 release write lock
29:19.976 [Thread-1 INFO] r-lock-0000000001 get read lock : true
29:22.476 [Thread-1 INFO] r-lock-0000000001 release read lock

4.5   多客户端随机读写锁测试

测试代码

@Test
public void testRandomReadWriteLock() throws IOException, InterruptedException {
  int threadCount = 20;
  Thread[] lockThreads = new Thread[threadCount];
  for (int i = 0; i < threadCount; i++) {
    // 一定概率是写锁
    boolean writeLock = random.nextInt(5) == 0;
    if (writeLock) {
      lockThreads[i] = new WriteLockClient();
    } else {
      lockThreads[i] = new ReadLockClient();
    }
    lockThreads[i].start();
  }
 

  for (int i = 0; i < threadCount; i++) {
    lockThreads[i].join();
  }
}

测试结果回会 看出,将会连续多个读锁会并发执行。为了方便查看,我加进去去了但会 横线分隔。

100:31.317 [Thread-1 INFO] w-lock-0000000000 get write lock : true
100:32.824 [Thread-1 INFO] w-lock-0000000000 release write lock
------------------------------------------------------------------
100:32.834 [Thread-17 INFO] r-lock-0000000004 get read lock : true
100:32.835 [Thread-19 INFO] r-lock-0000000002 get read lock : true
100:32.835 [Thread-20 INFO] r-lock-0000000001 get read lock : true
100:32.836 [Thread-18 INFO] r-lock-0000000003 get read lock : true
100:34.135 [Thread-20 INFO] r-lock-0000000001 release read lock
100:34.634 [Thread-17 INFO] r-lock-0000000004 release read lock
100:34.935 [Thread-19 INFO] r-lock-0000000002 release read lock
100:35.036 [Thread-18 INFO] r-lock-0000000003 release read lock
------------------------------------------------------------------
100:35.053 [Thread-16 INFO] w-lock-0000000005 get write lock : true
100:36.154 [Thread-16 INFO] w-lock-0000000005 release write lock
------------------------------------------------------------------
100:36.1100 [Thread-14 INFO] r-lock-0000000007 get read lock : true
100:36.1100 [Thread-15 INFO] r-lock-0000000006 get read lock : true
100:38.1100 [Thread-14 INFO] r-lock-0000000007 release read lock
100:38.661 [Thread-15 INFO] r-lock-0000000006 release read lock
------------------------------------------------------------------
100:38.669 [Thread-13 INFO] w-lock-0000000008 get write lock : true
100:39.969 [Thread-13 INFO] w-lock-0000000008 release write lock
------------------------------------------------------------------
100:39.976 [Thread-12 INFO] r-lock-0000000009 get read lock : true
100:39.977 [Thread-8 INFO] r-lock-0000000014 get read lock : true
100:39.977 [Thread-6 INFO] r-lock-0000000015 get read lock : true
100:39.984 [Thread-10 INFO] r-lock-0000000011 get read lock : true
100:39.985 [Thread-3 INFO] r-lock-0000000018 get read lock : true
100:39.984 [Thread-7 INFO] r-lock-0000000013 get read lock : true
100:39.984 [Thread-11 INFO] r-lock-0000000010 get read lock : true
100:39.983 [Thread-9 INFO] r-lock-0000000012 get read lock : true
100:39.983 [Thread-2 INFO] r-lock-0000000019 get read lock : true
100:39.982 [Thread-5 INFO] r-lock-0000000016 get read lock : true
100:39.986 [Thread-4 INFO] r-lock-0000000017 get read lock : true
100:40.986 [Thread-3 INFO] r-lock-0000000018 release read lock
100:41.086 [Thread-2 INFO] r-lock-0000000019 release read lock
100:41.285 [Thread-6 INFO] r-lock-0000000015 release read lock
100:41.576 [Thread-12 INFO] r-lock-0000000009 release read lock
100:42.185 [Thread-10 INFO] r-lock-0000000011 release read lock
100:42.186 [Thread-5 INFO] r-lock-0000000016 release read lock
100:42.187 [Thread-11 INFO] r-lock-0000000010 release read lock
100:42.286 [Thread-9 INFO] r-lock-0000000012 release read lock
100:42.586 [Thread-7 INFO] r-lock-0000000013 release read lock
100:42.677 [Thread-8 INFO] r-lock-0000000014 release read lock
100:42.887 [Thread-4 INFO] r-lock-0000000017 release read lock