java creat uid_UidGenerator是Java实现的, 基于Snowflake算法的唯一ID生成器

UidGenerator

UidGenerator is a Java implemented, Snowflake based unique ID generator. It works as a component, and allows users to override workId bits and initialization strategy. As a result, it is much more suitable for virtualization environment, such as docker. Besides these, it overcomes concurrency limitation of Snowflake algorithm by consuming future time; parallels UID produce and consume by caching UID with RingBuffer; eliminates CacheLine pseudo sharing, which comes from RingBuffer, via padding. And finally, it can offer over 6 million QPS per single instance.

Requires：Java8+, MySQL(Default implement as WorkerID assigner; If there are other implements, MySQL is not required)

Snowflake

** Snowflake algorithm：** An unique id consists of worker node, timestamp and sequence within that timestamp. Usually, it is a 64 bits number(long), and the default bits of that three fields are as follows:

sign(1bit)

The highest bit is always 0.

delta seconds (28 bits)

The next 28 bits, represents delta seconds since a customer epoch(2016-05-20). The maximum time will be 8.7 years.

worker id (22 bits)

The next 22 bits, represents the worker node id, maximum value will be 4.2 million. UidGenerator uses a build-in database based worker id assigner when startup by default, and it will dispose previous work node id after reboot. Other strategy such like 'reuse' is coming soon.

sequence (13 bits)

the last 13 bits, represents sequence within the one second, maximum is 8192 per second by default.

The parameters above can be configured in spring bean

CachedUidGenerator

RingBuffer is an array，each item of that array is called 'slot', every slot keeps a uid or a flag(Double RingBuffer). The size of RingBuffer is 2^n, where n is positive integer and equal or greater than bits of sequence. Assign bigger value to boostPower if you want to enlarge RingBuffer to improve throughput.

Tail & Cursor pointer

Tail Pointer

Represents the latest produced UID. If it catches up with cursor, the ring buffer will be full, at that moment, no put operation should be allowed, you can specify a policy to handle it by assigning property rejectedPutBufferHandler.

Cursor Pointer

Represents the latest already consumed UID. If cursor catches up with tail, the ring buffer will be empty, and any take operation will be rejected. you can also specify a policy to handle it by assigning property rejectedTakeBufferHandler.

CachedUidGenerator used double RingBuffer，one RingBuffer for UID, another for status(if valid for take or put)

Array can improve performance of reading, due to the CUP cache mechanism. At the same time, it brought the side effect of 「False Sharing」, in order to solve it, cache line padding is applied.

RingBuffer filling

Initialization padding During RingBuffer initializing，the entire RingBuffer will be filled.

In-time filling Whenever the percent of available UIDs is less than threshold paddingFactor, the fill task is triggered. You can reassign that threshold in Spring bean configuration.

Periodic filling Filling periodically in a scheduled thread. ThescheduleInterval can be reassigned in Spring bean configuration.

Quick Start

Here we have a demo with 4 steps to introduce how to integrate UidGenerator into Spring based projects.

Step 1: Install Java8, Maven, MySQL

If you have already installed maven, jdk8+ and Mysql or other DB which supported by Mybatis, just skip to next.

Download Java8, MySQL and Maven, and install jdk, mysql. For maven, extracting and setting MAVEN_HOME is enough.

Set JAVA_HOME & MAVEN_HOME

Here is a sample script to set JAVA_HOME and MAVEN_HOME

export MAVEN_HOME=/xxx/xxx/software/maven/apache-maven-3.3.9

export PATH=$MAVEN_HOME/bin:$PATH

JAVA_HOME="/Library/Java/JavaVirtualMachines/jdk1.8.0_91.jdk/Contents/Home";

export JAVA_HOME;

Step 2: Create table WORKER_NODE

Replace xxxxx with real database name, and run following script to create table,

DROP DATABASE IF EXISTS `xxxx`;

