test/loops/MapLoops.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 MapLoops {
    static int nkeys       = 1000;
    static int pinsert     = 60;
    static int premove     = 2;
    static int maxThreads  = 100;
    static int nops        = 1000000;
    static int removesPerMaxRandom;
    static int insertsPerMaxRandom;

    static final ExecutorService pool = Executors.newCachedThreadPool();

    public static void main(String[] args) throws Exception {

        Class<?> mapClass = null;
        if (args.length > 0) {
            try {
                mapClass = Class.forName(args[0]);
            } catch (ClassNotFoundException e) {
                throw new RuntimeException("Class " + args[0] + " not found.");
            }
        }
        else
            mapClass = java.util.concurrent.ConcurrentHashMap.class;

        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]);

        if (nops < nkeys)
            nops = nkeys;

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

        System.out.print("Class: " + mapClass.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();

        int warmups = 2;
        for (int reps = 0; reps < 3; ++reps) {
            int k = 1;
            for (int i = 1; i <= maxThreads;) {
                Thread.sleep(100);
                test(i, nkeys, mapClass);
                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 nkeys, Class<?> mapClass) throws Exception {
        System.out.print("Threads: " + i + "\t:");
        Map<Integer, Integer> map =
            (Map<Integer,Integer>) mapClass.getConstructor().newInstance();
        Integer[] key = makeKeys(nkeys);
        // Uncomment to start with a non-empty table
        //        for (int j = 0; j < nkeys; j += 4) // start 1/4 occupied
        //            map.put(key[j], 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, map, key, barrier));
        barrier.await();
        barrier.await();
        long time = timer.getTime();
        long tpo = time / (i * (long) nops);
        System.out.print(LoopHelpers.rightJustify(tpo) + " ns per op");
        double secs = (double) time / 1000000000.0;
        System.out.println("\t " + secs + "s run time");
        map.clear();
    }

    static class Runner implements Runnable {
        final Map<Integer,Integer> map;
        final Integer[] key;
        final LoopHelpers.SimpleRandom rng;
        final CyclicBarrier barrier;
        int position;
        int total;

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

        int step() {
            // random-walk around key positions, bunching accesses
            int r = rng.next();
            position += (r & 7) - 3;
            while (position >= key.length) position -= key.length;
            while (position < 0) position += key.length;

            Integer k = key[position];
            Integer x = map.get(k);

            if (x != null) {
                if (x.intValue() != k.intValue())
                    throw new Error("bad mapping: " + x + " to " + k);

                if (r < removesPerMaxRandom) {
                    if (map.remove(k) != null) {
                        position = total % key.length; // move from position
                        return 2;
                    }
                }
            }
            else if (r < insertsPerMaxRandom) {
                ++position;
                map.putIfAbsent(k, k);
                return 2;
            }

            // Uncomment to add a little computation between accesses
            //            total += LoopHelpers.compute1(k.intValue());
            total += r;
            return 1;
        }

        public void run() {
            try {
                barrier.await();
                int ops = nops;
                while (ops > 0)
                    ops -= step();
                barrier.await();
            }
            catch (Exception ex) {
                ex.printStackTrace();
            }
        }
    }
}
Revision:	1.13
Committed:	Sun Oct 23 03:03:23 2016 UTC (7 years, 6 months ago) by jsr166
Branch:	MAIN
CVS Tags:	HEAD
Changes since 1.12:	+2 -1 lines
Log Message:	fix deprecation warnings for Class#newInstance
#	Content
1	/*
2	* Written by Doug Lea with assistance from members of JCP JSR-166
3	* Expert Group and released to the public domain, as explained at
4	* http://creativecommons.org/publicdomain/zero/1.0/
5	*/
6
7	import java.util.*;
8	import java.util.concurrent.*;
9
10	public class MapLoops {
11	static int nkeys = 1000;
12	static int pinsert = 60;
13	static int premove = 2;
14	static int maxThreads = 100;
15	static int nops = 1000000;
16	static int removesPerMaxRandom;
17	static int insertsPerMaxRandom;
18
19	static final ExecutorService pool = Executors.newCachedThreadPool();
20
21	public static void main(String[] args) throws Exception {
22
23	Class<?> mapClass = null;
24	if (args.length > 0) {
25	try {
26	mapClass = Class.forName(args[0]);
27	} catch (ClassNotFoundException e) {
28	throw new RuntimeException("Class " + args[0] + " not found.");
29	}
30	}
31	else
32	mapClass = java.util.concurrent.ConcurrentHashMap.class;
33
34	if (args.length > 1)
35	maxThreads = Integer.parseInt(args[1]);
36
37	if (args.length > 2)
38	nkeys = Integer.parseInt(args[2]);
39
40	if (args.length > 3)
41	pinsert = Integer.parseInt(args[3]);
42
43	if (args.length > 4)
44	premove = Integer.parseInt(args[4]);
45
46	if (args.length > 5)
47	nops = Integer.parseInt(args[5]);
48
49	if (nops < nkeys)
50	nops = nkeys;
51
52	// normalize probabilities wrt random number generator
53	removesPerMaxRandom = (int)(((double)premove/100.0 * 0x7FFFFFFFL));
54	insertsPerMaxRandom = (int)(((double)pinsert/100.0 * 0x7FFFFFFFL));
55
56	System.out.print("Class: " + mapClass.getName());
57	System.out.print(" threads: " + maxThreads);
58	System.out.print(" size: " + nkeys);
59	System.out.print(" ins: " + pinsert);
60	System.out.print(" rem: " + premove);
61	System.out.print(" ops: " + nops);
62	System.out.println();
63
64	int warmups = 2;
65	for (int reps = 0; reps < 3; ++reps) {
66	int k = 1;
67	for (int i = 1; i <= maxThreads;) {
68	Thread.sleep(100);
69	test(i, nkeys, mapClass);
70	if (warmups > 0)
71	--warmups;
72	else if (i == k) {
73	k = i << 1;
74	i = i + (i >>> 1);
75	}
76	else if (i == 1 && k == 2) {
77	i = k;
78	warmups = 1;
79	}
80	else
81	i = k;
82	}
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	for (int i = 0; i < key.length; ++i)
91	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	static void test(int i, int nkeys, Class<?> mapClass) throws Exception {
106	System.out.print("Threads: " + i + "\t:");
107	Map<Integer, Integer> map =
108	(Map<Integer,Integer>) mapClass.getConstructor().newInstance();
109	Integer[] key = makeKeys(nkeys);
110	// Uncomment to start with a non-empty table
111	// for (int j = 0; j < nkeys; j += 4) // start 1/4 occupied
112	// map.put(key[j], key[j]);
113	shuffleKeys(key);
114	LoopHelpers.BarrierTimer timer = new LoopHelpers.BarrierTimer();
115	CyclicBarrier barrier = new CyclicBarrier(i+1, timer);
116	for (int t = 0; t < i; ++t)
117	pool.execute(new Runner(t, map, key, barrier));
118	barrier.await();
119	barrier.await();
120	long time = timer.getTime();
121	long tpo = time / (i * (long) nops);
122	System.out.print(LoopHelpers.rightJustify(tpo) + " ns per op");
123	double secs = (double) time / 1000000000.0;
124	System.out.println("\t " + secs + "s run time");
125	map.clear();
126	}
127
128	static class Runner implements Runnable {
129	final Map<Integer,Integer> map;
130	final Integer[] key;
131	final LoopHelpers.SimpleRandom rng;
132	final CyclicBarrier barrier;
133	int position;
134	int total;
135
136	Runner(int id, Map<Integer,Integer> map, Integer[] key, CyclicBarrier barrier) {
137	this.map = map;
138	this.key = key;
139	this.barrier = barrier;
140	position = key.length / 2;
141	rng = new LoopHelpers.SimpleRandom((id + 1) * 8862213513L);
142	rng.next();
143	}
144
145	int step() {
146	// random-walk around key positions, bunching accesses
147	int r = rng.next();
148	position += (r & 7) - 3;
149	while (position >= key.length) position -= key.length;
150	while (position < 0) position += key.length;
151
152	Integer k = key[position];
153	Integer x = map.get(k);
154
155	if (x != null) {
156	if (x.intValue() != k.intValue())
157	throw new Error("bad mapping: " + x + " to " + k);
158
159	if (r < removesPerMaxRandom) {
160	if (map.remove(k) != null) {
161	position = total % key.length; // move from position
162	return 2;
163	}
164	}
165	}
166	else if (r < insertsPerMaxRandom) {
167	++position;
168	map.putIfAbsent(k, k);
169	return 2;
170	}
171
172	// Uncomment to add a little computation between accesses
173	// total += LoopHelpers.compute1(k.intValue());
174	total += r;
175	return 1;
176	}
177
178	public void run() {
179	try {
180	barrier.await();
181	int ops = nops;
182	while (ops > 0)
183	ops -= step();
184	barrier.await();
185	}
186	catch (Exception ex) {
187	ex.printStackTrace();
188	}
189	}
190	}
191	}