java里有伪随机型和安全型两种随机数生成器,伪随机生成器根据特定公式将seed转换成新的伪随机数据的一部分,安全随机生成器在底层依赖到操做系统提供的随机事件来生成数据。java
安全随机生成器算法
而伪随机生成器,只依赖于“seed”的初始值,若是给生成算法提供相同的seed,能够获得同样的伪随机序列。通常状况下,因为它是计算密集型的(不依赖于任何IO设备),所以生成速度更快。如下是伪随机生成器的进化史。数组
java.util.Random
自1.0就已经存在,是一个线程安全类,理论上能够经过它同时在多个线程中得到互不相同的随机数,这样的线程安全是经过AtomicLong实现的。
Random使用AtomicLong CAS(compare and set)操做来更新它的seed,尽管在不少非阻塞式算法中使用了非阻塞式原语,CAS在资源高度竞争时的表现依然糟糕,后面的测试结果中能够看到它的糟糕表现。缓存
java.util.concurrent.ThreadLocalRandom
1.7增长该类,企图将它和Random结合以克服全部的性能问题,该类继承自Random。安全
ThreadLocalRandom的主要实现细节:markdown
测试dom
下面进行5种测试:ide
ThreadLocal<Random>
全部的测试都使用封装在RandomTask类里的方法,每一个方案都说明了如何使用随机生成器。函数
import java.util.Random; import java.util.concurrent.CountDownLatch; import java.util.concurrent.ThreadLocalRandom; public class Test_Random { private static final long COUNT = 10000000; private static final int THREADS = 2; public static void main(String[] args) { // TODO Auto-generated method stub System.out.println("Shared Random"); testRandom(THREADS, COUNT); /*System.out.println("ThreadLocal<Random>"); testThreadLocal_Random(THREADS, COUNT); System.out.println("ThreadLocalRandom"); testThreadLocalRandom(THREADS, COUNT); System.out.println("Shared Random[] with no padding"); testRandomArray(THREADS, COUNT, 1); System.out.println("Shared Random[] with padding"); testRandomArray(THREADS, COUNT, 2);*/ } private static class RandomTask implements Runnable { private final Random rnd; protected final int id; private final long cnt; private final CountDownLatch latch; private RandomTask(Random rnd, int id, long cnt, CountDownLatch latch) { super(); this.rnd = rnd; this.id = id; this.cnt = cnt; this.latch = latch; } protected Random getRandom() { return rnd; } @Override public void run() { try { final Random r = getRandom(); latch.countDown(); latch.await(); final long start = System.currentTimeMillis(); int sum = 0; for (long j = 0; j < cnt; j++) { sum += r.nextInt(); } final long time = System.currentTimeMillis() - start; System.out.println("Thread #" + id + " Time = " + time / 1000.0 + " sec, sum = " + sum); } catch (InterruptedException e) {} } } private static void testRandom(final int threads, final long cnt) { final CountDownLatch latch = new CountDownLatch(threads); final Random r = new Random(100); for (int i = 0; i < threads; ++i) { final Thread thread = new Thread(new RandomTask(r, i, cnt, latch)); thread.start(); } } private static void testRandomArray(final int threads, final long cnt, final int padding) { final CountDownLatch latch = new CountDownLatch(threads); final Random[] rnd = new Random[threads * padding]; for (int i = 0; i < threads * padding; ++i) { rnd[i] = new Random(100); } for (int i = 0; i < threads; ++i) { final Thread thread = new Thread(new RandomTask(rnd[i * padding], i, cnt, latch)); thread.start(); } } private static void testThreadLocalRandom(final int threads, final long cnt) { final CountDownLatch latch = new CountDownLatch(threads); for (int i = 0; i < threads; ++i) { final Thread thread = new Thread(new RandomTask(null, i, cnt, latch) { @Override protected Random getRandom() { // TODO Auto-generated method stub return ThreadLocalRandom.current(); } }); thread.start(); } } private static void testThreadLocal_Random(final int threads, final long cnt) { final CountDownLatch latch = new CountDownLatch(threads); final ThreadLocal<Random> rnd = new ThreadLocal<Random>() { @Override protected Random initialValue() { // TODO Auto-generated method stub return new Random(100); } }; for (int i = 0; i < threads; ++i) { final Thread thread = new Thread(new RandomTask(null, i, cnt, latch) { @Override protected Random getRandom() { // TODO Auto-generated method stub return rnd.get(); } }); thread.start(); } } }
总结:post