test/loops/RLIBar.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/licenses/publicdomain
 */
// Adapted from code that was in turn
// Derived from SocketPerformanceTest.java - BugID: 4763450
//
//

import java.io.*;
import java.net.*;
import java.util.concurrent.*;
import java.util.concurrent.locks.*;

public class RLIBar {

    static int batchLimit;
    static int mseq;
    static int nReady;
    static int ExThreads;
    static int ASum;
    static final ReentrantLock Gate = new ReentrantLock();
    static final Condition GateCond = Gate.newCondition();

    static final ReentrantLock HoldQ = new ReentrantLock();
    static final Condition HoldQCond = HoldQ.newCondition();
    static boolean Hold = false;
    static int HoldPop;
    static int HoldLimit;

    private static boolean HoldCheck() {
        try {
            HoldQ.lock();
            try {
                if (!Hold) return false;
                else {
                    ++HoldPop;
                    if (HoldPop >= HoldLimit) {
                        System.out.print("Holding ");
                        Thread.sleep(1000);
                        System.out.println();
                        Hold = false;
                        HoldQCond.signalAll();
                    }
                    else
                        while (Hold)
                            HoldQCond.await();

                    if (--HoldPop == 0) HoldQCond.signalAll();
                    return true;
                }
            }
            finally {
                HoldQ.unlock();
            }
        } catch (Exception Ex) {
            System.out.println("Unexpected exception in Hold: " + Ex);
            return false;
        }
    }

    private static class Server {
        private int nClients;
        final ReentrantLock thisLock = new ReentrantLock();
        final Condition thisCond = thisLock.newCondition();

        Server(int nClients) {
            this.nClients = nClients;
            try {
                for (int i = 0; i < nClients; ++i) {
                    final int fix = i;
                    new Thread() { public void run() { runServer(fix); }}.start();
                }
            } catch (Exception e) {
                System.err.println(e);
            }
        }

        // the total number of messages received by all server threads
        // on this server
        int msgsReceived = 0;

        // incremented each time we get a complete batch of requests
        private int currentBatch = 0;

        // the number of requests received since the last time currentBatch
        // was incremented
        private int currentBatchSize = 0;

        private void runServer(int id) {
            int msg;
            boolean held = false;
            final ReentrantLock thisLock = this.thisLock;
            final Condition thisCond = this.thisCond;

            try {

                // Startup barrier - rendezvous - wait for all threads.
                // Forces all threads to park on their LWPs, ensuring
                // proper provisioning on T1.
                // Alternately, use THR_BOUND threads
                Gate.lock(); try {
                    ++nReady;
                    if (nReady == ExThreads) {
                        GateCond.signalAll();
                    }
                    while (nReady != ExThreads)
                        GateCond.await();
                } finally { Gate.unlock(); }

                for (;;) {
                    //                    if (!held && currentBatchSize == 0) held = HoldCheck ();
                    msg = (++ mseq) ^ id;
                    thisLock.lock();
                    try {
                        ASum += msg;
                        ++msgsReceived;
                        int myBatch = currentBatch;
                        if (++currentBatchSize >= batchLimit) {
                            // this batch is full, start a new one ...
                            ++currentBatch;
                            currentBatchSize = 0;
                            // and wake up everyone in this one
                            thisCond.signalAll();
                        }
                        // Wait until our batch is complete
                        while (myBatch == currentBatch)
                            thisCond.await();
                    }
                    finally {
                        thisLock.unlock();
                    }
                }
            } catch (Exception e) {
                System.err.println("Server thread: exception "  + e);
                e.printStackTrace();
            }
        }


    }

