/*
* JBoss, Home of Professional Open Source
* Copyright 2012 Red Hat Inc. and/or its affiliates and other
* contributors as indicated by the @author tags. All rights reserved.
* See the copyright.txt in the distribution for a full listing of
* individual contributors.
*
* This is free software; you can redistribute it and/or modify it
* under the terms of the GNU Lesser General Public License as
* published by the Free Software Foundation; either version 2.1 of
* the License, or (at your option) any later version.
*
* This software is distributed in the hope that it will be useful,
* but WITHOUT ANY WARRANTY; without even the implied warranty of
* MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
* Lesser General Public License for more details.
*
* You should have received a copy of the GNU Lesser General Public
* License along with this software; if not, write to the Free
* Software Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA
* 02110-1301 USA, or see the FSF site: http://www.fsf.org.
*/
package org.infinispan.stress;
import org.infinispan.container.InternalEntryFactory;
import org.infinispan.container.InternalEntryFactoryImpl;
import org.infinispan.container.entries.InternalCacheEntry;
import org.infinispan.container.versioning.EntryVersion;
import org.infinispan.loaders.CacheLoaderException;
import org.infinispan.loaders.decorators.AbstractDelegatingStore;
import org.infinispan.loaders.decorators.AsyncStore;
import org.infinispan.loaders.decorators.AsyncStoreConfig;
import org.infinispan.loaders.dummy.DummyInMemoryCacheStore;
import org.infinispan.marshall.TestObjectStreamMarshaller;
import org.infinispan.test.TestingUtil;
import org.infinispan.util.concurrent.locks.containers.LockContainer;
import org.infinispan.util.concurrent.locks.containers.ReentrantPerEntryLockContainer;
import org.infinispan.util.logging.Log;
import org.infinispan.util.logging.LogFactory;
import org.testng.annotations.DataProvider;
import org.testng.annotations.Test;
import java.util.ArrayList;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.Random;
import java.util.Set;
import java.util.TreeMap;
import java.util.concurrent.Callable;
import java.util.concurrent.ConcurrentHashMap;
import java.util.concurrent.CountDownLatch;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.locks.Lock;
import static java.lang.Math.sqrt;
/**
* Async store stress test.
*
* // TODO: Add a test to verify clear() too!
*
* @author Galder Zamarreño
* @since 5.2
*/
@Test(testName = "stress.AsyncStoreStressTest", groups = "stress",
enabled = true, description = "Disabled by default, designed to be run manually.")
public class AsyncStoreStressTest {
static final Log log = LogFactory.getLog(AsyncStoreStressTest.class);
static final boolean trace = log.isTraceEnabled();
static final int CAPACITY = Integer.getInteger("size", 100000);
static final int LOOP_FACTOR = 10;
static final long RUNNING_TIME = Integer.getInteger("time", 1) * 60 * 1000;
static final Random RANDOM = new Random(12345);
private volatile CountDownLatch latch;
private List<String> keys = new ArrayList<String>();
private InternalEntryFactory entryFactory = new InternalEntryFactoryImpl();
private Map<Object, InternalCacheEntry> expectedState = new ConcurrentHashMap<Object, InternalCacheEntry>();
// Lock container that mimics per-key locking produced by the cache.
// This per-key lock holder provides guarantees that the final expected
// state has not been affected by ordering issues such as this:
//
// (Thread-200:) Enqueuing modification Store{storedEntry=
// ImmortalCacheEntry{key=key165168, value=ImmortalCacheValue {value=60483}}}
// (Thread-194:) Enqueuing modification Store{storedEntry=
// ImmortalCacheEntry{key=key165168, value=ImmortalCacheValue {value=61456}}}
// (Thread-194:) Expected state updated with key=key165168, value=61456
// (Thread-200:) Expected state updated with key=key165168, value=60483
private LockContainer locks = new ReentrantPerEntryLockContainer(32);
private Map<String, AbstractDelegatingStore> createAsyncStores() throws CacheLoaderException {
Map<String, AbstractDelegatingStore> stores = new TreeMap<String, AbstractDelegatingStore>();
stores.put("ASYNC", createAsyncStore());
return stores;
}
private AsyncStore createAsyncStore() throws CacheLoaderException {
DummyInMemoryCacheStore backendStore = createBackendStore("async2");
AsyncStoreConfig asyncCfg = new AsyncStoreConfig();
asyncCfg.modificationQueueSize(0);
AsyncStore store = new AsyncStore(backendStore, asyncCfg);
store.init(backendStore.getCacheStoreConfig(), null, new TestObjectStreamMarshaller());
store.start();
return store;
}
private DummyInMemoryCacheStore createBackendStore(String storeName) throws CacheLoaderException {
DummyInMemoryCacheStore store = new DummyInMemoryCacheStore();
store.init(new DummyInMemoryCacheStore.Cfg(storeName), null, new TestObjectStreamMarshaller());
store.start();
return store;
}
@DataProvider(name = "readWriteRemove")
public Object[][] independentReadWriteRemoveParams() {
return new Object[][]{
new Object[]{CAPACITY, 3 * CAPACITY, 90, 9, 1},
new Object[]{CAPACITY, 3 * CAPACITY, 9, 1, 0},
};
}
@Test(dataProvider = "readWriteRemove", enabled = true)
public void testReadWriteRemove(int capacity, int numKeys,
int readerThreads, int writerThreads, int removerThreads) throws Exception {
System.out.printf("Testing independent read/write/remove performance " +
"with capacity %d, keys %d, readers %d, writers %d, removers %d\n",
capacity, numKeys, readerThreads, writerThreads, removerThreads);
generateKeyList(numKeys);
Map<String, AbstractDelegatingStore> stores = createAsyncStores();
for (Map.Entry<String, AbstractDelegatingStore> e : stores.entrySet()) {
mapTestReadWriteRemove(e.getKey(), e.getValue(), numKeys,
readerThreads, writerThreads, removerThreads);
e.setValue(null);
}
}
private void mapTestReadWriteRemove(String name, AbstractDelegatingStore store,
int numKeys, int readerThreads, int writerThreads, int removerThreads) throws Exception {
DummyInMemoryCacheStore delegate = (DummyInMemoryCacheStore) store.getDelegate();
try {
// warm up for 1 second
System.out.printf("[store=%s] Warming up\n", name);
runMapTestReadWriteRemove(name, store, readerThreads, writerThreads, removerThreads, 1000);
// real test
System.out.printf("[store=%s] Testing...\n", name);
TotalStats perf = runMapTestReadWriteRemove(name, store, readerThreads, writerThreads, removerThreads, RUNNING_TIME);
// Wait until the cache store contains the expected state
System.out.printf("[store=%s] Verify contents\n", name);
delegate.blockUntilCacheStoreContains(expectedState.keySet(), 60000);
System.out.printf("Container %-12s ", name);
System.out.printf("Ops/s %10.2f ", perf.getTotalOpsPerSec());
System.out.printf("Gets/s %10.2f ", perf.getOpsPerSec("GET"));
System.out.printf("Puts/s %10.2f ", perf.getOpsPerSec("PUT"));
System.out.printf("Removes/s %10.2f ", perf.getOpsPerSec("REMOVE"));
System.out.printf("HitRatio %10.2f ", perf.getTotalHitRatio() * 100);
System.out.printf("Size %10d ", store.loadAllKeys(null).size());
double stdDev = computeStdDev(store, numKeys);
System.out.printf("StdDev %10.2f\n", stdDev);
} finally {
// Clean up state, expected state and keys
expectedState.clear();
delegate.clear();
}
}
private TotalStats runMapTestReadWriteRemove(String name, final AbstractDelegatingStore store, int numReaders, int numWriters,
int numRemovers, final long runningTimeout) throws Exception {
latch = new CountDownLatch(1);
final TotalStats perf = new TotalStats();
List<Thread> threads = new LinkedList<Thread>();
for (int i = 0; i < numReaders; i++) {
Thread reader = new WorkerThread("worker-" + name + "-get-" + i, runningTimeout, perf, readOperation(store));
threads.add(reader);
}
for (int i = 0; i < numWriters; i++) {
Thread writer = new WorkerThread("worker-" + name + "-put-" + i, runningTimeout, perf, writeOperation(store));
threads.add(writer);
}
for (int i = 0; i < numRemovers; i++) {
Thread remover = new WorkerThread("worker-" + name + "-remove-" + i, runningTimeout, perf, removeOperation(store));
threads.add(remover);
}
for (Thread t : threads)
t.start();
latch.countDown();
for (Thread t : threads)
t.join();
return perf;
}
private void generateKeyList(int numKeys) {
// without this we keep getting OutOfMemoryErrors
keys = null;
keys = new ArrayList<String>(numKeys * LOOP_FACTOR);
for (int i = 0; i < numKeys * LOOP_FACTOR; i++) {
keys.add("key" + nextIntGaussian(numKeys));
}
}
private int nextIntGaussian(int numKeys) {
double gaussian = RANDOM.nextGaussian();
if (gaussian < -3 || gaussian > 3)
return nextIntGaussian(numKeys);
return (int) Math.abs((gaussian + 3) * numKeys / 6);
}
private void waitForStart() {
try {
latch.await();
} catch (InterruptedException e) {
throw new RuntimeException(e);
}
}
private Operation<String, Integer> readOperation(AbstractDelegatingStore store) {
return new Operation<String, Integer>(store, "GET") {
@Override
public boolean call(String key, long run) {
try {
InternalCacheEntry ice = store.load(key);
if (trace)
log.tracef("Loaded key=%s, value=%s", key, ice != null ? ice.getValue() : "null");
return ice != null;
} catch (CacheLoaderException e) {
e.printStackTrace();
return false;
}
}
};
}
private Operation<String, Integer> writeOperation(AbstractDelegatingStore store) {
return new Operation<String, Integer>(store, "PUT") {
@Override
public boolean call(final String key, long run) {
final int value = (int) run;
final InternalCacheEntry entry =
entryFactory.create(key, value, (EntryVersion) null);
// Store acquiring locks and catching exceptions
boolean result = withStore(key, new Callable<Boolean>() {
@Override
public Boolean call() throws Exception {
store.store(entry);
expectedState.put(key, entry);
if (trace)
log.tracef("Expected state updated with key=%s, value=%s", key, value);
return true;
}
});
return result;
}
};
}
private Operation<String, Integer> removeOperation(AbstractDelegatingStore store) {
return new Operation<String, Integer>(store, "REMOVE") {
@Override
public boolean call(final String key, long run) {
// Remove acquiring locks and catching exceptions
boolean result = withStore(key, new Callable<Boolean>() {
@Override
public Boolean call() throws Exception {
boolean removed = store.remove(key);
if (removed) {
expectedState.remove(key);
if (trace)
log.tracef("Expected state removed key=%s", key);
}
return true;
}
});
return result;
}
};
}
private boolean withStore(String key, Callable<Boolean> call) {
Lock lock = null;
boolean result = false;
try {
lock = locks.acquireLock(Thread.currentThread(), key, 30, TimeUnit.SECONDS);
if (lock != null) {
result = call.call().booleanValue();
}
} catch (CacheLoaderException e) {
e.printStackTrace();
result = false;
} catch (InterruptedException e) {
e.printStackTrace();
result = false;
} finally {
if (lock == null) return false;
else {
lock.unlock();
return result;
}
}
}
private double computeStdDev(AbstractDelegatingStore store, int numKeys) throws CacheLoaderException {
// The keys closest to the mean are suposed to be accessed more often
// So we score each map by the standard deviation of the keys in the map
// at the end of the test
double variance = 0;
Set<Object> keys = store.loadAllKeys(null);
for (Object key : keys) {
double value = Integer.parseInt(((String )key).substring(3));
variance += (value - numKeys / 2) * (value - numKeys / 2);
}
return sqrt(variance / keys.size());
}
private class WorkerThread extends Thread {
private final long runningTimeout;
private final TotalStats perf;
private Operation<String, Integer> op;
public WorkerThread(String name, long runningTimeout, TotalStats perf, Operation<String, Integer> op) {
super(name);
this.runningTimeout = runningTimeout;
this.perf = perf;
this.op = op;
}
public void run() {
waitForStart();
long startMilis = System.currentTimeMillis();
long endMillis = startMilis + runningTimeout;
int keyIndex = RANDOM.nextInt(keys.size());
long runs = 0;
long missCount = 0;
while ((runs & 0x3FFF) != 0 || System.currentTimeMillis() < endMillis) {
boolean hit = op.call(keys.get(keyIndex), runs);
if (!hit) missCount++;
keyIndex++;
runs++;
if (keyIndex >= keys.size()) {
keyIndex = 0;
}
}
perf.addStats(op.getName(), runs, System.currentTimeMillis() - startMilis, missCount);
}
}
private static abstract class Operation<K, V> {
protected final AbstractDelegatingStore store;
protected final String name;
public Operation(AbstractDelegatingStore store, String name) {
this.store = store;
this.name = name;
}
/**
* @return Return true for a hit, false for a miss.
*/
public abstract boolean call(K key, long run);
public String getName() {
return name;
}
}
private static class TotalStats {
private ConcurrentHashMap<String, OpStats> statsMap = new ConcurrentHashMap<String, OpStats>();
public void addStats(String opName, long opCount, long runningTime, long missCount) {
OpStats s = new OpStats(opName, opCount, runningTime, missCount);
OpStats old = statsMap.putIfAbsent(opName, s);
boolean replaced = old == null;
while (!replaced) {
old = statsMap.get(opName);
s = new OpStats(old, opCount, runningTime, missCount);
replaced = statsMap.replace(opName, old, s);
}
}
public double getOpsPerSec(String opName) {
OpStats s = statsMap.get(opName);
if (s == null) return 0;
return s.opCount * 1000. / s.runningTime * s.threadCount;
}
public double getTotalOpsPerSec() {
long totalOpCount = 0;
long totalRunningTime = 0;
long totalThreadCount = 0;
for (Map.Entry<String, OpStats> e : statsMap.entrySet()) {
OpStats s = e.getValue();
totalOpCount += s.opCount;
totalRunningTime += s.runningTime;
totalThreadCount += s.threadCount;
}
return totalOpCount * 1000. / totalRunningTime * totalThreadCount;
}
public double getHitRatio(String opName) {
OpStats s = statsMap.get(opName);
if (s == null) return 0;
return 1 - 1. * s.missCount / s.opCount;
}
public double getTotalHitRatio() {
long totalOpCount = 0;
long totalMissCount = 0;
for (Map.Entry<String, OpStats> e : statsMap.entrySet()) {
OpStats s = e.getValue();
totalOpCount += s.opCount;
totalMissCount += s.missCount;
}
return 1 - 1. * totalMissCount / totalOpCount;
}
}
private static class OpStats {
public final String opName;
public final int threadCount;
public final long opCount;
public final long runningTime;
public final long missCount;
private OpStats(String opName, long opCount, long runningTime, long missCount) {
this.opName = opName;
this.threadCount = 1;
this.opCount = opCount;
this.runningTime = runningTime;
this.missCount = missCount;
}
private OpStats(OpStats base, long opCount, long runningTime, long missCount) {
this.opName = base.opName;
this.threadCount = base.threadCount + 1;
this.opCount = base.opCount + opCount;
this.runningTime = base.runningTime + runningTime;
this.missCount = base.missCount + missCount;
}
}
@Test(enabled = false) // Disable explicitly to avoid TestNG thinking this is a test!!
public static void main(String[] args) throws Exception {
AsyncStoreStressTest test = new AsyncStoreStressTest();
test.testReadWriteRemove(100000, 300000, 90, 9, 1);
test.testReadWriteRemove(10000, 30000, 9, 1, 0);
System.exit(0);
}
}