Alawn/Chronicle-Map
1
0
Fork 0
mirror of https://github.com/OpenHFT/Chronicle-Map.git synced 2021-09-13 01:26:12 +00:00
Code Releases Activity

Test for lots of variable sized entries

Browse Source
This commit is contained in:
Peter Lawrey
2014-12-19 22:11:19 +00:00
parent 95f5ed6ac5
commit 66b33e3896
1 changed files with 54 additions and 29 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/test/java/net/openhft/chronicle/map/example/LotsOfEntriesMain.java
+54 -29
View File
@@ -6,50 +6,75 @@ import net.openhft.lang.model.constraints.MaxSize;
import java.io.File;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;
import java.util.Random;
import java.util.concurrent.ExecutionException;
import java.util.concurrent.ExecutorService;
import java.util.concurrent.Executors;
import java.util.concurrent.Future;
/**
* Created by peter on 19/12/14.
*/
public class LotsOfEntriesMain {
public static void main(String[] args) throws IOException {
public static void main(String[] args) throws IOException, ExecutionException, InterruptedException {
workEntries(true);
workEntries(false);
}
private static void workEntries(boolean add) throws IOException {
long entries = 100_000_000;
private static void workEntries(final boolean add) throws IOException, ExecutionException, InterruptedException {
final long entries = 100_000_000;
File file = new File("/tmp/lotsOfEntries.dat");
ChronicleMap<CharSequence, MyFloats> map = ChronicleMapBuilder
final ChronicleMap<CharSequence, MyFloats> map = ChronicleMapBuilder
.of(CharSequence.class, MyFloats.class)
.entries(entries)
.entrySize(80)
.entries(entries*6/5)
.entrySize(256)
.createPersistedTo(file);
Random rand = new Random();
StringBuilder sb = new StringBuilder();
MyFloats mf = map.newValueInstance();
if (add)
for (int i = 0; i < 6; i++)
mf.setValueAt(i, i);
long start = System.nanoTime();
for (long i = 0; i < entries; i++) {
sb.setLength(0);
int length = (int) (24 / (rand.nextFloat() + 24.0 / 1000));
if (length > 2000)
throw new AssertionError();
sb.append(i);
while (sb.length() < length)
sb.append("-key");
if (add)
map.put(sb, mf);
else
map.getUsing(sb, mf);
if (i << -7 == 0 && i % 2000000 == 0)
System.out.println(i);
int threads = Runtime.getRuntime().availableProcessors();
ExecutorService es = Executors.newFixedThreadPool(threads);
long block = (entries + threads - 1) / threads;
final long start = System.nanoTime();
List<Future<?>> futures = new ArrayList<>();
for (int t = 0; t < threads; t++) {
final long startI = t * block;
final long endI = Math.min((t + 1) * block, entries);
futures.add(es.submit(new Runnable() {
@Override
public void run() {
Random rand = new Random(startI);
StringBuilder sb = new StringBuilder();
MyFloats mf = map.newValueInstance();
if (add)
for (int i = 0; i < 6; i++)
mf.setValueAt(i, i);
for (long i = startI; i < endI; i++) {
sb.setLength(0);
int length = (int) (24 / (rand.nextFloat() + 24.0 / 1000));
sb.append(i);
while (sb.length() < length)
sb.append("-key");
try {
if (add)
map.put(sb, mf);
else
map.getUsing(sb, mf);
} catch (Exception e) {
System.out.println("map.size: "+map.size());
throw e;
}
}
}
}));
}
for (Future<?> future : futures) {
future.get();
}
long time = System.nanoTime() - start;
System.out.printf("Map.size: %,d took an average of %,d ns to %s.%n",
map.size(), time / entries, add ? "add" : "get");
es.shutdown();
System.out.printf("Map.size: %,d with a throughput of %.1f million/sec to %s.%n",
map.size(), entries * 1e3 / time, add ? "add" : "get");
map.close();
}
}