idworker java_分布式唯一ID生成器Twitter 的 Snowflake idworker java版本

importjava.lang.management.ManagementFactory;

importjava.net.InetAddress;

importjava.net.NetworkInterface;

/***

名称:IdWorker.java

*

描述:分布式自增长ID

*
*     Twitter的SnowflakeJAVA实现方案*
*核心代码为其IdWorker这个类实现,其原理结构如下,我分别用一个0表示一位,用—分割开部分的作用:* 1||0---0000000000 0000000000 0000000000 0000000000 0 --- 00000 ---00000 ---000000000000*在上面的字符串中,第一位为未使用(实际上也可作为long的符号位),接下来的41位为毫秒级时间,*然后5位datacenter标识位,5位机器ID(并不算标识符,实际是为线程标识),*然后12位该毫秒内的当前毫秒内的计数,加起来刚好64位,为一个Long型。*这样的好处是,整体上按照时间自增排序,并且整个分布式系统内不会产生ID碰撞(由datacenter和机器ID作区分),*并且效率较高,经测试,snowflake每秒能够产生26万ID左右,完全满足需要。*

* 64位ID (42(毫秒)+5(机器ID)+5(业务编码)+12(重复累加))**@authorPolim*/public classIdWorker {

//时间起始标记点,作为基准,一般取系统的最近时间(一旦确定不能变动)private final static longtwepoch= 1288834974657L;

//机器标识位数private final static longworkerIdBits= 5L;

//数据中心标识位数private final static longdatacenterIdBits= 5L;

//机器ID最大值private final static longmaxWorkerId= -1L ^ (-1L << workerIdBits);

//数据中心ID最大值private final static longmaxDatacenterId= -1L ^ (-1L << datacenterIdBits);

//毫秒内自增位private final static longsequenceBits= 12L;

//机器ID偏左移12位private final static longworkerIdShift= sequenceBits;

//数据中心ID左移17位private final static longdatacenterIdShift= sequenceBits+ workerIdBits;

//时间毫秒左移22位private final static longtimestampLeftShift= sequenceBits+ workerIdBits+ datacenterIdBits;

private final static longsequenceMask= -1L ^ (-1L << sequenceBits);

/*上次生产id时间戳*/private static longlastTimestamp= -1L;

// 0,并发控制private longsequence= 0L;

private final longworkerId;

//数据标识id部分private final longdatacenterId;

publicIdWorker(){

this.datacenterId= getDatacenterId(maxDatacenterId);

this.workerId= getMaxWorkerId(datacenterId, maxWorkerId);

}

/***@paramworkerId*工作机器ID*@paramdatacenterId*序列号*/publicIdWorker(longworkerId, longdatacenterId) {

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

throw newIllegalArgumentException(String.format("worker Id can't be greater than %d or less than 0", maxWorkerId));

}

if(datacenterId > maxDatacenterId|| datacenterId < 0) {

throw newIllegalArgumentException(String.format("datacenter Id can't be greater than %d or less than 0", maxDatacenterId));

}

this.workerId= workerId;

this.datacenterId= datacenterId;

}

/***获取下一个ID**@return*/public synchronized longnextId() {

longtimestamp = timeGen();

if(timestamp < lastTimestamp) {

throw newRuntimeException(String.format("Clock moved backwards. Refusing to generate id for %d milliseconds", lastTimestamp- timestamp));

}

if(lastTimestamp== timestamp) {

//当前毫秒内,则+1sequence= (sequence+ 1) & sequenceMask;

if(sequence== 0) {

//当前毫秒内计数满了,则等待下一秒timestamp = tilNextMillis(lastTimestamp);

}

} else{

sequence= 0L;

}

lastTimestamp= timestamp;

// ID偏移组合生成最终的ID,并返回IDlongnextId = ((timestamp - twepoch) << timestampLeftShift)

| (datacenterId<< datacenterIdShift)

| (workerId<< workerIdShift) | sequence;

returnnextId;

}

private longtilNextMillis(final longlastTimestamp) {

longtimestamp = this.timeGen();

while(timestamp <= lastTimestamp) {

timestamp = this.timeGen();

}

returntimestamp;

}

private longtimeGen() {

returnSystem.currentTimeMillis();

}

/***

*获取maxWorkerId*

*/protected static longgetMaxWorkerId(longdatacenterId, longmaxWorkerId) {

StringBuffer mpid = newStringBuffer();

mpid.append(datacenterId);

String name = ManagementFactory.getRuntimeMXBean().getName();

if(!name.isEmpty()) {

/** GET jvmPid*/mpid.append(name.split("@")[0]);

}

/** MAC + PID的hashcode获取16个低位*/return(mpid.toString().hashCode() & 0xffff) % (maxWorkerId + 1);

}

/***

*数据标识id部分*

*/protected static longgetDatacenterId(longmaxDatacenterId) {

longid = 0L;

try{

InetAddress ip = InetAddress.getLocalHost();

NetworkInterface network = NetworkInterface.getByInetAddress(ip);

if(network == null) {

id = 1L;

} else{

byte[] mac = network.getHardwareAddress();

id = ((0x000000FF & (long) mac[mac.length- 1])

| (0x0000FF00 & (((long) mac[mac.length- 2]) << 8))) >> 6;

id = id % (maxDatacenterId + 1);

}

} catch(Exception e) {

System.out.println(" getDatacenterId: "+ e.getMessage());

}

returnid;

}

public static voidmain(String[] args) {

IdWorker idWorker = newIdWorker(31,31);

System.out.println("idWorker="+idWorker.nextId());

IdWorker id = newIdWorker();

System.out.println("id="+id.nextId());

System.out.println(id.datacenterId);

System.out.println(id.workerId);

}

}

高并发分布式系统中生成全局唯一Id汇总 数据在分片时,典型的是分库分表,就有一个全局ID生成的问题。 单纯的生成全局ID并不是什么难题,但是生成的ID通常要满足分片的一些要求: 1 不能有单点故障。 2 以时间为序,或者ID里包含时间。这样一是可以少一个索引,二是冷热数据容易分离。 3 可以控制ShardingId。比如某一个用户的文章要放在同一个分片内,这样查询效率高,修改也容易。 4 不要太长,最好64bit。使用long比较好操作,如果是96bit,那就要各种移位相当的不方便,还有可能有些组件不能支持这么大的ID。 一 twitter twitter在把存储系统从MySQL迁移到Cassandra的过程中由于Cassandra没有顺序ID生成机制,于是自己开发了一套全局唯一ID生成服务:Snowflake。 1 41位的时间序列(精确到毫秒,41位的长度可以使用69年) 2 10位的机器标识(10位的长度最多支持部署1024个节点) 3 12位的计数顺序号(12位的计数顺序号支持每个节点每毫秒产生4096个ID序号) 最高位是符号位,始终为0。 优点:高性能,低延迟;独立的应用;按时间有序。 缺点:需要独立的开发和部署。 原理 java 实现代码 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 public class IdWorker { private final long workerId; private final static long twepoch = 1288834974657L; 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 < 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()); } }
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

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

抵扣说明:

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

余额充值