    public static void main(String[] args) throws Exception {
        int nServers = 10;
        int nClients = 10;
        int samplePeriod = 10000;
        int nSamples = 5;

        int nextArg = 0;
        while (nextArg < args.length) {
            String arg = args[nextArg++];
            if (arg.equals("-nc"))
                nClients = Integer.parseInt(args[nextArg++]);
            else if (arg.equals("-ns"))
                nServers = Integer.parseInt(args[nextArg++]);
            else if (arg.equals("-batch"))
                batchLimit = Integer.parseInt(args[nextArg++]);
            else if (arg.equals("-sample"))
                samplePeriod = Integer.parseInt(args[nextArg++]);
            else if (arg.equals("-np"))
                nSamples = Integer.parseInt(args[nextArg++]);
            else {
                System.err.println("Argument error:" + arg);
                System.exit(1);
            }
        }
        if (nClients <= 0 || nServers <= 0 || samplePeriod <= 0 || batchLimit > nClients) {
            System.err.println("Argument error");
            System.exit(1);
        }

        // default batch size is 2/3 the number of clients
        // (for no particular reason)
        if (false && batchLimit <= 0)
            batchLimit = (2 * nClients + 1) / 3;

        ExThreads = nServers * nClients;       // expected # of threads
        HoldLimit = ExThreads;

        // start up all threads
        Server[] servers = new Server[nServers];
        for (int i = 0; i < nServers; ++i) {
            servers[i] = new Server(nClients);
        }

        // Wait for consensus
        try {
            Gate.lock(); try {
                while (nReady != ExThreads ) GateCond.await();
            } finally { Gate.unlock(); }
        } catch (Exception ex) {
            System.out.println(ex);
        }
        System.out.println(
                            nReady + " Ready: nc=" + nClients + " ns=" + nServers + " batch=" + batchLimit);

        // Start sampling ...
        // Methodological problem: all the mutator threads
        // can starve the compiler threads, resulting in skewed scores.
        // In theory, over time, the scores will improve as the compiler
        // threads are granted CPU cycles, but in practice a "warm up" phase
        // might be good idea to help C2.  For this reason I've implemented
        // the "Hold" facility.

        long lastNumMsgs = 0;
        long sampleStart = System.currentTimeMillis();
        for (int j = 0; j < nSamples; ++j) {
            // when this sample period is supposed to end
            long sampleEnd = sampleStart + samplePeriod;
            for (;;) {
                long now = System.currentTimeMillis();
                if (now >= sampleEnd) {
                    // when it really did end
                    sampleEnd = now;
                    break;
                }
                Thread.sleep(sampleEnd - now);
            }

            if (false && j == 2) {
                System.out.print("Hold activated ...");
                HoldQ.lock();
                try {
                    Hold = true;
                    while (Hold) HoldQCond.await();
                }
                finally {
                    HoldQ.unlock();
                }
            }


            // there's no synchronization here, so the total i get is
            // approximate, but that's OK since any i miss for this
            // sample will get credited to the next sample, and on average
            // we'll be right
            long numMsgs = 0;
            for (int i = 0; i < nServers; ++i)
                numMsgs += servers[i].msgsReceived;
            long deltaMsgs = numMsgs - lastNumMsgs;
            long deltaT = sampleEnd - sampleStart;
            if (true || j != 2) {       // Don't report results if we issued a hold ...
                System.out.print(
                                 "Sample period = " + deltaT + " ms; "
                                 + "New msgs rcvd = " + deltaMsgs + "; "
                                 + "Throughput = " + (deltaMsgs*1000 / deltaT) + " msg/sec\n");
                //                for (int i = 0; i < nServers; ++i)
                //                    servers[i].thisLock.dump();
            }
            sampleStart = sampleEnd;
            lastNumMsgs = numMsgs;
        }
        System.exit(0);
    }
}
Revision:	1.7
Committed:	Sat Oct 16 16:22:57 2010 UTC (13 years, 7 months ago) by jsr166
Branch:	MAIN
Changes since 1.6:	+1 -1 lines
Log Message:	coding style
#	User	Rev	Content
1	dl	1.2	/*
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/licenses/publicdomain
5			*/
6	dl	1.1	// Adapted from code that was in turn
7			// Derived from SocketPerformanceTest.java - BugID: 4763450
8			//
9	jsr166	1.3	//
10	dl	1.1
11			import java.io.*;
12			import java.net.*;
13			import java.util.concurrent.*;
14			import java.util.concurrent.locks.*;
15
16			public class RLIBar {
17
18	jsr166	1.5	static int batchLimit;
19			static int mseq;
20			static int nReady;
21			static int ExThreads;
22			static int ASum;
23			static final ReentrantLock Gate = new ReentrantLock();
24			static final Condition GateCond = Gate.newCondition();
25
26			static final ReentrantLock HoldQ = new ReentrantLock();
27			static final Condition HoldQCond = HoldQ.newCondition();
28			static boolean Hold = false;
29			static int HoldPop;
30			static int HoldLimit;
31	jsr166	1.3
32	jsr166	1.6	private static boolean HoldCheck() {
33	jsr166	1.3	try {
34			HoldQ.lock();
35			try {
36	dl	1.1	if (!Hold) return false;
37			else {
38	jsr166	1.5	++HoldPop;
39	jsr166	1.3	if (HoldPop >= HoldLimit) {
40	jsr166	1.5	System.out.print("Holding ");
41			Thread.sleep(1000);
42			System.out.println();
43			Hold = false;
44			HoldQCond.signalAll();
45	jsr166	1.3	}
46	dl	1.1	else
47	jsr166	1.3	while (Hold)
48	jsr166	1.5	HoldQCond.await();
49	jsr166	1.3
50	jsr166	1.5	if (--HoldPop == 0) HoldQCond.signalAll();
51	dl	1.1	return true;
52			}
53			}
54	jsr166	1.3	finally {
55			HoldQ.unlock();
56	dl	1.1	}
57	jsr166	1.3	} catch (Exception Ex) {
58	jsr166	1.5	System.out.println("Unexpected exception in Hold: " + Ex);
59	dl	1.1	return false;
60			}
61			}
62
63			private static class Server {
64			private int nClients;
65			final ReentrantLock thisLock = new ReentrantLock();
66	jsr166	1.3	final Condition thisCond = thisLock.newCondition();
67
68	jsr166	1.5	Server(int nClients) {
69	dl	1.1	this.nClients = nClients;
70			try {
71			for (int i = 0; i < nClients; ++i) {
72	jsr166	1.5	final int fix = i;
73			new Thread() { public void run() { runServer(fix); }}.start();
74	dl	1.1	}
75			} catch (Exception e) {
76	jsr166	1.5	System.err.println(e);
77	dl	1.1	}
78			}
79
80			// the total number of messages received by all server threads
81			// on this server
82			int msgsReceived = 0;
83
84			// incremented each time we get a complete batch of requests
85			private int currentBatch = 0;
86
87			// the number of requests received since the last time currentBatch
88			// was incremented
89			private int currentBatchSize = 0;
90
91	jsr166	1.5	private void runServer(int id) {
92			int msg;
93	dl	1.1	boolean held = false;
94			final ReentrantLock thisLock = this.thisLock;
95	jsr166	1.3	final Condition thisCond = this.thisCond;
96	dl	1.1
97			try {
98
99	jsr166	1.3	// Startup barrier - rendezvous - wait for all threads.
100	dl	1.1	// Forces all threads to park on their LWPs, ensuring
101	jsr166	1.3	// proper provisioning on T1.
102			// Alternately, use THR_BOUND threads
103			Gate.lock(); try {
104	jsr166	1.5	++nReady;
105			if (nReady == ExThreads) {
106			GateCond.signalAll();
107	dl	1.1	}
108	jsr166	1.5	while (nReady != ExThreads)
109			GateCond.await();
110	dl	1.1	} finally { Gate.unlock(); }
111
112			for (;;) {
113	jsr166	1.5	// if (!held && currentBatchSize == 0) held = HoldCheck ();
114			msg = (++ mseq) ^ id;
115	jsr166	1.3	thisLock.lock();
116	dl	1.1	try {
117	jsr166	1.5	ASum += msg;
118	dl	1.1	++msgsReceived;
119			int myBatch = currentBatch;
120			if (++currentBatchSize >= batchLimit) {
121			// this batch is full, start a new one ...
122			++currentBatch;
123			currentBatchSize = 0;
124			// and wake up everyone in this one
125	jsr166	1.5	thisCond.signalAll();
126	dl	1.1	}
127			// Wait until our batch is complete
128			while (myBatch == currentBatch)
129	jsr166	1.3	thisCond.await();
130			}
131			finally {
132			thisLock.unlock();
133	dl	1.1	}
134			}
135			} catch (Exception e) {
136	jsr166	1.5	System.err.println("Server thread: exception " + e);
137	dl	1.1	e.printStackTrace();
138			}
139			}
140
141
142			}
143
144	jsr166	1.5	public static void main(String[] args) throws Exception {
145			int nServers = 10;
146			int nClients = 10;
147	dl	1.1	int samplePeriod = 10000;
148			int nSamples = 5;
149
150			int nextArg = 0;
151			while (nextArg < args.length) {
152			String arg = args[nextArg++];
153			if (arg.equals("-nc"))
154			nClients = Integer.parseInt(args[nextArg++]);
155			else if (arg.equals("-ns"))
156			nServers = Integer.parseInt(args[nextArg++]);
157			else if (arg.equals("-batch"))
158			batchLimit = Integer.parseInt(args[nextArg++]);
159			else if (arg.equals("-sample"))
160			samplePeriod = Integer.parseInt(args[nextArg++]);
161			else if (arg.equals("-np"))
162			nSamples = Integer.parseInt(args[nextArg++]);
163	jsr166	1.3	else {
164	jsr166	1.5	System.err.println("Argument error:" + arg);
165			System.exit(1);
166	jsr166	1.3	}
167	dl	1.1	}
168			if (nClients <= 0 \|\| nServers <= 0 \|\| samplePeriod <= 0 \|\| batchLimit > nClients) {
169	jsr166	1.5	System.err.println("Argument error");
170			System.exit(1);
171	dl	1.1	}
172
173			// default batch size is 2/3 the number of clients
174			// (for no particular reason)
175			if (false && batchLimit <= 0)
176			batchLimit = (2 * nClients + 1) / 3;
177
178	jsr166	1.5	ExThreads = nServers * nClients; // expected # of threads
179			HoldLimit = ExThreads;
180	dl	1.1
181			// start up all threads
182			Server[] servers = new Server[nServers];
183			for (int i = 0; i < nServers; ++i) {
184			servers[i] = new Server(nClients);
185			}
186
187	jsr166	1.3	// Wait for consensus
188	dl	1.1	try {
189	jsr166	1.3	Gate.lock(); try {
190	jsr166	1.5	while (nReady != ExThreads ) GateCond.await();
191	dl	1.1	} finally { Gate.unlock(); }
192	jsr166	1.3	} catch (Exception ex) {
193	jsr166	1.5	System.out.println(ex);
194	dl	1.1	}
195	jsr166	1.5	System.out.println(
196			nReady + " Ready: nc=" + nClients + " ns=" + nServers + " batch=" + batchLimit);
197	dl	1.1
198			// Start sampling ...
199			// Methodological problem: all the mutator threads
200			// can starve the compiler threads, resulting in skewed scores.
201			// In theory, over time, the scores will improve as the compiler
202			// threads are granted CPU cycles, but in practice a "warm up" phase
203	jsr166	1.3	// might be good idea to help C2. For this reason I've implemented
204			// the "Hold" facility.
205	dl	1.1
206			long lastNumMsgs = 0;
207			long sampleStart = System.currentTimeMillis();
208			for (int j = 0; j < nSamples; ++j) {
209			// when this sample period is supposed to end
210			long sampleEnd = sampleStart + samplePeriod;
211			for (;;) {
212			long now = System.currentTimeMillis();
213			if (now >= sampleEnd) {
214			// when it really did end
215			sampleEnd = now;
216			break;
217			}
218			Thread.sleep(sampleEnd - now);
219			}
220
221	jsr166	1.3	if (false && j == 2) {
222	jsr166	1.5	System.out.print("Hold activated ...");
223	jsr166	1.3	HoldQ.lock();
224	jsr166	1.7	try {
225	jsr166	1.5	Hold = true;
226			while (Hold) HoldQCond.await();
227	jsr166	1.3	}
228			finally {
229			HoldQ.unlock();
230	dl	1.1	}
231			}
232
233
234
235			// there's no synchronization here, so the total i get is
236			// approximate, but that's OK since any i miss for this
237			// sample will get credited to the next sample, and on average
238			// we'll be right
239			long numMsgs = 0;
240			for (int i = 0; i < nServers; ++i)
241			numMsgs += servers[i].msgsReceived;
242			long deltaMsgs = numMsgs - lastNumMsgs;
243			long deltaT = sampleEnd - sampleStart;
244	jsr166	1.4	if (true \|\| j != 2) { // Don't report results if we issued a hold ...
245	dl	1.1	System.out.print(
246			"Sample period = " + deltaT + " ms; "
247			+ "New msgs rcvd = " + deltaMsgs + "; "
248			+ "Throughput = " + (deltaMsgs*1000 / deltaT) + " msg/sec\n");
249			// for (int i = 0; i < nServers; ++i)
250			// servers[i].thisLock.dump();
251			}
252			sampleStart = sampleEnd;
253			lastNumMsgs = numMsgs;
254			}
255			System.exit(0);
256			}
257			}