Package EDU.oswego.cs.dl.util.concurrent

Overview of package util.concurrent Release 1.3.4.


Interface Summary
Barrier Barriers serve as synchronization points for groups of threads that must occasionally wait for each other.
BoundedChannel A channel that is known to have a capacity, signifying that put operations may block when the capacity is reached.
Callable Interface for runnable actions that bear results and/or throw Exceptions.
Channel Main interface for buffers, queues, pipes, conduits, etc.
Executor Interface for objects that execute Runnables, as well as various objects that can be wrapped as Runnables.
ObservableSync.SyncObserver Interface for objects that observe ObservableSyncs.
PooledExecutor.BlockedExecutionHandler Class for actions to take when execute() blocks.
Puttable This interface exists to enable stricter type checking for channels.
ReadWriteLock ReadWriteLocks maintain a pair of associated locks.
Rendezvous.RendezvousFunction Interface for functions run at rendezvous points
Sync Main interface for locks, gates, and conditions.
Takable This interface exists to enable stricter type checking for channels.
ThreadFactory Interface describing any class that can generate new Thread objects.

Class Summary
BoundedBuffer Efficient array-based bounded buffer class.
BoundedLinkedQueue A bounded variant of LinkedQueue class.
BoundedPriorityQueue A heap-based priority queue, using semaphores for concurrency control.
ClockDaemon A general-purpose time-based daemon, vaguely similar in functionality to common system-level utilities such as at (and the associated crond) in Unix.
ConcurrentHashMap A version of Hashtable supporting concurrency for both retrievals and updates: Retrievals Retrievals may overlap updates.
ConcurrentHashMap.Entry ConcurrentHashMap collision list entry.
ConcurrentHashMap.Segment Bookkeeping for each concurrency control segment.
ConcurrentReaderHashMap A version of Hashtable that supports mostly-concurrent reading, but exclusive writing.
ConcurrentReaderHashMap.BarrierLock A Serializable class for barrier lock
ConcurrentReaderHashMap.Entry ConcurrentReaderHashMap collision list entry.
CondVar This class is designed for fans of POSIX pthreads programming.
CopyOnWriteArrayList This class implements a variant of java.util.ArrayList in which all mutative operations (add, set, and so on) are implemented by making a fresh copy of the underlying array.
CopyOnWriteArraySet This class implements a java.util.Set that uses a CopyOnWriteArrayList for all of its operations.
CountDown A CountDown can serve as a simple one-shot barrier.
CyclicBarrier A cyclic barrier is a reasonable choice for a barrier in contexts involving a fixed sized group of threads that must occasionally wait for each other.
DefaultChannelCapacity A utility class to set the default capacity of BoundedChannel implementations that otherwise require a capacity argument
DirectExecutor An implementation of Executor that invokes the run method of the supplied command and then returns.
FIFOReadWriteLock This class implements a policy for reader/writer locks in which threads contend in a First-in/First-out manner for access (modulo the limitations of FIFOSemaphore, which is used for queuing).
FIFOSemaphore A First-in/First-out implementation of a Semaphore.
FIFOSemaphore.FIFOWaitQueue Simple linked list queue used in FIFOSemaphore.
FJTask Abstract base class for Fork/Join Tasks.
FJTask.Par A new Par, when executed, runs the tasks provided in the constructor in parallel using coInvoke(tasks).
FJTask.Par2 A new Par(task1, task2), when executed, runs task1 and task2 in parallel using coInvoke(task1, task2).
FJTask.Seq A new Seq, when executed, invokes each task provided in the constructor, in order.
FJTask.Seq2 A new Seq2(task1, task2), when executed, invokes task1 and then task2, in order.
FJTask.Wrap A FJTask that holds a Runnable r, and calls when executed.
FJTaskRunner Specialized Thread subclass for running FJTasks.
FJTaskRunner.VolatileTaskRef An object holding a single volatile reference to a FJTask.
FJTaskRunnerGroup A stripped down analog of a ThreadGroup used for establishing and managing FJTaskRunner threads.
FJTaskRunnerGroup.InvokableFJTask Wrap wait/notify mechanics around a task so that invoke() can wait it out
FutureResult A class maintaining a single reference variable serving as the result of an operation.
Heap A heap-based priority queue, without any concurrency control (i.e., no blocking on empty/full states).
Latch A latch is a boolean condition that is set at most once, ever.
LayeredSync A class that can be used to compose Syncs.
LinkedNode A standard linked list node used in various queue classes
LinkedQueue A linked list based channel implementation.
LockedExecutor An implementation of Executor that invokes the run method of the supplied command within a synchronization lock and then returns.
Mutex A simple non-reentrant mutual exclusion lock.
NullSync A No-Op implementation of Sync.
ObservableSync The ObservableSync class performs no synchronization itself, but invokes event-style messages to other observer objects upon invocation of Sync methods.
PooledExecutor A tunable, extensible thread pool class.
PrioritySemaphore A Semaphore that grants requests to threads with higher Thread priority rather than lower priority when there is contention.
PropertyChangeMulticaster This class is interoperable with java.beans.PropertyChangeSupport, but relies on a streamlined copy-on-write scheme similar to that used in CopyOnWriteArrayList.
QueuedExecutor An implementation of Executor that queues incoming requests until they can be processed by a single background thread.
QueuedSemaphore Abstract base class for semaphores relying on queued wait nodes.
QueuedSemaphore.WaitQueue Base class for internal queue classes for semaphores, etc.
ReaderPreferenceReadWriteLock A ReadWriteLock that prefers waiting readers over waiting writers when there is contention.
ReentrantLock A lock with the same semantics as builtin Java synchronized locks: Once a thread has a lock, it can re-obtain it any number of times without blocking.
ReentrantWriterPreferenceReadWriteLock A writer-preference ReadWriteLock that allows both readers and writers to reacquire read or write locks in the style of a ReentrantLock.
Rendezvous A rendezvous is a barrier that: Unlike a CyclicBarrier, is not restricted to use with fixed-sized groups of threads.
Rendezvous.Rotator The default rendezvous function.
Semaphore Base class for counting semaphores.
SemaphoreControlledChannel Abstract class for channels that use Semaphores to control puts and takes.
Slot A one-slot buffer, using semaphores to control access.
SyncCollection SyncCollections wrap Sync-based control around java.util.Collections.
SynchronizedBoolean A class useful for offloading synch for boolean instance variables.
SynchronizedByte A class useful for offloading synch for byte instance variables.
SynchronizedChar A class useful for offloading synch for char instance variables.
SynchronizedDouble A class useful for offloading synch for double instance variables.
SynchronizedFloat A class useful for offloading synch for float instance variables.
SynchronizedInt A class useful for offloading synch for int instance variables.
SynchronizedLong A class useful for offloading synch for long instance variables.
SynchronizedRef A simple class maintaining a single reference variable that is always accessed and updated under synchronization.
SynchronizedShort A class useful for offloading synch for short instance variables.
SynchronizedVariable Base class for simple, small classes maintaining single values that are always accessed and updated under synchronization.
SynchronousChannel A rendezvous channel, similar to those used in CSP and Ada.
SynchronousChannel.Queue Simple FIFO queue class to hold waiting puts/takes.
SyncList SyncLists wrap Sync-based control around java.util.Lists.
SyncMap SyncMaps wrap Sync-based control around java.util.Maps.
SyncSet SyncSets wrap Sync-based control around java.util.Sets.
SyncSortedMap SyncSortedMaps wrap Sync-based control around java.util.SortedMaps.
SyncSortedSet SyncSortedSets wrap Sync-based control around java.util.SortedSets.
ThreadedExecutor An implementation of Executor that creates a new Thread that invokes the run method of the supplied command.
ThreadFactoryUser Base class for Executors and related classes that rely on thread factories.
TimedCallable TimedCallable runs a Callable function for a given length of time.
TimeoutSync A TimeoutSync is an adaptor class that transforms all calls to acquire to instead invoke attempt with a predetermined timeout value.
VetoableChangeMulticaster This class is interoperable with java.beans.VetoableChangeSupport, but relies on a streamlined copy-on-write scheme similar to that used in CopyOnWriteArrayList.
WaitableBoolean A class useful for offloading synch for boolean instance variables.
WaitableByte A class useful for offloading waiting and signalling operations on single byte variables.
WaitableChar A class useful for offloading waiting and signalling operations on single char variables.
WaitableDouble A class useful for offloading waiting and signalling operations on single double variables.
WaitableFloat A class useful for offloading waiting and signalling operations on single float variables.
WaitableInt A class useful for offloading waiting and signalling operations on single int variables.
WaitableLong A class useful for offloading waiting and signalling operations on single long variables.
WaitableRef A class useful for offloading synch for Object reference instance variables.
WaitableShort A class useful for offloading waiting and signalling operations on single short variables.
WaiterPreferenceSemaphore An implementation of counting Semaphores that enforces enough fairness for applications that need to avoid indefinite overtaking without necessarily requiring FIFO ordered access.
WaitFreeQueue A wait-free linked list based queue implementation.
WaitFreeQueue.Node List nodes for Queue
WriterPreferenceReadWriteLock A ReadWriteLock that prefers waiting writers over waiting readers when there is contention.

