test/loops/CollectionLoops.java

/*
 * Written by Doug Lea with assistance from members of JCP JSR-166
 * Expert Group and released to the public domain, as explained at
 * http://creativecommons.org/publicdomain/zero/1.0/
 */

import java.util.*;
import java.util.concurrent.*;

public class CollectionLoops {
    static int pinsert     = 100;
    static int premove     = 1;
    static int maxThreads  = 48;
    static int removesPerMaxRandom;
    static int insertsPerMaxRandom;
    static volatile int checkSum = 0;
    static boolean print = false;

    static final ExecutorService pool = Executors.newCachedThreadPool();

    public static void main(String[] args) throws Exception {
        int nkeys       = 10000;
        int nops        = 100000;

        Class<?> collectionClass = null;
        if (args.length > 0) {
            try {
                collectionClass = Class.forName(args[0]);
            } catch (ClassNotFoundException e) {
                throw new RuntimeException("Class " + args[0] + " not found.");
            }
        }

        if (args.length > 1)
            maxThreads = Integer.parseInt(args[1]);

        if (args.length > 2)
            nkeys = Integer.parseInt(args[2]);

        if (args.length > 3)
            pinsert = Integer.parseInt(args[3]);

        if (args.length > 4)
            premove = Integer.parseInt(args[4]);

        if (args.length > 5)
            nops = Integer.parseInt(args[5]);

        // normalize probabilities wrt random number generator
        removesPerMaxRandom = (int)(((double)premove/100.0 * 0x7FFFFFFFL));
        insertsPerMaxRandom = (int)(((double)pinsert/100.0 * 0x7FFFFFFFL));

        System.out.print("Class: " + collectionClass.getName());
        System.out.print(" threads: " + maxThreads);
        System.out.print(" size: " + nkeys);
        System.out.print(" ins: " + pinsert);
        System.out.print(" rem: " + premove);
        System.out.print(" ops: " + nops);
        System.out.println();

        // warmup
        test(1, 100, 100, collectionClass);
        test(2, 100, 100, collectionClass);
        test(4, 100, 100, collectionClass);
        print = true;

        int warmups = 2;
        for (int k = 1, i = 1; i <= maxThreads;) {
            Thread.sleep(100);
            test(i, nkeys, nops, collectionClass);
            if (warmups > 0)
                --warmups;
            else if (i == k) {
                k = i << 1;
                i = i + (i >>> 1);
            }
            else if (i == 1 && k == 2) {
                i = k;
                warmups = 1;
            }
            else
                i = k;
        }
        pool.shutdown();
    }

    static Integer[] makeKeys(int n) {
        LoopHelpers.SimpleRandom rng = new LoopHelpers.SimpleRandom();
        Integer[] key = new Integer[n];
        for (int i = 0; i < key.length; ++i)
            key[i] = new Integer(rng.next());
        return key;
    }

    static void shuffleKeys(Integer[] key) {
        Random rng = new Random();
        for (int i = key.length; i > 1; --i) {
            int j = rng.nextInt(i);
            Integer tmp = key[j];
            key[j] = key[i-1];
            key[i-1] = tmp;
        }
    }

    static void test(int i, int nk, int nops, Class<?> collectionClass) throws Exception {
        if (print)
            System.out.print("Threads: " + i + "\t:");
        Collection<Integer> collection = (Collection<Integer>)collectionClass.newInstance();
        Integer[] key = makeKeys(nk);
        // Uncomment to start with a non-empty table
        for (int j = 0; j < nk; j += 2)
            collection.add(key[j]);
        shuffleKeys(key);
        LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
        CyclicBarrier barrier = new CyclicBarrier(i+1, timer);
        for (int t = 0; t < i; ++t)
            pool.execute(new Runner(t, collection, key, barrier, nops));
        barrier.await();
        barrier.await();
        long time = timer.getTime();
        long tpo = time / (i * (long) nops);
        if (print)
            System.out.print(LoopHelpers.rightJustify(tpo) + " ns per op");
        double secs = (double) time / 1000000000.0;
        if (print)
            System.out.print("\t " + secs + "s run time");
        if (checkSum == 0) System.out.print(" ");
        if (print)
            System.out.println();
        collection.clear();
    }

    static class Runner implements Runnable {
        final Collection<Integer> collection;
        final Integer[] key;
        final LoopHelpers.SimpleRandom rng;
        final CyclicBarrier barrier;
        int position;
        int total;
        int nops;

