java 自增id算法,Twitter的分布式自增ID算法snowflake (Java版)

概述

分布式系統中，有一些需要使用全局唯一ID的場景，這種時候為了防止ID沖突可以使用36位的UUID，但是UUID有一些缺點，首先他相對比較長，另外UUID一般是無序的。

有些時候我們希望能使用一種簡單一些的ID，並且希望ID能夠按照時間有序生成。

而twitter的snowflake解決了這種需求，最初Twitter把存儲系統從MySQL遷移到Cassandra，因為Cassandra沒有順序ID生成機制，所以開發了這樣一套全局唯一ID生成服務。

結構

snowflake的結構如下(每部分用-分開):

0 - 0000000000 0000000000 0000000000 0000000000 0 - 00000 - 00000 - 000000000000

第一位為未使用，接下來的41位為毫秒級時間(41位的長度可以使用69年)，然后是5位datacenterId和5位workerId(10位的長度最多支持部署1024個節點) ，最后12位是毫秒內的計數(12位的計數順序號支持每個節點每毫秒產生4096個ID序號)

一共加起來剛好64位，為一個Long型。(轉換成字符串長度為18)

snowflake生成的ID整體上按照時間自增排序，並且整個分布式系統內不會產生ID碰撞(由datacenter和workerId作區分)，並且效率較高。據說：snowflake每秒能夠產生26萬個ID。

源碼

(JAVA版本的源碼)

(JAVA版本2的源碼)

private final long workerId;

private final static long twepoch = 1361753741828L;

private long sequence = 0L;

private final static long workerIdBits = 4L;

public final static long maxWorkerId = -1L ^ -1L << workerIdBits;

private final static long sequenceBits = 10L;

private final static long workerIdShift = sequenceBits;

private final static long timestampLeftShift = sequenceBits + workerIdBits;

public final static long sequenceMask = -1L ^ -1L << sequenceBits;

private long lastTimestamp = -1L;

public IdWorker(final long workerId) {

super();

if (workerId > this.maxWorkerId || workerId < 0) {

throw new IllegalArgumentException(String.format(

"worker Id can't be greater than %d or less than 0",

this.maxWorkerId));

}

this.workerId = workerId;

}

public synchronized long nextId() {

long timestamp = this.timeGen();

if (this.lastTimestamp == timestamp) {

this.sequence = (this.sequence + 1) & this.sequenceMask;

if (this.sequence == 0) {

System.out.println("###########" + sequenceMask);

timestamp = this.tilNextMillis(this.lastTimestamp);

}

} else {

this.sequence = 0;

}

if (timestamp < this.lastTimestamp) {

try {

throw new Exception(

String.format(

"Clock moved backwards.  Refusing to generate id for %d milliseconds",

this.lastTimestamp - timestamp));

} catch (Exception e) {

e.printStackTrace();

}

}

this.lastTimestamp = timestamp;

long nextId = ((timestamp - twepoch << timestampLeftShift))

| (this.workerId << this.workerIdShift) | (this.sequence);

//  System.out.println("timestamp:" + timestamp + ",timestampLeftShift:"

//   + timestampLeftShift + ",nextId:" + nextId + ",workerId:"

//   + workerId + ",sequence:" + sequence);

return nextId;

}

private long tilNextMillis(final long lastTimestamp) {

long timestamp = this.timeGen();

while (timestamp <= lastTimestamp) {

timestamp = this.timeGen();

}

return timestamp;

}

private long timeGen() {

return System.currentTimeMillis();

}

public static void main(String[] args){

IdWorker worker2 = new IdWorker(2);

System.out.println(worker2.nextId());

}

}

參考