I'm interested what is the performance of many Long variables when they are used on 4-bit JVM deployed on x86-64 server? Is there any big difference if I use the same Integers on the same server?
My environment:
$ java -version
java version "1.7.0_07"
Java(TM) SE Runtime Environment (build 1.7.0_07-b10)
Java HotSpot(TM) 64-Bit Server VM (build 23.3-b01, mixed mode)
This is the code I ran just now:
import com.google.caliper.Runner;
import com.google.caliper.SimpleBenchmark;
public class Performance extends SimpleBenchmark {
static final Random rnd = new Random();
static long iters = 100_000_000 + rnd.nextInt(10_000_000);
public long timeLong(int reps) {
long sum = rnd.nextLong();
for (int rep = 0; rep < reps; rep++)
for (long l = 0; l < iters; l++) sum ^= l;
return sum;
}
public int timeInt(int reps) {
int sum = rnd.nextInt();
int iters = (int) Performance.iters;
for (int rep = 0; rep < reps; rep++)
for (int l = 0; l < iters; l++) sum ^= l;
return sum;
}
public static void main(String... args) {
Runner.main(Performance.class, args);
}
}
And these are the results;
0% Scenario{vm=java, trial=0, benchmark=Long} 105721736.11 ns; σ=1752926.46 ns @ 10 trials
50% Scenario{vm=java, trial=0, benchmark=Int} 71749350.00 ns; σ=188518.06 ns @ 3 trials
benchmark ms linear runtime
Long 105.7 ==============================
Int 71.7 ====================
If you replace ^=
with +=
, the difference is even wider:
benchmark ms linear runtime
Long 109.1 ==============================
Int 53.8 ==============
This may mean that XOR itself is equally fast, but ADD is twice slower.
The technical post webpages of this site follow the CC BY-SA 4.0 protocol. If you need to reprint, please indicate the site URL or the original address.Any question please contact:yoyou2525@163.com.