All Downloads are FREE. Search and download functionalities are using the official Maven repository.

javax.cache.management.CacheStatisticsMXBean Maven / Gradle / Ivy

There is a newer version: 1.1.1
Show newest version
/**
 *  Copyright (c) 2011-2013 Terracotta, Inc.
 *  Copyright (c) 2011-2013 Oracle and/or its affiliates.
 *
 *  All rights reserved. Use is subject to license terms.
 */

package javax.cache.management;

import javax.management.MXBean;

/**
 * Cache statistics.
 * 

* Statistics are accumulated from the time a cache is created. They can be reset * to zero using {@link #clear}. *

* There are no defined consistency semantics for statistics. Refer to the * implementation for precise semantics. *

* Each cache's statistics object must be registered with an ObjectName that is * unique and has the following type and attributes: *

* Type: * javax.cache:type=CacheStatistics *

* Required Attributes: *

    *
  • CacheManager the URI of the CacheManager *
  • Cache the name of the Cache *
* * @author Greg Luck * @since 1.0 */ @MXBean public interface CacheStatisticsMXBean { /** * Clears the statistics counters to 0 for the associated Cache. */ void clear(); /** * The number of get requests that were satisfied by the cache. *

* In a caches with multiple tiered storage, a hit may be implemented as a hit * to the cache or to the first tier. * * @return the number of hits */ long getCacheHits(); /** * This is a measure of cache efficiency. *

* It is calculated as: * {@link #getCacheHits} divided by {@link #getCacheGets ()} * 100. * * @return the percentage of successful hits, as a decimal e.g 75. */ float getCacheHitPercentage(); /** * A miss is a get request which is not satisfied. *

* In a simple cache a miss occurs when the cache does not satisfy the request. *

* In a caches with multiple tiered storage, a miss may be implemented as a miss * to the cache or to the first tier. *

* In a read-through cache a miss is an absence of the key in the cache which * will trigger a call to a CacheLoader. So it is still a miss even though the * cache will load and return the value. *

* Refer to the implementation for precise semantics. * * @return the number of misses */ long getCacheMisses(); /** * Returns the percentage of cache accesses that did not find a requested entry * in the cache. *

* This is calculated as {@link #getCacheMisses()} divided by * {@link #getCacheGets()} * 100. * * @return the percentage of accesses that failed to find anything */ float getCacheMissPercentage(); /** * The total number of requests to the cache. This will be equal to the sum of * the hits and misses. *

* A "get" is an operation that returns the current or previous value. It does * not include checking for the existence of a key. *

* In a caches with multiple tiered storage, a gets may be implemented as a get * to the cache or to the first tier. * * @return the number of gets */ long getCacheGets(); /** * The total number of puts to the cache. *

* A put is counted even if it is immediately evicted. *

* Replaces, where a put occurs which overrides an existing mapping is counted * as a put. * * @return the number of hits */ long getCachePuts(); /** * The total number of removals from the cache. This does not include evictions, * where the cache itself initiates the removal to make space. * * @return the number of hits */ long getCacheRemovals(); /** * The total number of evictions from the cache. An eviction is a removal * initiated by the cache itself to free up space. An eviction is not treated as * a removal and does not appear in the removal counts. * * @return the number of evictions from the cache */ long getCacheEvictions(); /** * The mean time to execute gets. *

* In a read-through cache the time taken to load an entry on miss is not * included in get time. * * @return the time in µs */ float getAverageGetTime(); /** * The mean time to execute puts. * * @return the time in µs */ float getAveragePutTime(); /** * The mean time to execute removes. * * @return the time in µs */ float getAverageRemoveTime(); }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy