Changeset 2a658e9 for benchmark/mutex

Timestamp:

Sep 23, 2020, 12:56:32 PM (4 years ago)

Author:

Thierry Delisle <tdelisle@…>

Branches:

ADT, arm-eh, ast-experimental, enum, forall-pointer-decay, jacob/cs343-translation, master, new-ast-unique-expr, pthread-emulation, qualifiedEnum

Children:

4ab3cf9b

Parents:

305cd5c

Message:

Updated java benchmarks to support repetitions beyond 2³²

File:

• benchmark/mutex/JavaThread.java (modified) (3 diffs)

benchmark/mutex/JavaThread.java ¶

@@ -1 +1 @@
 public class JavaThread {
         // Simplistic low-quality Marsaglia Shift-XOR pseudo-random number generator.
-        // Bijective   
+        // Bijective
         // Cycle length for non-zero values is 4G-1.
         // 0 is absorbing and should be avoided -- fixed point.
         // The returned value is typically masked to produce a positive value.
-        static volatile int Ticket = 0 ; 
+        static volatile int Ticket = 0 ;
 
         private static int nextRandom (int x) {
-                if (x == 0) { 
+                if (x == 0) {
                         // reseed the PRNG
-                        // Ticket is accessed infrequently and does not constitute a coherence hot-spot. 
-                        // Note that we use a non-atomic racy increment -- the race is rare and benign. 
-                        // If the race is a concern switch to an AtomicInteger.  
-                        // In addition accesses to the RW volatile global "Ticket"  variable are not 
-                        // (readily) predictable at compile-time so the JIT will not be able to elide 
-                        // nextRandom() invocations.  
-                        x = ++Ticket ; 
-                        if (x == 0) x = 1 ; 
+                        // Ticket is accessed infrequently and does not constitute a coherence hot-spot.
+                        // Note that we use a non-atomic racy increment -- the race is rare and benign.
+                        // If the race is a concern switch to an AtomicInteger.
+                        // In addition accesses to the RW volatile global "Ticket"  variable are not
+                        // (readily) predictable at compile-time so the JIT will not be able to elide
+                        // nextRandom() invocations.
+                        x = ++Ticket ;
+                        if (x == 0) x = 1 ;
                 }
                 x ^= x << 6;
                 x ^= x >>> 21;
                 x ^= x << 7;
-                return x ;   
+                return x ;
         }
         static int x = 2;
 
-        static private int times = Integer.parseInt("100000000");
+        static private long times = Long.parseLong("100000000");
 
         public synchronized void noop() {
@@ -34 +34 @@
                 JavaThread j = new JavaThread();
                 // Inhibit biased locking ...
-                x = (j.hashCode() ^ System.identityHashCode(j)) | 1 ;     
-                for(int i = 1; i <= times; i += 1) {
+                x = (j.hashCode() ^ System.identityHashCode(j)) | 1 ;
+                for(long i = 1; i <= times; i += 1) {
                         x = nextRandom(x);
                         j.noop();
@@ -48 +48 @@
         public static void main(String[] args) throws InterruptedException {
                 if ( args.length > 2 ) System.exit( 1 );
-                if ( args.length == 2 ) { times = Integer.parseInt(args[1]); }
+                if ( args.length == 2 ) { times = Long.parseLong(args[1]); }
 
-                for (int n = Integer.parseInt("5"); --n >= 0 ; ) { 
+                for (int n = Integer.parseInt("5"); --n >= 0 ; ) {
                         InnerMain();
                         Thread.sleep(2000);     // 2 seconds