CREATE DATABASE `xxxx` ;

use `xxxx`;

DROP TABLE IF EXISTS WORKER_NODE;

CREATE TABLE WORKER_NODE

(

ID BIGINT NOT NULL AUTO_INCREMENT COMMENT 'auto increment id',

HOST_NAME VARCHAR(64) NOT NULL COMMENT 'host name',

PORT VARCHAR(64) NOT NULL COMMENT 'port',

TYPE INT NOT NULL COMMENT 'node type: ACTUAL or CONTAINER',

LAUNCH_DATE DATE NOT NULL COMMENT 'launch date',

MODIFIED TIMESTAMP NOT NULL COMMENT 'modified time',

CREATED TIMESTAMP NOT NULL COMMENT 'created time',

PRIMARY KEY(ID)

)

COMMENT='DB WorkerID Assigner for UID Generator',ENGINE = INNODB;

Reset property of 'jdbc.url', 'jdbc.username' and 'jdbc.password' in mysql.properties.

Step 3: Spring configuration

DefaultUidGenerator

There are two implements of UidGenerator: DefaultUidGenerator, CachedUidGenerator.

For performance sensitive application, CachedUidGenerator is recommended.

CachedUidGenerator

Copy beans of CachedUidGenerator to 'test/resources/uid/cached-uid-spring.xml'.

Mybatis config

Step 4: Run UnitTest

Run CachedUidGeneratorTest, shows how to generate / parse UniqueID:

@Resource

private UidGenerator uidGenerator;

@Test

public void testSerialGenerate() {

// Generate UID

long uid = uidGenerator.getUID();

// Parse UID into [Timestamp, WorkerId, Sequence]

// {"UID":"180363646902239241","parsed":{ "timestamp":"2017-01-19 12:15:46", "workerId":"4", "sequence":"9" }}

System.out.println(uidGenerator.parseUID(uid));

}

Tips

For low concurrency and long term application, less seqBits but more timeBits is recommended. For example, if DisposableWorkerIdAssigner is adopted and the average reboot frequency is 12 per node per day, with the configuration {"workerBits":23,"timeBits":31,"seqBits":9}, one project can run for 68 years with 28 nodes and entirely concurrency 14400 UID/s.

For frequent reboot and long term application, less seqBits but more timeBits and workerBits is recommended. For example, if DisposableWorkerIdAssigner is adopted and the average reboot frequency is 24 * 12 per node per day, with the configuration {"workerBits":27,"timeBits":30,"seqBits":6}, one project can run for 34 years with 37 nodes and entirely concurrency 2400 UID/s.

Experiment for Throughput

To figure out CachedUidGenerator's UID throughput, some experiments are carried out.

Firstly, workerBits is arbitrarily fixed to 20, and change timeBits from 25(about 1 year) to 32(about 136 years),

timeBits

25

26

27

28

29

30

31

32

throughput

6,831,465

7,007,279

6,679,625

6,499,205

6,534,971

7,617,440

6,186,930

6,364,997

Then, timeBits is arbitrarily fixed to 31, and workerBits is changed from 20(about 1 million total reboots) to 29(about 500 million total reboots),

workerBits

20

21

22

23

24

25

26

27

28

29

throughput

6,186,930

6,642,727

6,581,661

6,462,726

6,774,609

6,414,906

6,806,266

6,223,617

6,438,055

6,435,549

It is obvious that whatever the configuration is, CachedUidGenerator always has the ability to provide 6 million stable throughput, what sacrificed is just life expectancy, this is very cool.

Finally, both timeBits and workerBits are fixed to 31 and 23 separately, and change the number of CachedUidGenerator consumer. Since our CPU only has 4 cores, [1, 8] is chosen.

consumers

1

2

3

4

5

6

7

8

throughput

6,462,726

6,542,259

6,077,717

6,377,958

7,002,410

6,599,113

7,360,934

6,490,969