HBASE-4310 SlabCache metrics bugfix (Li Pi)

git-svn-id: https://svn.apache.org/repos/asf/hbase/trunk@1164349 13f79535-47bb-0310-9956-ffa450edef68
This commit is contained in:
Zhihong Yu 2011-09-02 04:20:04 +00:00
parent fa5f75ab0e
commit 077efb37ef
4 changed files with 37 additions and 10 deletions

View File

@ -233,6 +233,7 @@ Release 0.91.0 - Unreleased
HBASE-4315 RPC logging too verbose (todd)
HBASE-4273 java.lang.NullPointerException when a table is being disabled and
HMaster restarts (Ming Ma)
HBASE-4310 SlabCache metrics bugfix (Li Pi)
IMPROVEMENTS
HBASE-3290 Max Compaction Size (Nicolas Spiegelberg via Stack)

View File

@ -61,6 +61,7 @@ public class SingleSizeCache implements BlockCache {
private final CacheStats stats;
private final SlabItemEvictionWatcher evictionWatcher;
private AtomicLong size;
private AtomicLong timeSinceLastAccess;
public final static long CACHE_FIXED_OVERHEAD = ClassSize
.align((2 * Bytes.SIZEOF_INT) + (5 * ClassSize.REFERENCE)
+ +ClassSize.OBJECT);
@ -86,6 +87,7 @@ public class SingleSizeCache implements BlockCache {
this.stats = new CacheStats();
this.evictionWatcher = master;
this.size = new AtomicLong(CACHE_FIXED_OVERHEAD + backingStore.heapSize());
this.timeSinceLastAccess = new AtomicLong();
// This evictionListener is called whenever the cache automatically evicts
// something.
@ -94,6 +96,8 @@ public class SingleSizeCache implements BlockCache {
public void onEviction(String key, CacheablePair value) {
try {
value.evictionLock.writeLock().lock();
timeSinceLastAccess.set(System.nanoTime()
- value.recentlyAccessed.get());
backingStore.free(value.serializedData);
stats.evict();
/**
@ -139,6 +143,7 @@ public class SingleSizeCache implements BlockCache {
throw new RuntimeException("already cached " + blockName);
}
toBeCached.serialize(storedBlock);
newEntry.recentlyAccessed.set(System.nanoTime());
this.size.addAndGet(newEntry.heapSize());
}
@ -154,6 +159,7 @@ public class SingleSizeCache implements BlockCache {
// If lock cannot be obtained, that means we're undergoing eviction.
if (contentBlock.evictionLock.readLock().tryLock()) {
try {
contentBlock.recentlyAccessed.set(System.nanoTime());
return contentBlock.deserializer
.deserialize(contentBlock.serializedData);
} catch (IOException e) {
@ -193,11 +199,14 @@ public class SingleSizeCache implements BlockCache {
public void logStats() {
long milliseconds = (long)this.timeSinceLastAccess.get() / 1000000;
LOG.info("For Slab of size " + this.blockSize + ": "
+ this.getOccupiedSize() / this.blockSize
+ " occupied, out of a capacity of " + this.numBlocks
+ " blocks. HeapSize is "
+ StringUtils.humanReadableInt(this.heapSize()) + " bytes.");
+ StringUtils.humanReadableInt(this.heapSize()) + " bytes." + ", "
+ "churnTime=" + StringUtils.formatTime(milliseconds));
LOG.debug("Slab Stats: " + "accesses="
+ stats.getRequestCount()
@ -292,9 +301,11 @@ public class SingleSizeCache implements BlockCache {
final CacheableDeserializer<Cacheable> deserializer;
final ByteBuffer serializedData;
final ReentrantReadWriteLock evictionLock;
AtomicLong recentlyAccessed;
private CacheablePair(CacheableDeserializer<Cacheable> deserializer,
ByteBuffer serializedData) {
this.recentlyAccessed = new AtomicLong();
this.deserializer = deserializer;
this.serializedData = serializedData;
evictionLock = new ReentrantReadWriteLock();

View File

@ -175,6 +175,8 @@ public class SlabCache implements SlabItemEvictionWatcher, BlockCache, HeapSize
}
private void addSlab(int blockSize, int numBlocks) {
LOG.info("Creating a slab of blockSize " + blockSize + " with " + numBlocks
+ " blocks.");
sizer.put(blockSize, new SingleSizeCache(blockSize, numBlocks, this));
}
@ -332,8 +334,8 @@ public class SlabCache implements SlabItemEvictionWatcher, BlockCache, HeapSize
static class SlabStats {
// the maximum size somebody will ever try to cache, then we multiply by 10
// so we have finer grained stats.
private final int MULTIPLIER = 10;
private final int NUMDIVISIONS = (int) (Math.log(Integer.MAX_VALUE) * MULTIPLIER);
final int MULTIPLIER = 10;
final int NUMDIVISIONS = (int) (Math.log(Integer.MAX_VALUE) * MULTIPLIER);
private final AtomicLong[] counts = new AtomicLong[NUMDIVISIONS];
public SlabStats() {
@ -351,24 +353,27 @@ public class SlabCache implements SlabItemEvictionWatcher, BlockCache, HeapSize
return counts;
}
double getUpperBound(int index) {
return Math.pow(Math.E, ((double) (index + 0.5) / (double) MULTIPLIER));
}
double getLowerBound(int index) {
return Math.pow(Math.E, ((double) (index - 0.5) / (double) MULTIPLIER));
}
public void logStats(SlabCache slabCache) {
for (SingleSizeCache s : slabCache.sizer.values()) {
s.logStats();
}
AtomicLong[] fineGrainedStats = getUsage();
int multiplier = MULTIPLIER;
SlabCache.LOG.info("Current heap size is: "
+ StringUtils.humanReadableInt(slabCache.heapSize()));
for (int i = 0; i < fineGrainedStats.length; i++) {
double lowerbound = Math.pow(Math.E,
((double) i / (double) multiplier) - 0.5);
double upperbound = Math.pow(Math.E,
((double) i / (double) multiplier) + 0.5);
if (fineGrainedStats[i].get() > 0) {
SlabCache.LOG.info("From "
+ StringUtils.humanReadableInt((long) lowerbound) + "- "
+ StringUtils.humanReadableInt((long) upperbound) + ": "
+ StringUtils.humanReadableInt((long) getLowerBound(i)) + "- "
+ StringUtils.humanReadableInt((long) getUpperBound(i)) + ": "
+ StringUtils.humanReadableInt(fineGrainedStats[i].get())
+ " requests");

View File

@ -22,6 +22,7 @@ package org.apache.hadoop.hbase.io.hfile.slab;
import org.apache.hadoop.conf.Configuration;
import org.apache.hadoop.hbase.io.hfile.CacheTestUtils;
import org.apache.hadoop.hbase.io.hfile.slab.SlabCache;
import org.apache.hadoop.hbase.io.hfile.slab.SlabCache.SlabStats;
import org.junit.After;
import org.junit.Before;
import org.junit.Test;
@ -80,4 +81,13 @@ public class TestSlabCache {
public void testCacheMultiThreadedSingleKey() throws Exception {
CacheTestUtils.hammerSingleKey(cache, BLOCK_SIZE, NUM_THREADS, NUM_QUERIES);
}
@Test
/*Just checks if ranges overlap*/
public void testStatsArithmetic(){
SlabStats test = cache.requestStats;
for(int i = 0; i < test.NUMDIVISIONS; i++){
assert(test.getUpperBound(i) < test.getLowerBound(i + 1));
}
}
}