Exception Summary
BrokenBarrierException Thrown by Barrier upon interruption of participant threads
TimeoutException Thrown by synchronization classes that report timeouts via exceptions.

Package EDU.oswego.cs.dl.util.concurrent Description

Overview of package util.concurrent Release 1.3.4.

by Doug Lea

Note: Upon release of J2SE 1.5, this package enters maintenance mode: Only essential corrections will be released. JDK1.5 package java.util.concurrent includes improved, more efficient, standardized versions of the main components in this package. Please plan to convert your applications to use them. (A few niche classes here have no equivalents in java.util.concurrent. They will become part of a follow-up add-on package that will also include other unstandardized classes.)

This package provides standardized, efficient versions of utility classes commonly encountered in concurrent Java programming. This code consists of implementations of ideas that have been around for ages, and is merely intended to save you the trouble of coding them. Discussions of the rationale and applications of several of these classes can be found in the second edition of Concurrent Programming in Java. There are also pdf slides providing an overview of the package.

The package mainly consists of implementations of a few interfaces:

Plus some utilities and frameworks that build upon these.

If you arrived at page
following links from your local documentation, please check the version number and get an update if you are running an outdated version.


This package, currently declared as
is available in (tar.gz format) or (zip format).

It is currently distributed in source form only. To build it, use a Java 1.2+ compiler to:

