Class Summary |
N01_Part1_Listing1 |
For the article Robust Java benchmarking, Part 1: Issues,
contains the code relevant to Listing 1. |
N02_Part1_Listing2 |
For the article Robust Java benchmarking, Part 1: Issues,
contains the code relevant to Listing 2. |
N03_Part1_Listing4 |
For the article Robust Java benchmarking, Part 1: Issues,
contains the code relevant to Listing 4. |
N04_Part1_Listing5 |
For the article Robust Java benchmarking, Part 1: Issues,
contains the code relevant to Listing 5. |
N05_Part1_Listing7 |
For the article Robust Java benchmarking, Part 1: Issues,
contains the code relevant to Listing 7. |
N06_Part2_Figures1and2 |
For the article Robust Java benchmarking, Part 2: Statistics And solutions,
contains the code relevant to Figure 1
and Figure 2. |
N07_Part2_Listing1 |
For the article Robust Java benchmarking, Part 2: Statistics And solutions,
contains the code relevant to a href="http://www.ibm.com/developerworks/library/j-benchmark2/index.html#listing1">Listing 1. |
N08_Part2_DataStructureAccess |
For the article Robust Java benchmarking, Part 2: Statistics And solutions,
contains the code relevant to Figure 3,
Figure 4,
Figure 5,
Listing 2,
and Listing 3. |
N08_Part2_DataStructureAccess.ArrayAccessRandom |
Task class for benchmarking the access time of an array (N08_Part2_DataStructureAccess.integers ). |
N08_Part2_DataStructureAccess.ArrayAccessSequential |
Task class for benchmarking the access time of an array (N08_Part2_DataStructureAccess.integers ). |
N08_Part2_DataStructureAccess.ArrayAccessSynchronizedRandom |
Same code as N08_Part2_DataStructureAccess.ArrayAccessRandom except synchronize on N08_Part2_DataStructureAccess.integers around each access. |
N08_Part2_DataStructureAccess.ArrayAccessSynchronizedSequential |
Same code as N08_Part2_DataStructureAccess.ArrayAccessSequential except synchronize on N08_Part2_DataStructureAccess.integers around each access. |
N08_Part2_DataStructureAccess.ArrayListAccessRandom |
Same code as N08_Part2_DataStructureAccess.ArrayAccessRandom except use an ArrayList that is equivalent to N08_Part2_DataStructureAccess.integers . |
N08_Part2_DataStructureAccess.ArrayListAccessSequential |
Same code as N08_Part2_DataStructureAccess.ArrayAccessSequential except use an ArrayList that is equivalent to N08_Part2_DataStructureAccess.integers . |
N08_Part2_DataStructureAccess.ConcurrentHashMapAccess1Random |
Same code as N08_Part2_DataStructureAccess.HashMapAccessRandom except use a ConcurrentHashMap. |
N08_Part2_DataStructureAccess.ConcurrentHashMapAccess1Sequential |
Same code as N08_Part2_DataStructureAccess.HashMapAccessSequential except use a ConcurrentHashMap. |
N08_Part2_DataStructureAccess.ConcurrentHashMapAccess2Random |
Same code as N08_Part2_DataStructureAccess.HashMapAccessRandom except use a ConcurrentHashMap. |
N08_Part2_DataStructureAccess.ConcurrentHashMapAccess2Sequential |
Same code as N08_Part2_DataStructureAccess.HashMapAccessSequential except use a ConcurrentHashMap. |
N08_Part2_DataStructureAccess.HashMapAccessRandom |
Same code as N08_Part2_DataStructureAccess.ArrayAccessRandom except use a HashMap that maps N08_Part2_DataStructureAccess.integers to N08_Part2_DataStructureAccess.integers . |
N08_Part2_DataStructureAccess.HashMapAccessSequential |
Same code as N08_Part2_DataStructureAccess.ArrayAccessSequential except use a HashMap that maps N08_Part2_DataStructureAccess.integers to N08_Part2_DataStructureAccess.integers . |
N08_Part2_DataStructureAccess.RandomIndex |
Via the next method, returns all the valid indices of N08_Part2_DataStructureAccess.integers in seemingly random order. |
N08_Part2_DataStructureAccess.TaskRunnableAbstract |
Abstract base class for all of the other Task classes. |
N08_Part2_DataStructureAccess.ThreadLocalAccessRandom |
Similar code as N08_Part2_DataStructureAccess.HashMapAccessRandom except use a ThreadLocal. |
N08_Part2_DataStructureAccess.ThreadLocalAccessSequential |
Similar code as N08_Part2_DataStructureAccess.HashMapAccessSequential except use a ThreadLocal. |
N08_Part2_DataStructureAccess.TreeMapAccessRandom |
Same code as N08_Part2_DataStructureAccess.HashMapAccessRandom except use a TreeMap. |
N08_Part2_DataStructureAccess.TreeMapAccessSequential |
Same code as N08_Part2_DataStructureAccess.HashMapAccessSequential except use a TreeMap. |
N08_Part2_DataStructureAccess.VectorAccessRandom |
Same code as N08_Part2_DataStructureAccess.ArrayListAccessRandom except use a Vector. |
N08_Part2_DataStructureAccess.VectorAccessSequential |
Same code as N08_Part2_DataStructureAccess.ArrayListAccessSequential except use a Vector. |
N10_Supplement_Lfsr |
For the article supplement,
contains the code relevant to Listing 1 and Listing 2. |
N11_Supplement_LfsrVariations |
For the article supplement,
contains the code relevant to Figure 1 and Figure 2. |
N11_Supplement_LfsrVariations.Benchmark2 |
Specialized subclass of Benchmark which has an additional perform method
which will support the calculaations and results needed by the parent class. |
N12_Supplement_Listing3 |
For the article supplement,
contains the code relevant to Listing 3. |
N13_Supplement_CallableVersusRunnable |
For the article supplement,
contains the code relevant to Listing 4 and Listing 5. |