Recent changes to Home

WikiPage Home modified by Hitesh Amritlal Viseria

Hitesh Amritlal Viseria — Mon, 07 May 2012 17:22:55 -0000

--- v19 
+++ v20 
@@ -59,7 +59,6 @@
 Note
 ------
 1. NitroCache uses hashCode() and equals() methods internally for storing and retrieving data. Hence its necessary for Key to have proper hashCode and equals implementation.
-2. Only put(key,value) and get(Key) are supported for now
-3. FIFO setting is much faster then LRU setting
-4. NitroCache is completely thread-safe and meant for use in multi-threaded system. 
-5. There is no serialization or cloning involved and both key and value are stored as references. 
+2. FIFO setting is slightly more fast then LRU setting
+3. NitroCache is completely thread-safe and meant for use in multi-threaded system. 
+4. There is no serialization or cloning involved and both key and value are stored as references.

WikiPage Home modified by Hitesh Amritlal Viseria

Hitesh Amritlal Viseria — Tue, 01 May 2012 14:47:23 -0000

--- v18 
+++ v19 
@@ -14,7 +14,7 @@
 ----------
 NitroCache is a 100% pure java in-memory cache. It is designed with an aim to provide high throughput, extremely fast and scalable cache api. It uses concepts of B-tree, Hashing and Skiplist to optimize performance. Result is, its one of the fastest in-memory cache in java providing constant time fetches. 
 
-Stable as Nitrogen, give your application a N2O boost
+A simple, consistent and high-performance cache to boost system performance.
 
 
 Why another cache

WikiPage Home modified by Hitesh Amritlal Viseria

Hitesh Amritlal Viseria — Mon, 30 Apr 2012 15:05:54 -0000

--- v17 
+++ v18 
@@ -54,7 +54,7 @@
 
 Performance
 ------------
-See [Performance][Performance] section for details
+See [Performance]section for details
 
 Note
 ------

WikiPage Home modified by Hitesh Amritlal Viseria

Hitesh Amritlal Viseria — Mon, 30 Apr 2012 15:05:22 -0000

--- v16 
+++ v17 
@@ -50,6 +50,12 @@
 LRU| Standard Least Recently Used algorithm|If LRU provides more hits|
 
 
+
+
+Performance
+------------
+See [Performance][Performance] section for details
+
 Note
 ------
 1. NitroCache uses hashCode() and equals() methods internally for storing and retrieving data. Hence its necessary for Key to have proper hashCode and equals implementation.

WikiPage Home modified by Hitesh Amritlal Viseria

Hitesh Amritlal Viseria — Mon, 30 Apr 2012 15:01:34 -0000

--- v15 
+++ v16 
@@ -32,13 +32,13 @@
 
 Sample Usage
 ------------
-:::::::::::java
+~~~~~~~~~~~~~~~~~~~~~
 NitroCache _cache = null;
 // Every call to NitroCache.getInstance will create new cache. Its not singleton
 _cache = NitroCache.getInstance(5000, CacheEviction.FIFO); 
 _cache.put("1000","hello world");
 System.out.println(_cache.get("1000");
-~~~~~~~~~~~~~~
+~~~~~~~~~~~~~~~~~~~~~
 
 
 Eviction Modes

WikiPage Home modified by Hitesh Amritlal Viseria

Hitesh Amritlal Viseria — Mon, 30 Apr 2012 14:58:50 -0000

--- v14 
+++ v15 
@@ -32,7 +32,7 @@
 
 Sample Usage
 ------------
-~~~~~~~~~~~~~~
+:::::::::::java
 NitroCache _cache = null;
 // Every call to NitroCache.getInstance will create new cache. Its not singleton
 _cache = NitroCache.getInstance(5000, CacheEviction.FIFO);

WikiPage Home modified by Hitesh Amritlal Viseria

Hitesh Amritlal Viseria — Thu, 26 Apr 2012 15:28:20 -0000

--- v13 
+++ v14 
@@ -28,18 +28,26 @@
 2. 100% Pure Java, in-memory
 3. Extremely light weight, with no need of any external library
 4. Simple to configure and use
-5. Available with FIFO and LRU modes
-
+5. Available with FIFO, FIFO_V2 and LRU modes
+
 Sample Usage
 ------------
 ~~~~~~~~~~~~~~
 NitroCache _cache = null;
 // Every call to NitroCache.getInstance will create new cache. Its not singleton
 _cache = NitroCache.getInstance(5000, CacheEviction.FIFO); 
 _cache.put("1000","hello world");
 System.out.println(_cache.get("1000");
 ~~~~~~~~~~~~~~
 
+
+Eviction Modes
+---------------
+Mode|Description|Suggested Usage|
+----|-----------|---------------|
+FIFO|Standard First-in-first-out algorithm. put(key,null) will remove the entry and compacts cache. Adding same key/value again moves the entry to end.|Frequent removal and re-entry of key/values|
+FIFO_V2|Optimized for speed FIFO. put(key,null) removes entry but does not immediately compact cache. Adding same key/value again does not change order of entry in FIFO queue|Less frequent removal/replace of values for keys. High throughput.|
+LRU| Standard Least Recently Used algorithm|If LRU provides more hits|
 
 
 Note

WikiPage Home modified by Hitesh Amritlal Viseria

Hitesh Amritlal Viseria — Thu, 26 Apr 2012 14:10:24 -0000

--- v12 
+++ v13 
@@ -34,10 +34,12 @@
 ------------
 ~~~~~~~~~~~~~~
 NitroCache _cache = null;
-_cache = NitroCache.getInstance(5000, CacheEviction.FIFO);
+// Every call to NitroCache.getInstance will create new cache. Its not singleton
+_cache = NitroCache.getInstance(5000, CacheEviction.FIFO); 
 _cache.put("1000","hello world");
 System.out.println(_cache.get("1000");
 ~~~~~~~~~~~~~~
+
 
 
 Note

WikiPage Home modified by Hitesh Amritlal Viseria

Hitesh Amritlal Viseria — Wed, 25 Apr 2012 14:35:55 -0000

--- v11 
+++ v12 
@@ -16,6 +16,12 @@
 
 Stable as Nitrogen, give your application a N2O boost
 
+
+Why another cache
+-----------------
+Under load, performance of most caches degrades linearly or exponentially with increase in number of concurrent threads. Because NitroCache uses lock-free algorithm for fetching data, the performance is almost constant with any number of threads. 
+
+
 Features
 --------
 1. Extremely fast, fetch operations execute at constant time, O(c), irrespective of number of threads or cache size

WikiPage Home modified by Hitesh Amritlal Viseria

Hitesh Amritlal Viseria — Sun, 22 Apr 2012 16:30:11 -0000

--- v10 
+++ v11 
@@ -39,4 +39,5 @@
 1. NitroCache uses hashCode() and equals() methods internally for storing and retrieving data. Hence its necessary for Key to have proper hashCode and equals implementation.
 2. Only put(key,value) and get(Key) are supported for now
 3. FIFO setting is much faster then LRU setting
-4. NitroCache is completely thread-safe and meant for use in multi-threaded system.  
+4. NitroCache is completely thread-safe and meant for use in multi-threaded system. 
+5. There is no serialization or cloning involved and both key and value are stored as references.