Or use this ant build file donated by Travell Perkins.

The classes in the misc directory can be built the same way.

To use it, add to java files:

  import EDU.oswego.cs.dl.util.concurrent.*

You can also create a jar or zip file of the compiled classes and add them to your classpath.

All documentation except for this file was produced by javadoc, which places some index and summary files outside the current directory. This can cause some broken links on unpacked versions. You can avoid this, and integrate with your local javadoc-produced documentation by running:

  javadoc -public -d [BASE OF SOME JAVADOC PATH] *.java


Interface for classes used as exclusion, resource management, and related synchronization aids, supporting methods acquire, attempt(msecs), and release.


Default implementation of Semaphores, providing no special ordering guarantees.
Provides protection against barging (infinite overtaking)
Provides first-in/first-out ordering
Prefers notifications to higher-priority threads
Basic non-reentrant mutual exclusion lock
Java-style per-thread mutual exclusion lock
A condition that is acquirable forever more after the first release
A condition that is acquirable forever more after the nth release.

The following implementation classes do not themselves perform any synchronization, but serve as adaptors, glue, and extensibility hooks for those that do. They may also be helpful when using Syncs in generic before/after constructions:

A no-op implementation: acquire and attempt always succeed.
Routes all calls to acquire to use attempt with a predefined timeout value.
Cascades operations of two Syncs
Issues calls to SyncObservers upon each acquire and release.

Related Classes

Support for POSIX (pthreads) style condition variables
A standardized time-out exception class

Interface for pairs of locks, one for reading, and one for writing.


The most useful and common policy
Allows multiple lock holds as well as lock downgrading by writers.
Prefers waiting readers to waiting writers.
Prefers earliest threads (whether readers or writers).

Synchronization points for groups of threads.


A tool to force multiple threads to synchronize at a given point
A cyclic barrier that does not rely on there being a predetermined number of participant threads, and allows threads to exchange information at each barrier point.

Related Classes

A standardized exception for barrier synchronization failures

