Package java.util.concurrent
See: Description
-
Interface Summary Interface Description BlockingDeque<E> ADeque
that additionally supports blocking operations that wait for the deque to become non-empty when retrieving an element, and wait for space to become available in the deque when storing an element.BlockingQueue<E> AQueue
that additionally supports operations that wait for the queue to become non-empty when retrieving an element, and wait for space to become available in the queue when storing an element.Callable<V> A task that returns a result and may throw an exception.CompletionService<V> A service that decouples the production of new asynchronous tasks from the consumption of the results of completed tasks.ConcurrentMap<K,V> AMap
providing additional atomic putIfAbsent, remove, and replace methods.ConcurrentNavigableMap<K,V> AConcurrentMap
supportingNavigableMap
operations, and recursively so for its navigable sub-maps.Delayed A mix-in style interface for marking objects that should be acted upon after a given delay.Executor An object that executes submittedRunnable
tasks.ExecutorService ForkJoinPool.ForkJoinWorkerThreadFactory Factory for creating newForkJoinWorkerThread
s.ForkJoinPool.ManagedBlocker Interface for extending managed parallelism for tasks running inForkJoinPool
s.Future<V> A Future represents the result of an asynchronous computation.RejectedExecutionHandler A handler for tasks that cannot be executed by aThreadPoolExecutor
.RunnableFuture<V> RunnableScheduledFuture<V> AScheduledFuture
that isRunnable
.ScheduledExecutorService AnExecutorService
that can schedule commands to run after a given delay, or to execute periodically.ScheduledFuture<V> A delayed result-bearing action that can be cancelled.ThreadFactory An object that creates new threads on demand.TransferQueue<E> ABlockingQueue
in which producers may wait for consumers to receive elements. -
Class Summary Class Description AbstractExecutorService Provides default implementations ofExecutorService
execution methods.ArrayBlockingQueue<E> A bounded blocking queue backed by an array.ConcurrentHashMap<K,V> A hash table supporting full concurrency of retrievals and adjustable expected concurrency for updates.ConcurrentLinkedDeque<E> An unbounded concurrent deque based on linked nodes.ConcurrentLinkedQueue<E> An unbounded thread-safe queue based on linked nodes.ConcurrentSkipListMap<K,V> A scalable concurrentConcurrentNavigableMap
implementation.ConcurrentSkipListSet<E> A scalable concurrentNavigableSet
implementation based on aConcurrentSkipListMap
.CopyOnWriteArrayList<E> A thread-safe variant ofArrayList
in which all mutative operations (add, set, and so on) are implemented by making a fresh copy of the underlying array.CopyOnWriteArraySet<E> ASet
that uses an internalCopyOnWriteArrayList
for all of its operations.CountDownLatch A synchronization aid that allows one or more threads to wait until a set of operations being performed in other threads completes.CyclicBarrier A synchronization aid that allows a set of threads to all wait for each other to reach a common barrier point.DelayQueue<E extends Delayed> An unbounded blocking queue of Delayed elements, in which an element can only be taken when its delay has expired.Exchanger<V> A synchronization point at which threads can pair and swap elements within pairs.ExecutorCompletionService<V> ACompletionService
that uses a suppliedExecutor
to execute tasks.Executors Factory and utility methods forExecutor
,ExecutorService
,ScheduledExecutorService
,ThreadFactory
, andCallable
classes defined in this package.ForkJoinPool AnExecutorService
for runningForkJoinTask
s.ForkJoinTask<V> Abstract base class for tasks that run within aForkJoinPool
.ForkJoinWorkerThread A thread managed by aForkJoinPool
, which executesForkJoinTask
s.FutureTask<V> A cancellable asynchronous computation.LinkedBlockingDeque<E> An optionally-bounded blocking deque based on linked nodes.LinkedBlockingQueue<E> An optionally-bounded blocking queue based on linked nodes.LinkedTransferQueue<E> An unboundedTransferQueue
based on linked nodes.Phaser A reusable synchronization barrier, similar in functionality toCyclicBarrier
andCountDownLatch
but supporting more flexible usage.PriorityBlockingQueue<E> An unbounded blocking queue that uses the same ordering rules as classPriorityQueue
and supplies blocking retrieval operations.RecursiveAction A recursive resultlessForkJoinTask
.RecursiveTask<V> A recursive result-bearingForkJoinTask
.ScheduledThreadPoolExecutor AThreadPoolExecutor
that can additionally schedule commands to run after a given delay, or to execute periodically.Semaphore A counting semaphore.SynchronousQueue<E> A blocking queue in which each insert operation must wait for a corresponding remove operation by another thread, and vice versa.ThreadLocalRandom A random number generator isolated to the current thread.ThreadPoolExecutor AnExecutorService
that executes each submitted task using one of possibly several pooled threads, normally configured usingExecutors
factory methods.ThreadPoolExecutor.AbortPolicy A handler for rejected tasks that throws aRejectedExecutionException
.ThreadPoolExecutor.CallerRunsPolicy A handler for rejected tasks that runs the rejected task directly in the calling thread of theexecute
method, unless the executor has been shut down, in which case the task is discarded.ThreadPoolExecutor.DiscardOldestPolicy A handler for rejected tasks that discards the oldest unhandled request and then retriesexecute
, unless the executor is shut down, in which case the task is discarded.ThreadPoolExecutor.DiscardPolicy A handler for rejected tasks that silently discards the rejected task. -
Enum Summary Enum Description TimeUnit A TimeUnit represents time durations at a given unit of granularity and provides utility methods to convert across units, and to perform timing and delay operations in these units. -
Exception Summary Exception Description BrokenBarrierException Exception thrown when a thread tries to wait upon a barrier that is in a broken state, or which enters the broken state while the thread is waiting.CancellationException Exception indicating that the result of a value-producing task, such as aFutureTask
, cannot be retrieved because the task was cancelled.ExecutionException Exception thrown when attempting to retrieve the result of a task that aborted by throwing an exception.RejectedExecutionException Exception thrown by anExecutor
when a task cannot be accepted for execution.TimeoutException Exception thrown when a blocking operation times out.
Package java.util.concurrent Description
java.util.concurrent.locks
and
java.util.concurrent.atomic
packages.
Executors
Interfaces.Executor
is a simple standardized
interface for defining custom thread-like subsystems, including
thread pools, asynchronous IO, and lightweight task frameworks.
Depending on which concrete Executor class is being used, tasks may
execute in a newly created thread, an existing task-execution thread,
or the thread calling execute
, and may execute sequentially or concurrently.
ExecutorService
provides a more
complete asynchronous task execution framework. An
ExecutorService manages queuing and scheduling of tasks,
and allows controlled shutdown.
The ScheduledExecutorService
subinterface and associated interfaces add support for
delayed and periodic task execution. ExecutorServices
provide methods arranging asynchronous execution of any
function expressed as Callable
,
the result-bearing analog of Runnable
.
A Future
returns the results of
a function, allows determination of whether execution has
completed, and provides a means to cancel execution.
A RunnableFuture
is a Future
that possesses a run
method that upon execution,
sets its results.
Implementations.
Classes ThreadPoolExecutor
and
ScheduledThreadPoolExecutor
provide tunable, flexible thread pools.
The Executors
class provides
factory methods for the most common kinds and configurations
of Executors, as well as a few utility methods for using
them. Other utilities based on Executors
include the
concrete class FutureTask
providing a common extensible implementation of Futures, and
ExecutorCompletionService
, that
assists in coordinating the processing of groups of
asynchronous tasks.
Class ForkJoinPool
provides an
Executor primarily designed for processing instances of ForkJoinTask
and its subclasses. These
classes employ a work-stealing scheduler that attains high
throughput for tasks conforming to restrictions that often hold in
computation-intensive parallel processing.
Queues
TheConcurrentLinkedQueue
class
supplies an efficient scalable thread-safe non-blocking FIFO
queue.
Five implementations in java.util.concurrent
support
the extended BlockingQueue
interface, that defines blocking versions of put and take:
LinkedBlockingQueue
,
ArrayBlockingQueue
,
SynchronousQueue
,
PriorityBlockingQueue
, and
DelayQueue
.
The different classes cover the most common usage contexts
for producer-consumer, messaging, parallel tasking, and
related concurrent designs.
Extended interface TransferQueue
,
and implementation LinkedTransferQueue
introduce a synchronous transfer
method (along with related
features) in which a producer may optionally block awaiting its
consumer.
The BlockingDeque
interface
extends BlockingQueue
to support both FIFO and LIFO
(stack-based) operations.
Class LinkedBlockingDeque
provides an implementation.
Timing
TheTimeUnit
class provides
multiple granularities (including nanoseconds) for
specifying and controlling time-out based operations. Most
classes in the package contain operations based on time-outs
in addition to indefinite waits. In all cases that
time-outs are used, the time-out specifies the minimum time
that the method should wait before indicating that it
timed-out. Implementations make a "best effort"
to detect time-outs as soon as possible after they occur.
However, an indefinite amount of time may elapse between a
time-out being detected and a thread actually executing
again after that time-out. All methods that accept timeout
parameters treat values less than or equal to zero to mean
not to wait at all. To wait "forever", you can use a value
of Long.MAX_VALUE
.
Synchronizers
Five classes aid common special-purpose synchronization idioms.Semaphore
is a classic concurrency tool.CountDownLatch
is a very simple yet very common utility for blocking until a given number of signals, events, or conditions hold.- A
CyclicBarrier
is a resettable multiway synchronization point useful in some styles of parallel programming. - A
Phaser
provides a more flexible form of barrier that may be used to control phased computation among multiple threads. - An
Exchanger
allows two threads to exchange objects at a rendezvous point, and is useful in several pipeline designs.
Concurrent Collections
Besides Queues, this package supplies Collection implementations designed for use in multithreaded contexts:ConcurrentHashMap
,
ConcurrentSkipListMap
,
ConcurrentSkipListSet
,
CopyOnWriteArrayList
, and
CopyOnWriteArraySet
.
When many threads are expected to access a given collection, a
ConcurrentHashMap
is normally preferable to a synchronized
HashMap
, and a ConcurrentSkipListMap
is normally
preferable to a synchronized TreeMap
.
A CopyOnWriteArrayList
is preferable to a synchronized
ArrayList
when the expected number of reads and traversals
greatly outnumber the number of updates to a list.
The "Concurrent" prefix used with some classes in this package
is a shorthand indicating several differences from similar
"synchronized" classes. For example java.util.Hashtable
and
Collections.synchronizedMap(new HashMap())
are
synchronized. But ConcurrentHashMap
is "concurrent". A
concurrent collection is thread-safe, but not governed by a
single exclusion lock. In the particular case of
ConcurrentHashMap, it safely permits any number of
concurrent reads as well as a tunable number of concurrent
writes. "Synchronized" classes can be useful when you need
to prevent all access to a collection via a single lock, at
the expense of poorer scalability. In other cases in which
multiple threads are expected to access a common collection,
"concurrent" versions are normally preferable. And
unsynchronized collections are preferable when either
collections are unshared, or are accessible only when
holding other locks.
Most concurrent Collection implementations (including most Queues) also differ from the usual java.util conventions in that their Iterators provide weakly consistent rather than fast-fail traversal. A weakly consistent iterator is thread-safe, but does not necessarily freeze the collection while iterating, so it may (or may not) reflect any updates since the iterator was created.
Memory Consistency Properties
Chapter 17 of The Java™ Language Specification defines the happens-before relation on memory operations such as reads and writes of shared variables. The results of a write by one thread are guaranteed to be visible to a read by another thread only if the write operation happens-before the read operation. Thesynchronized
and volatile
constructs, as well as the
Thread.start()
and Thread.join()
methods, can form
happens-before relationships. In particular:
- Each action in a thread happens-before every action in that thread that comes later in the program's order.
- An unlock (
synchronized
block or method exit) of a monitor happens-before every subsequent lock (synchronized
block or method entry) of that same monitor. And because the happens-before relation is transitive, all actions of a thread prior to unlocking happen-before all actions subsequent to any thread locking that monitor. - A write to a
volatile
field happens-before every subsequent read of that same field. Writes and reads ofvolatile
fields have similar memory consistency effects as entering and exiting monitors, but do not entail mutual exclusion locking. - A call to
start
on a thread happens-before any action in the started thread. - All actions in a thread happen-before any other thread
successfully returns from a
join
on that thread.
java.util.concurrent
and its
subpackages extend these guarantees to higher-level
synchronization. In particular:
- Actions in a thread prior to placing an object into any concurrent collection happen-before actions subsequent to the access or removal of that element from the collection in another thread.
- Actions in a thread prior to the submission of a
Runnable
to anExecutor
happen-before its execution begins. Similarly forCallables
submitted to anExecutorService
. - Actions taken by the asynchronous computation represented by a
Future
happen-before actions subsequent to the retrieval of the result viaFuture.get()
in another thread. - Actions prior to "releasing" synchronizer methods such as
Lock.unlock
,Semaphore.release
, andCountDownLatch.countDown
happen-before actions subsequent to a successful "acquiring" method such asLock.lock
,Semaphore.acquire
,Condition.await
, andCountDownLatch.await
on the same synchronizer object in another thread. - For each pair of threads that successfully exchange objects via
an
Exchanger
, actions prior to theexchange()
in each thread happen-before those subsequent to the correspondingexchange()
in another thread. - Actions prior to calling
CyclicBarrier.await
andPhaser.awaitAdvance
(as well as its variants) happen-before actions performed by the barrier action, and actions performed by the barrier action happen-before actions subsequent to a successful return from the correspondingawait
in other threads.
- Since:
- 1.5
Traduction non disponible
Les API Java ne sont pas encore traduites en français sur l'infobrol. Seule la version anglaise est disponible pour l'instant.
Version en cache
29/12/2024 11:49:16 Cette version de la page est en cache (à la date du 29/12/2024 11:49:16) afin d'accélérer le traitement. Vous pouvez activer le mode utilisateur dans le menu en haut pour afficher la dernère version de la page.Document créé le 30/10/2006, dernière modification le 04/03/2020
Source du document imprimé : https://www.gaudry.be/java-api-rf-java/util/concurrent/package-summary.html
L'infobrol est un site personnel dont le contenu n'engage que moi. Le texte est mis à disposition sous licence CreativeCommons(BY-NC-SA). Plus d'info sur les conditions d'utilisation et sur l'auteur.
Références
Ces références et liens indiquent des documents consultés lors de la rédaction de cette page, ou qui peuvent apporter un complément d'information, mais les auteurs de ces sources ne peuvent être tenus responsables du contenu de cette page.
L'auteur de ce site est seul responsable de la manière dont sont présentés ici les différents concepts, et des libertés qui sont prises avec les ouvrages de référence. N'oubliez pas que vous devez croiser les informations de sources multiples afin de diminuer les risques d'erreurs.