872
95%
master: 100%

Ran 30 Mar 2015 08:49PM UTC

Jobs 1

Files 65

Run time 14s

Badge

Embed ▾

pending completion

Build # 872

Build Type

push

travis-ci

Committed by

ben-manes

Commit Message

Dynamically size the read buffer based on contention

Previously the read buffer consisted of a fixed number of segments, each
consisting of a bounded ring buffer. This provided performance under heavy
load, at the cost of high memory when the cache was created. For caches that
are not heavily contended this is wasteful, especially when many are constructed.

This fixed cost is replaced with a dynamic approach, which starts at a single
buffer and expands as needed. The upper limit results in the same number of
read buffers, but only under high load. This dramatically reduces memory usage.

The approach is based on j.u.c.Striped64, which provides the mechanism for
Java's high performance 64-bit atomic counters.

Run Details

3960 of 4155 relevant lines covered (95.31%)

0.95 hits per line

Jobs

ID	Job ID	Ran	Files	Coverage
1	872.1 (TERM=dumb)	30 Mar 2015 08:49PM UTC	0	95.31	Travis Job 872.1

Source Files on build 872

Detailed source file information is not available for this build.

ben-manes / caffeine / 872
95%
master: 100%

README BADGES
x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 872

ben-manes / caffeine / 872 95% master: 100%

README BADGES x

Markdown

Textile

RDoc

HTML

Rst

Jobs

Source Files on build 872

ben-manes / caffeine / 872
95%
master: 100%

README BADGES
x