Interface for queues, buffers, conduits and pipes supporting blocking put and take, as well as timeout-based offer and poll. To assist efforts to use channels with somewhat greater type safety, Channel is defined as a subinterface of Puttable and Takable, each defining only one side of the channel. Also, the BoundedChannel subinterface is used for channels with finite capacities.


An unbounded linked-list-based queue. This is usually the best choice for a general-purpose queue.
A linked queue with a capacity bound
An array-based bounded buffer
A one-slot bounded buffer. (Note that this can also serve as a restricted form of Synchronized variable.)
A zero-slot CSP/Ada-style channel in which every put must wait for a take, and vice versa.
A channel based on a Heap data structure. Elements must either be Comparable, or comparable using a supplied Comparator
An unbounded linked-list-based queue relying on atomic commits and retries rather than wait/notify.

Related Classes

A utility class that makes it easier to set default capacities for channels that have a capacity that must otherwise be set in constructors.

Interface for objects that execute Runnable commands.


An implementation that just directly runs command in current thread.
An implementation that directly runs command within a supplied Sync lock in current thread.
An implementation that runs each command in a new thread.
An implementation that queues commands for execution by a single background thread.
A tunable, extensible thread pool class

Related classes

Interface for runnable actions that return results
Holder for results of actions that can be set by Callables.
Interface for objects that create Thread objects
Convenient base for classes that use ThreadFactories.
A utility for executing commands at given times, after given delays, or periodically with given cycles.
Invokes a Callable in its own thread, but cancels it if not completed by a given maximum time.

Fork/Join Tasks
A fast lightweight task framework built upon Java threads, and geared for parallel computation.
Abstract Base class for tasks.
Control class for running Tasks.
Underlying specialized Thread subclass for running Tasks.
Demos and examples
A directory of sample programs that use the Task framework. (See also a paper on the design and performance of this framework.)

Implementations of java.util.Collection and related classes that can help solve concurrency problems.
An analog of java.util.Hashtable that allows retrievals during updates.
An analog of java.util.Hashtable that allows both concurrent retrievals and concurrent updates.
A copy-on-write analog of java.util.ArrayList
A java.util.Set based on CopyOnWriteArrayList.
A wrapper class placing either Syncs or ReadWriteLocks around java.util.Collection
A wrapper around java.util.Set
A wrapper around java.util.SortedSet
A wrapper around java.util.List
A wrapper around java.util.Map
A wrapper around java.util.SortedMap
Related classes
A copy-on-write replacement for java.beans.PropertyChangeSupport
A copy-on-write replacement for java.beans.VetoableChangeSupport

Simple synchronized analogs of Number and Ref classes in java.lang. Each has a subclass that in addition to maintaining synchronization, also provides notifications upon value changes and supports guarded waits.

There are some classes in the misc directory that might be of interest but aren't really part of this package. They include: If you would like to contribute other related classes, demos, usage examples, etc., please contact me. People frequently write me asking for such things.


Some Questions and Answers about Design and Implementation

Isn't it annoying that so many methods throw InterruptedException?
Maybe, but synchronization points are among the best points to detect interruption. Since this a package of synchronization aids, most methods detect interruption as early and often as reasonable to help avoid becoming stuck when the thread should be stopping anyway. In particular, interruption is normally checked before trying to obtain locks used in Syncs, which minimizes the vulnerability window for getting stuck when an activity is cancelled. (Between this and the finite durations that internal java synchronization locks are held in Sync classes, it is normally impossible for threads to become stuck waiting on internal locks when they have been interrupted.) These classes fail cleanly upon interruption. Normally, all you need to do upon catching an InterruptedException is either rethrow it, or clean up and then set Thread.currentThread().interrupt() to propagate status.

