All Classes
-
All Classes Interface Summary Class Summary Enum Summary Class Description AbstractCondition Created by jcairns on 12/11/14.AbstractSpinningCondition Created by jcairns on 2/18/16.AbstractWaitingCondition Created by jcairns on 12/11/14.BlockingStack<N> Created by jcairns on 2/16/16.Capacity Created by jcairns on 7/12/2018ConcurrentQueue<E> A very high performance blocking buffer, based on Disruptor approach to queues Created by jcairns on 5/28/14.ConcurrentStack<N> Concurrent "lock-free" version of a stack.Condition ContendedAtomicInteger Avoid false cache line sharing Created by jcairns on 5/28/14.ContendedAtomicLong Avoid false cache line sharing Created by jcairns on 5/28/14.DisruptorBlockingQueue<E> This is a lock free blocking queue that implements a fixed length queue backed by a ring buffer.FixedStack<N> A very high performance stack to replace java.util.Stack.MPMCBlockingQueue<E> Alternative implementation for benchmarking purposesMPMCConcurrentQueue<E> Dmitry Vyukov, Bounded MPMC queue - http://www.1024cores.net/home/lock-free-algorithms/queues/bounded-mpmc-queue Added for benchmarking and comparison.MPMCConcurrentQueue.Cell<R> MultithreadConcurrentQueue<E> This is the disruptor implemented for multiple simultaneous reader and writer threads.OptimisticLock Created by jcairns on 2/12/16.Percentile Implementation of "Simulatenous Estimation of Several Persentiles," by Kimmo E.PercentileFile Created by jcairns on 3/4/15.PushPullBlockingQueue<E> Single thread implementation of disruptorPushPullConcurrentQueue<E> Tuned version of Martin Thompson's push pull queue Transfers from a single thread writer to a single thread reader are orders of nanoseconds (3-5) This code is optimized and tested using a 64bit HotSpot JVM on an Intel x86-64 environment.SequenceLock http://www.hpl.hp.com/techreports/2012/HPL-2012-68.pdf Created by jcairns on 2/12/16.SpinPolicy Three SpinPolicy values are supported.Stack<N> Created by jcairns on 6/11/14.