net.rhapso.koa.tree.IOTest.java Source code

Introduction

Here is the source code for net.rhapso.koa.tree.IOTest.java

Source

/*
 * The MIT License
 *
 * Copyright (c) 2010 Fabrice Medio
 *
 * Permission is hereby granted, free of charge, to any person obtaining a copy
 * of this software and associated documentation files (the "Software"), to deal
 * in the Software without restriction, including without limitation the rights
 * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
 * copies of the Software, and to permit persons to whom the Software is
 * furnished to do so, subject to the following conditions:
 *
 * The above copyright notice and this permission notice shall be included in
 * all copies or substantial portions of the Software.
 *
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
 * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
 * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
 * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
 * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
 * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN
 * THE SOFTWARE.
 */

package net.rhapso.koa.tree;

import net.rhapso.koa.BaseTreeTestCase;
import net.rhapso.koa.storage.FileStorageFactory;
import net.rhapso.koa.storage.block.BlockSize;
import net.rhapso.koa.storage.block.Cache;
import net.rhapso.koa.storage.block.CacheStatistics;
import net.rhapso.koa.storage.block.LRUCache;
import org.apache.commons.io.FileUtils;
import org.junit.After;
import org.junit.Before;
import org.junit.Test;

import java.io.File;
import java.util.Iterator;

import static org.junit.Assert.fail;

public class IOTest extends BaseTreeTestCase {

    private File data;

    @Before
    public void setUp() throws Exception {
        data = new File("perftest");
        FileUtils.deleteQuietly(data);
        data.mkdir();
    }

    @After
    public void tearDown() throws Exception {
        FileUtils.deleteQuietly(data);
    }

    @Test
    public void testKeepJUnitHappy() {

    }

    public void _testVeryLargeRun() throws Exception {
        runLocal(2000000, 5000);
    }

    public void _testLargeRun() throws Exception {
        runLocal(50000, 500);
    }

    public void _testSmallRun() throws Exception {
        runLocal(5000, 500);
    }

    private void runLocal(int howMany, int samplingRate) {
        Cache cache = new LRUCache(10000, new BlockSize(4096));
        FileStorageFactory factory = new FileStorageFactory(data);
        Tree tree = Koa.open(new StoreName("test"), factory, cache);
        doRun(howMany, samplingRate, tree, cache);
    }

    private void doRun(int howMany, int samplingRate, Tree tree, Cache cache) {
        long insertionElapsed = 0;
        long retrievalElapsed = 0;

        tree.put(new Key(new byte[1]), new Value(0));
        System.out.println("keyCount, writeThroughput, readThroughput, cacheHitRatio, cacheFillRatio");
        for (int i = 0; i < howMany; i++) {
            byte[] bytes = makeRandomBytes(100);
            Key key = new Key(bytes);
            long insertionThen = System.nanoTime();
            tree.put(key, new Value(0));
            insertionElapsed += System.nanoTime() - insertionThen;

            long retrievalThen = System.nanoTime();
            boolean containsKey = tree.contains(key);
            retrievalElapsed += System.nanoTime() - retrievalThen;
            if (!containsKey) {
                fail();
            }

            if (i != 0 && i % samplingRate == 0) {
                CacheStatistics cacheStatistics = cache.resetStatistics();
                long avgInsertionTime = insertionElapsed / samplingRate;
                long avgRetrievalTime = retrievalElapsed / samplingRate;

                double writeThroughput = 1000000000d / (double) avgInsertionTime;
                double readThroughput = 1000000000d / (double) avgRetrievalTime;

                System.out.println(i + "," + writeThroughput + "," + readThroughput + ","
                        + cacheStatistics.hitRatio() + "," + cacheStatistics.fillRatio());
                insertionElapsed = 0;
                retrievalElapsed = 0;
            }
        }
        Iterator iterator = tree.cursorAt(new Key(new byte[1]));
        long then = System.nanoTime();
        while (iterator.hasNext()) {
            iterator.next();
        }
        long elapsed = System.nanoTime() - then;
        System.out
                .println("Cursor can read " + (((double) howMany / (double) elapsed) * 1000000000d) + " keys/sec");
    }
}