If you need to invoke such methods even when the thread is in an interrupted state (for example, during recovery actions) you can do:

  void quietlyAcquire(Sync sync) {
    boolean wasInterrupted = Thread.interrupted(); // record and clear
    for (;;) {
      try {
        sync.acquire();   // or any other method throwing InterruptedException
      catch (InterruptedException ex) { // re-interrupted; try again
        wasInterrupted = true;
    if (wasInterrupted) {              // re-establish interrupted state

The heavy use of InterruptedException makes it possible to write very responsive and robust code, at the expense of forcing class and method authors to contemplate possible exception handling actions at each interruption (and time-out) point. See the CPJ supplement page on cancellation for more discussion of some associated design issues.

Why is there so much near-duplication of code?
You'd think there would be some nice way to unify more classes to share significant aspects of synchronization mechanics. But standard lines of attack for doing this turn out unsatisfying at best. The main reason for creating this package is that even simple classes involving concurrency control mechanics are sometimes tedious, repetitive, tricky, and/or error-prone to write, so it is nice to have them written already.

Why do most methods return false/null after timeouts rather than throwing TimeoutException?
Because I think it would normally be misleading to throw exceptions. In Java, timeout arguments merely provide hints about when threads should be woken to check out the state of the world. Due to scheduling delays, threads need not resume immediately after their timeouts elapse, so real-time-based timeout exceptions would not be appropriate. The simplest course of action is just to report whether the condition the thread is waiting for does hold after waiting for at least this period. Returning false/null is not necessarily an exceptional situation. In those classes where it is exceptional (in some classes layered on top of basic Syncs and Channels) failed timeouts are converted to TimeoutExceptions. You can do the same in your own code using these classes. As of version 1.1.0, this is made simpler to carry out, since TimeoutException now extends InterruptedException.

Why aren't there deadlock-detecting Syncs or related classes for detecting lockups?
Because timeouts appear to be more generally useful. In fact, it is hard to imagine contexts where deadlock detection is a better option than timeouts in Java. A timeout can serve as a heuristic deadlock detection device, but can also serve to detect stalled IO, network partitions, and related failures. Program responses to deadlock are hardly ever different than responses to these other failures. So, it is usually a good idea to use timeouts as general-purpose heuristic detectors for all liveness problems, subdividing responses to particular failures (for example, by subclassing TimeoutException), only when necessary. Additionally, there are two problems with implementing deadlock-detecting Syncs that make them unattractive choices: (1) They can only detect deadlock among uses of the particular Sync classes being used, so cannot deal with deadlocks involving builtin synchronization (2) lock cycle detection adds overhead to each lock acquire and release. The main context in which deadlock detection would be useful is during program debugging, but here, it would be better to rely on specially instrumented JVMs. (Note that it is easy to transform code that relies on acquire to instead use timeouts via the TimeoutSync class. This can be a good way to make code more robust with respect to locking problems.)

Why isn't there a distinct Lock or MutualExclusionLock interface?
Because many objects implementing the Sync interface can be used as locks if they are in appropriate states, but not all of them can always be used as such. Additionally, there are several senses of mutual exclusion (for example, reentrant vs non-reentrant, full vs read/write). Since there is no way to say that a given class only sometimes conforms to the intended sense of a subinterface, the flexibility and simplicity of only using a single principle interface (Sync) for all such types outweighs the potential advantages of finer-grained categorizations.

Why do so many methods perform notify within InterruptedException catches?
Because when notify's and interrupt's happen at about the same time, JVMs are currently free to treat them independently, so a notified thread could return out as interrupted. In classes using notify rather than notifyAll, the extra notify in the catch clause is a safeguard to ensure that a non-interrupted thread, if one exists, will be notified. See my CPJ book for more details.

How efficient are these classes?
Most of these classes use the most efficient implementations I know of for general-purpose concurrent programming, yet also try to be conservative about differences across common JVMs, and to minimize surprising limitations and side-effects. This is always a bit of a trade-off though. Some could be made more efficient at the cost of supporting fewer operations, relying on properties of particular JVMs, or having more usage constraints. Conversely some could support more contexts or operations, or simpler usage, at the cost of efficiency.

You will almost surely trade off some cost in efficiency for the flexibility of using Syncs and classes built out of them rather than built-in synchronized method/block locks. On some JVMs the cost is very low. (You can check approximate impact using SynchronizationTimer.) But, while Java VMs are getting much faster about synchronized locks, most of the classes in this package rely heavily on wait/notify and interruption mechanics, which are not currently as heavily optimized. (Also, they seem to be subject to more variation in behavior than other Java constructs.) Class implementations generally ignore the fact that the JVM overhead for these operations might be slower than you'd wish they were on some JVMs.

Are there any programming errors?
I don't believe so. Please try to prove me wrong. If you are the first person to discover a particular coding error in a current release, I'll send you a free copy of my CPJ book. Also, I would greatly appreciate receiving any sample applications that can help serve as useful tests, so as to build up a more extensive test suite.

Should I worry about the use of volatile in these classes?
Many JVMs are known not to correctly implement the JLS spec (either the original or the upcoming revision) for volatile fields. However, volatiles are used in conservative ways in this package, that don't encounter problems at least on recent Sun and IBM JVMs.

Why do classes declare practically all internal matters as protected?
While probably 99% of the uses of these classes should just treat them as black-box utility components, these classes are intended to be extensible, to allow more specialized synchronization control to be customized for different applications. However, it takes a lot of expertise to extend or modify most of them via subclassing. If you do try to extend, consider first running javadoc on these classes with switches that generate documentation for non-public classes, methods, and fields. Also, if you encounter problems making subclasses due to inflexibility in base classes, I'd like to hear about it, so I can try to come up with a better factoring.

Why aren't most classes Serializable?
I don't know what to about this. On one hand, it wouldn't make sense in a lot of contexts to serialize, say, a Semaphore. On the other hand, maybe it ought not be precluded. Opinions welcome. One suggestion is to only declare as serializable those classes specifically designed to work with other persistent or distributed concurrency control frameworks. (No such classes currently exist.)

Why didn't using ReadWriteLocks instead of plain synchronization speed up my program?
ReadWriteLocks have more overhead than do synchronized methods or blocks. They pay off only when the code being protected by the locks is time-consuming, and when readers outnumber writers, so the increased concurrency outweighs the increased bookkeeping. (They are also sometimes of use in avoiding deadlock.) Special-purpose data structures such as the Concurrent hash tables in this package have far less overhead, and typically much better performance than placing ReadWriteLocks around most sequential data structures.

Are instances of these classes externally lockable -- that is, can I control object x via synchronized(x) { ... } ?
Not necessarily. Some objects rely on their own synchronization locks, some rely on internal locks, some rely on other synchronization objects. So in general, you cannot know the effect of synchronized(x) and so probably ought never use it.

Why do I get strict alternation of producer and consumer threads when using buffered channels such as BoundedBuffer?
Although it depends on details of JVM scheduling policies, this is the most likely result when producer and consumer actions both take about the same amount of time to process, since both put and take operations signal waiting threads. The point of buffering is to decouple producers and consumers when one or the other is bursty, so temporarily gets ahead or behind its average rate. (If the average rates of producers and consumers are not approximately equal, buffering is not of much use.) While it again relies on JVM details, unbounded buffers (for example LinkedQueue) typically do not result in alternation, allowing producers to get arbitrarily ahead of consumers, at the expense of potential resource exhaustion.

Why aren't there timeout methods supporting nanosecond arguments?
Because most JVMs only time to millisecond accuracy (at best) anyway. If this changes, nanosecond versions could be added.

Why is the package named EDU..., not edu?
I've been using the initially-recommended upper-case EDU prefix for a long time for my packages. It would take a lot of busy-work to convert everything to the now-recommended practice of using lower-case. Someday I will do this though.

Why do you use those ugly underscores?!
Because otherwise I tend to make coding mistakes surrounding instance variables versus local variables. See my Sample Java Coding Standard. But I think I've decided to reform :-) Newer classes use a more JDK-like set of conventions.

Why don't you supply Ant build scripts? Or Jar files? Or rearrange into separate src/doc/lib directories? Or CVS? Or ...?
There are too many different ways people would like to use this package for me to keep up with. So I release it in a simple way that should be very easy to adapt to all sorts of different needs and conventions.

Is this code in any way tied to Sun JDK releases?
No. The acknowlegdment to Sun Labs in headers recognizes their generous donations of equipment and release time support that help make this work possible. But this software is not in any way tied to Sun. However, work is underway to create a JSR with the goal of including a similar package in a future JDK release.

Can I use this code in commercial products?
Yes. Many people appear to do so.

Do I need a license to use it? Can I get one?

Can I get commercial support for this package?
I don't know of any place to get it. I can't think of any technical reason that you'd want it.