        Runner(int id, Collection<Integer> collection, Integer[] key, CyclicBarrier barrier, int nops) {
            this.collection = collection;
            this.key = key;
            this.barrier = barrier;
            this.nops = nops;
            position = key.length / (id + 1);
            rng = new LoopHelpers.SimpleRandom((id + 1) * 8862213513L);
            rng.next();
        }

        public void run() {
            try {
                barrier.await();
                int p = position;
                int ops = nops;
                Collection<Integer> c = collection;
                while (ops > 0) {
                    int r = rng.next();
                    p += (r & 7) - 3;
                    while (p >= key.length) p -= key.length;
                    while (p < 0) p += key.length;

                    Integer k = key[p];
                    if (c.contains(k)) {
                        if (r < removesPerMaxRandom) {
                            if (c.remove(k)) {
                                p = Math.abs(total % key.length);
                                ops -= 2;
                                continue;
                            }
                        }
                    }
                    else if (r < insertsPerMaxRandom) {
                        ++p;
                        ops -= 2;
                        c.add(k);
                        continue;
                    }

                    total += LoopHelpers.compute6(k.intValue());
                    --ops;
                }
                checkSum += total;
                barrier.await();
            }
            catch (Exception ex) {
                throw new RuntimeException(ex);
            }
        }
    }
}
Revision:	1.10
Committed:	Thu Jan 15 18:34:18 2015 UTC (9 years, 4 months ago) by jsr166
Branch:	MAIN
Changes since 1.9:	+0 -1 lines
Log Message:	delete extraneous blank lines
#	User	Rev	Content
1	dl	1.1	/*
2			* Written by Doug Lea with assistance from members of JCP JSR-166
3	dl	1.2	* Expert Group and released to the public domain, as explained at
4	jsr166	1.6	* http://creativecommons.org/publicdomain/zero/1.0/
5	dl	1.1	*/
6
7			import java.util.*;
8			import java.util.concurrent.*;
9
10			public class CollectionLoops {
11			static int pinsert = 100;
12			static int premove = 1;
13			static int maxThreads = 48;
14			static int removesPerMaxRandom;
15			static int insertsPerMaxRandom;
16			static volatile int checkSum = 0;
17			static boolean print = false;
18
19			static final ExecutorService pool = Executors.newCachedThreadPool();
20
21			public static void main(String[] args) throws Exception {
22			int nkeys = 10000;
23			int nops = 100000;
24
25	jsr166	1.9	Class<?> collectionClass = null;
26	dl	1.1	if (args.length > 0) {
27			try {
28			collectionClass = Class.forName(args[0]);
29	jsr166	1.4	} catch (ClassNotFoundException e) {
30	dl	1.1	throw new RuntimeException("Class " + args[0] + " not found.");
31			}
32			}
33
34	jsr166	1.3	if (args.length > 1)
35	dl	1.1	maxThreads = Integer.parseInt(args[1]);
36
37	jsr166	1.3	if (args.length > 2)
38	dl	1.1	nkeys = Integer.parseInt(args[2]);
39
40	jsr166	1.3	if (args.length > 3)
41	dl	1.1	pinsert = Integer.parseInt(args[3]);
42
43	jsr166	1.3	if (args.length > 4)
44	dl	1.1	premove = Integer.parseInt(args[4]);
45
46	jsr166	1.3	if (args.length > 5)
47	dl	1.1	nops = Integer.parseInt(args[5]);
48
49			// normalize probabilities wrt random number generator
50			removesPerMaxRandom = (int)(((double)premove/100.0 * 0x7FFFFFFFL));
51			insertsPerMaxRandom = (int)(((double)pinsert/100.0 * 0x7FFFFFFFL));
52	jsr166	1.3
53	dl	1.1	System.out.print("Class: " + collectionClass.getName());
54			System.out.print(" threads: " + maxThreads);
55			System.out.print(" size: " + nkeys);
56			System.out.print(" ins: " + pinsert);
57			System.out.print(" rem: " + premove);
58			System.out.print(" ops: " + nops);
59			System.out.println();
60
61			// warmup
62			test(1, 100, 100, collectionClass);
63			test(2, 100, 100, collectionClass);
64			test(4, 100, 100, collectionClass);
65			print = true;
66
67			int warmups = 2;
68	jsr166	1.8	for (int k = 1, i = 1; i <= maxThreads;) {
69	dl	1.1	Thread.sleep(100);
70			test(i, nkeys, nops, collectionClass);
71			if (warmups > 0)
72			--warmups;
73			else if (i == k) {
74			k = i << 1;
75			i = i + (i >>> 1);
76	jsr166	1.3	}
77	dl	1.1	else if (i == 1 && k == 2) {
78			i = k;
79			warmups = 1;
80			}
81	jsr166	1.3	else
82	dl	1.1	i = k;
83			}
84			pool.shutdown();
85			}
86
87			static Integer[] makeKeys(int n) {
88			LoopHelpers.SimpleRandom rng = new LoopHelpers.SimpleRandom();
89			Integer[] key = new Integer[n];
90	jsr166	1.3	for (int i = 0; i < key.length; ++i)
91	dl	1.1	key[i] = new Integer(rng.next());
92			return key;
93			}
94
95			static void shuffleKeys(Integer[] key) {
96			Random rng = new Random();
97			for (int i = key.length; i > 1; --i) {
98			int j = rng.nextInt(i);
99			Integer tmp = key[j];
100			key[j] = key[i-1];
101			key[i-1] = tmp;
102			}
103			}
104
105	jsr166	1.9	static void test(int i, int nk, int nops, Class<?> collectionClass) throws Exception {
106	dl	1.1	if (print)
107			System.out.print("Threads: " + i + "\t:");
108			Collection<Integer> collection = (Collection<Integer>)collectionClass.newInstance();
109			Integer[] key = makeKeys(nk);
110			// Uncomment to start with a non-empty table
111	jsr166	1.3	for (int j = 0; j < nk; j += 2)
112	dl	1.1	collection.add(key[j]);
113			shuffleKeys(key);
114			LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
115			CyclicBarrier barrier = new CyclicBarrier(i+1, timer);
116	jsr166	1.3	for (int t = 0; t < i; ++t)
117	dl	1.1	pool.execute(new Runner(t, collection, key, barrier, nops));
118			barrier.await();
119			barrier.await();
120			long time = timer.getTime();
121	jsr166	1.5	long tpo = time / (i * (long) nops);
122	dl	1.1	if (print)
123			System.out.print(LoopHelpers.rightJustify(tpo) + " ns per op");
124	jsr166	1.5	double secs = (double) time / 1000000000.0;
125	dl	1.1	if (print)
126			System.out.print("\t " + secs + "s run time");
127			if (checkSum == 0) System.out.print(" ");
128			if (print)
129			System.out.println();
130			collection.clear();
131			}
132
133			static class Runner implements Runnable {
134			final Collection<Integer> collection;
135			final Integer[] key;
136			final LoopHelpers.SimpleRandom rng;
137			final CyclicBarrier barrier;
138			int position;
139			int total;
140			int nops;
141
142	jsr166	1.7	Runner(int id, Collection<Integer> collection, Integer[] key, CyclicBarrier barrier, int nops) {
143	jsr166	1.3	this.collection = collection;
144			this.key = key;
145	dl	1.1	this.barrier = barrier;
146			this.nops = nops;
147	jsr166	1.3	position = key.length / (id + 1);
148	dl	1.1	rng = new LoopHelpers.SimpleRandom((id + 1) * 8862213513L);
149			rng.next();
150			}
151
152			public void run() {
153			try {
154			barrier.await();
155			int p = position;
156			int ops = nops;
157			Collection<Integer> c = collection;
158			while (ops > 0) {
159			int r = rng.next();
160			p += (r & 7) - 3;
161	jsr166	1.3	while (p >= key.length) p -= key.length;
162	dl	1.1	while (p < 0) p += key.length;
163
164			Integer k = key[p];
165			if (c.contains(k)) {
166			if (r < removesPerMaxRandom) {
167			if (c.remove(k)) {
168	jsr166	1.3	p = Math.abs(total % key.length);
169	dl	1.1	ops -= 2;
170			continue;
171			}
172			}
173			}
174			else if (r < insertsPerMaxRandom) {
175			++p;
176			ops -= 2;
177			c.add(k);
178			continue;
179	jsr166	1.3	}
180
181	dl	1.1	total += LoopHelpers.compute6(k.intValue());
182			--ops;
183			}
184			checkSum += total;
185			barrier.await();
186			}
187			catch (Exception ex) {
188			throw new RuntimeException(ex);
189			}
190			}
191			}
192			}