Examples of java.util.concurrent.ThreadPoolExecutor

java.util.concurrent.ThreadPoolExecutor
An {@link ExecutorService} that executes each submitted task usingone of possibly several pooled threads, normally configured using {@link Executors} factory methods.
Thread pools address two different problems: they usually provide improved performance when executing large numbers of asynchronous tasks, due to reduced per-task invocation overhead, and they provide a means of bounding and managing the resources, including threads, consumed when executing a collection of tasks. Each ThreadPoolExecutor also maintains some basic statistics, such as the number of completed tasks.
To be useful across a wide range of contexts, this class provides many adjustable parameters and extensibility hooks. However, programmers are urged to use the more convenient {@link Executors} factory methods {@link Executors#newCachedThreadPool} (unbounded thread pool, withautomatic thread reclamation), {@link Executors#newFixedThreadPool}(fixed size thread pool) and {@link Executors#newSingleThreadExecutor} (single background thread), thatpreconfigure settings for the most common usage scenarios. Otherwise, use the following guide when manually configuring and tuning this class:
Core and maximum pool sizes

A ThreadPoolExecutor will automatically adjust the pool size (see {@link ThreadPoolExecutor#getPoolSize}) according to the bounds set by corePoolSize (see {@link ThreadPoolExecutor#getCorePoolSize}) and maximumPoolSize (see {@link ThreadPoolExecutor#getMaximumPoolSize}). When a new task is submitted in method {@link ThreadPoolExecutor#execute}, and fewer than corePoolSize threads are running, a new thread is created to handle the request, even if other worker threads are idle. If there are more than corePoolSize but less than maximumPoolSize threads running, a new thread will be created only if the queue is full. By setting corePoolSize and maximumPoolSize the same, you create a fixed-size thread pool. By setting maximumPoolSize to an essentially unbounded value such as Integer.MAX_VALUE, you allow the pool to accommodate an arbitrary number of concurrent tasks. Most typically, core and maximum pool sizes are set only upon construction, but they may also be changed dynamically using {@link ThreadPoolExecutor#setCorePoolSize} and {@link ThreadPoolExecutor#setMaximumPoolSize}.

On-demand construction

By default, even core threads are initially created and started only when new tasks arrive, but this can be overridden dynamically using method {@link ThreadPoolExecutor#prestartCoreThread} or{@link ThreadPoolExecutor#prestartAllCoreThreads}. You probably want to prestart threads if you construct the pool with a non-empty queue.

Creating new threads

New threads are created using a {@link java.util.concurrent.ThreadFactory}. If not otherwise specified, a {@link Executors#defaultThreadFactory} is used, that creates threads to allbe in the same {@link ThreadGroup} and with the sameNORM_PRIORITY priority and non-daemon status. By supplying a different ThreadFactory, you can alter the thread's name, thread group, priority, daemon status, etc. If a ThreadFactory fails to create a thread when asked by returning null from newThread, the executor will continue, but might not be able to execute any tasks.

Keep-alive times

If the pool currently has more than corePoolSize threads, excess threads will be terminated if they have been idle for more than the keepAliveTime (see {@link ThreadPoolExecutor#getKeepAliveTime}). This provides a means of reducing resource consumption when the pool is not being actively used. If the pool becomes more active later, new threads will be constructed. This parameter can also be changed dynamically using method {@link ThreadPoolExecutor#setKeepAliveTime}. Using a value of Long.MAX_VALUE {@link TimeUnit#NANOSECONDS} effectivelydisables idle threads from ever terminating prior to shut down. By default, the keep-alive policy applies only when there are more than corePoolSizeThreads. But method {@link ThreadPoolExecutor#allowCoreThreadTimeOut(boolean)} can be used to applythis time-out policy to core threads as well, so long as the keepAliveTime value is non-zero.

Queuing
Any {@link BlockingQueue} may be used to transfer and holdsubmitted tasks. The use of this queue interacts with pool sizing:
- If fewer than corePoolSize threads are running, the Executor always prefers adding a new thread rather than queuing.
- If corePoolSize or more threads are running, the Executor always prefers queuing a request rather than adding a new thread.
- If a request cannot be queued, a new thread is created unless this would exceed maximumPoolSize, in which case, the task will be rejected.
There are three general strategies for queuing:
1. Direct handoffs. A good default choice for a work queue is a {@link SynchronousQueue} that hands off tasks to threadswithout otherwise holding them. Here, an attempt to queue a task will fail if no threads are immediately available to run it, so a new thread will be constructed. This policy avoids lockups when handling sets of requests that might have internal dependencies. Direct handoffs generally require unbounded maximumPoolSizes to avoid rejection of new submitted tasks. This in turn admits the possibility of unbounded thread growth when commands continue to arrive on average faster than they can be processed.
2. Unbounded queues. Using an unbounded queue (for example a {@link LinkedBlockingQueue} without a predefinedcapacity) will cause new tasks to wait in the queue when all corePoolSize threads are busy. Thus, no more than corePoolSize threads will ever be created. (And the value of the maximumPoolSize therefore doesn't have any effect.) This may be appropriate when each task is completely independent of others, so tasks cannot affect each others execution; for example, in a web page server. While this style of queuing can be useful in smoothing out transient bursts of requests, it admits the possibility of unbounded work queue growth when commands continue to arrive on average faster than they can be processed.
3. Bounded queues. A bounded queue (for example, an {@link ArrayBlockingQueue}) helps prevent resource exhaustion when used with finite maximumPoolSizes, but can be more difficult to tune and control. Queue sizes and maximum pool sizes may be traded off for each other: Using large queues and small pools minimizes CPU usage, OS resources, and context-switching overhead, but can lead to artificially low throughput. If tasks frequently block (for example if they are I/O bound), a system may be able to schedule time for more threads than you otherwise allow. Use of small queues generally requires larger pool sizes, which keeps CPUs busier but may encounter unacceptable scheduling overhead, which also decreases throughput.
Rejected tasks
New tasks submitted in method {@link ThreadPoolExecutor#execute} will be rejected when theExecutor has been shut down, and also when the Executor uses finite bounds for both maximum threads and work queue capacity, and is saturated. In either case, the execute method invokes the {@link RejectedExecutionHandler#rejectedExecution} method of its{@link RejectedExecutionHandler}. Four predefined handler policies are provided:
1. In the default {@link ThreadPoolExecutor.AbortPolicy}, the handler throws a runtime {@link RejectedExecutionException} upon rejection.
2. In {@link ThreadPoolExecutor.CallerRunsPolicy}, the thread that invokes execute itself runs the task. This provides a simple feedback control mechanism that will slow down the rate that new tasks are submitted.
3. In {@link ThreadPoolExecutor.DiscardPolicy}, a task that cannot be executed is simply dropped.
4. In {@link ThreadPoolExecutor.DiscardOldestPolicy}, if the executor is not shut down, the task at the head of the work queue is dropped, and then execution is retried (which can fail again, causing this to be repeated.)
It is possible to define and use other kinds of {@link RejectedExecutionHandler} classes. Doing so requires some careespecially when policies are designed to work only under particular capacity or queuing policies.
Hook methods

This class provides protected overridable {@link ThreadPoolExecutor#beforeExecute} and {@link ThreadPoolExecutor#afterExecute} methods that are called before andafter execution of each task. These can be used to manipulate the execution environment; for example, reinitializing ThreadLocals, gathering statistics, or adding log entries. Additionally, method {@link ThreadPoolExecutor#terminated} can be overridden to performany special processing that needs to be done once the Executor has fully terminated.
If hook or callback methods throw exceptions, internal worker threads may in turn fail and abruptly terminate.

Queue maintenance

Method {@link ThreadPoolExecutor#getQueue} allows access tothe work queue for purposes of monitoring and debugging. Use of this method for any other purpose is strongly discouraged. Two supplied methods, {@link ThreadPoolExecutor#remove} and {@link ThreadPoolExecutor#purge} are available to assist in storagereclamation when large numbers of queued tasks become cancelled.

Finalization

A pool that is no longer referenced in a program AND has no remaining threads will be shutdown automatically. If you would like to ensure that unreferenced pools are reclaimed even if users forget to call {@link ThreadPoolExecutor#shutdown}, then you must arrange that unused threads eventually die, by setting appropriate keep-alive times, using a lower bound of zero core threads and/or setting {@link ThreadPoolExecutor#allowCoreThreadTimeOut(boolean)}.
Extension example. Most extensions of this class override one or more of the protected hook methods. For example, here is a subclass that adds a simple pause/resume feature:
```
 class PausableThreadPoolExecutor extends ThreadPoolExecutor { private boolean isPaused; private ReentrantLock pauseLock = new ReentrantLock(); private Condition unpaused = pauseLock.newCondition(); public PausableThreadPoolExecutor(...) { super(...); } protected void beforeExecute(Thread t, Runnable r) { super.beforeExecute(t, r); pauseLock.lock(); try { while (isPaused) unpaused.await(); } catch (InterruptedException ie) { t.interrupt(); } finally { pauseLock.unlock(); } } public void pause() { pauseLock.lock(); try { isPaused = true; } finally { pauseLock.unlock(); } } public void resume() { pauseLock.lock(); try { isPaused = false; unpaused.signalAll(); } finally { pauseLock.unlock(); } } } 
```
@since 1.5 @author Doug Lea

                onJobRejected(r);
            }
        };
        log.info("ThreadPoolExecutor configuration: corePoolSize = {}, maxPoolSize={}, keepAliveTimeSeconds={}",
                new Object[] { corePoolSize, maximumPoolSize, keepAliveTimeSeconds });
        executor = new ThreadPoolExecutor(corePoolSize, maximumPoolSize,
                keepAliveTimeSeconds, unit, workQueue, handler);
    }

View Full Code Here

                return t;
            }


        };
        m_writeThread = MoreExecutors.listeningDecorator(
                new ThreadPoolExecutor(
                        1,
                        1,
                        0,
                        TimeUnit.MILLISECONDS,
                        new LinkedBlockingQueue<Runnable>(),
                        tf));


        tf = new ThreadFactory() {


            @Override
            public Thread newThread(Runnable r) {
                Thread t = new Thread( r, "JitCask[" + m_caskPath + "] Sync Thread");
                t.setDaemon(true);
                return t;
            }


        };
        m_syncThread = MoreExecutors.listeningDecorator(
                new ScheduledThreadPoolExecutor(
                1,
                tf));


        tf = new ThreadFactory() {
            private final AtomicInteger m_counter = new AtomicInteger();


            @Override
            public Thread newThread(Runnable r) {
                Thread t = new Thread(
                        null,
                        r,
                        "JitCask[" + m_caskPath + "] Read Thread " + m_counter.incrementAndGet(),
                        1024 * 256);
                t.setDaemon(true);
                return t;
            }


        };
        m_readThreads = MoreExecutors.listeningDecorator(
                new ThreadPoolExecutor(
                        READ_QUEUE_DEPTH,
                        READ_QUEUE_DEPTH,
                        0,
                        TimeUnit.MILLISECONDS,
                        new LinkedBlockingQueue<Runnable>(),
                        tf,
                        new ThreadPoolExecutor.AbortPolicy()));


        tf = new ThreadFactory() {
            private final AtomicInteger m_counter = new AtomicInteger();


            @Override
            public Thread newThread(Runnable r) {
                Thread t = new Thread(
                        null,
                        r,
                        "JitCask[" + m_caskPath + "] Compression Thread " + m_counter.incrementAndGet(),
                        1024 * 256);
                t.setDaemon(true);
                return t;
            }


        };


        final int availableProcs = Runtime.getRuntime().availableProcessors() / 2;
        m_compressionThreads =
                MoreExecutors.listeningDecorator(
                        new ThreadPoolExecutor(
                                availableProcs,
                                availableProcs,
                                0,
                                TimeUnit.MILLISECONDS,
                                new LinkedBlockingQueue<Runnable>(availableProcs),

View Full Code Here

   * @param queueSize
   *            the size of the queue to store Runnables when all threads are busy
   * @return the new ExecutorService
   */
  public static ThreadPoolExecutor newFixedThreadPool(int threads, String groupname, int queueSize) {
    return new ThreadPoolExecutor( threads, threads, 0L, TimeUnit.MILLISECONDS, new LinkedBlockingQueue<Runnable>(
        queueSize ), new SearchThreadFactory( groupname ), new BlockPolicy() );
  }

View Full Code Here

//    Arrays.fill(grad, dim);
//    for(int x = 0 ; x < dim ; x++)
//      grad[x] *= kernel.getGammas()[x];
    
    //1 job par ligne
    ThreadPoolExecutor threadPool = ThreadPoolServer.getThreadPoolExecutor();
    Queue<Future<?>> futures = new LinkedList<Future<?>>();
    
    class GradRunnable implements Runnable {
      GeneralizedDoubleGaussL2 kernel;
      int i;
      public GradRunnable(GeneralizedDoubleGaussL2 kernel, int i) {
        this.kernel = kernel;
        this.i = i;
      }
      
      public void run() {
        double[][] matrix = kernel.distanceMatrixUnthreaded(listOfExamples, i);
        double sum = 0;
        for(int x = 0 ; x < matrix.length ; x++)
          if(lambda_matrix[x] != null)
            for(int y = 0 ; y < matrix.length ; y++)
              sum += matrix[x][y]*lambda_matrix[x][y];
//        grad[i] = 0.5*sum/(matrix.length*matrix.length);
        grad[i] += 0.5*sum;
      }
    }
    
    for(int i = 0 ; i < grad.length ; i++) {
      Runnable r = new GradRunnable(kernel, i);
      futures.add(threadPool.submit(r));
    }
    
    //wait for all jobs
    while(!futures.isEmpty())
    {

View Full Code Here

   * Tells the system wide ThreadPoolServer (Singleton pattern)
   * 
   * @return system wide instance of this class.
   */
  public static ThreadPoolExecutor getThreadPoolExecutor() {
    ThreadPoolExecutor executor;
    int nbcpu = Runtime.getRuntime().availableProcessors();
    executor = new ThreadPoolExecutor(nbcpu, 2 * nbcpu, 1,
        TimeUnit.SECONDS, new LinkedBlockingQueue<Runnable>());
    executor.prestartAllCoreThreads();
    executor.allowCoreThreadTimeOut(true);
    return executor;
  }

View Full Code Here

   * @return the resulting matrix
   */
  public double[][] getMatrix(final double[][] matrix)
  {
    //one job per line of the matrix
    ThreadPoolExecutor threadPool = ThreadPoolServer.getThreadPoolExecutor();
    Queue<Future<?>> futures = new LinkedList<Future<?>>();
    
    int increm = matrix.length / nbjobs  + 1 ;
    
    try
    {
      for(int i = 0 ; i < matrix.length ; i += increm)
      {
        final int from = i;
        final int to = Math.min(matrix.length, i+increm);
        
        
        Runnable r = new Runnable(){
          public void run() {
            doLines(matrix, from, to);
          }
        };
        
        futures.add(threadPool.submit(r));
      }


      //wait for all jobs
      while(!futures.isEmpty())
      {

View Full Code Here

  public double[] getVector(final double[] vector)
  {
    try
    {
      //one job per line of the matrix
      ThreadPoolExecutor threadPool = ThreadPoolServer.getThreadPoolExecutor();
      Queue<Future<?>> futures = new LinkedList<Future<?>>();
      
      int nbcpu = Runtime.getRuntime().availableProcessors();
      int increm = vector.length / nbcpu + 1;
      
      for(int i = 0 ; i < vector.length ; i += increm)
      {
        final int min = i;
        final int max = Math.min(vector.length, i+increm);
        Runnable r = new Runnable(){
          @Override
          public void run() {
            doBlock(min, max, vector);
          }
        };
        
        futures.add(threadPool.submit(r));
      }


      //wait for all jobs
      while(!futures.isEmpty())
        futures.remove().get();

View Full Code Here

    if(A.length < granularity)
      return MatrixOperations.trans(A);
    
    final double[][] out = new double[A[0].length][A.length];
    
    ThreadPoolExecutor exec = ThreadPoolServer.getThreadPoolExecutor();
    List<Future<Object>> futures = new ArrayList<Future<Object>>();
    
    for(int jj = 0 ; jj < A.length ; jj++) {
      final int j = jj;
      futures.add(exec.submit(new Callable<Object>() {


        @Override
        public Object call() {
          for(int i = 0 ; i < A[0].length ; i++) {
              out[i][j] = A[j][i];

View Full Code Here

      return MatrixOperations.transi(A);
    
    if(!MatrixOperations.isSquare(A))
      throw new ArithmeticException("Matrix must be square.");


    ThreadPoolExecutor exec = ThreadPoolServer.getThreadPoolExecutor();
    List<Future<Object>> futures = new ArrayList<Future<Object>>();
    final double[][] m = A;
    
    for(int ii = 0 ; ii < A.length ; ii++) {
      final int i = ii;
      futures.add(exec.submit(new Callable<Object>() {
        double tmp;
        @Override
        public Object call() {
          for(int j = i+1 ; j < m[0].length; j++) {
            tmp = m[i][j];

View Full Code Here

      throw new ArithmeticException("Matrix dimensions must agree.");
    }
    
    final double[][] out = new double[m][n];
    
    ThreadPoolExecutor exec = ThreadPoolServer.getThreadPoolExecutor();
    List<Future<Object>> futures = new ArrayList<Future<Object>>();
    
    for(int ii = 0 ; ii < m ; ii++) {
      final int i = ii;
      futures.add(exec.submit(new Callable<Object>() {


        @Override
        public Object call() throws Exception {
          for(int j = 0 ; j < n ; j++) {
            double sum = 0;

View Full Code Here

0 1 2 3 4 5 6 7 8 9

TOP

Related Classes of java.util.concurrent.ThreadPoolExecutor

ch.cmbntr.modulizer.bootstrap.util.Resources$BasicPool

co.paralleluniverse.common.monitoring.ThreadPoolExecutorMonitor

com.alibaba.dubbo.remoting.handler.ConnectChannelHandlerTest

com.alibaba.dubbo.remoting.transport.dispather.connection.ConnectionOrderedChannelHandler

com.alibaba.otter.node.etl.common.pipe.impl.http.archive.ArchiveBean

com.alibaba.otter.node.etl.extract.extractor.DatabaseExtractor

com.alibaba.otter.node.etl.load.loader.db.DbLoadAction

com.alibaba.otter.node.etl.load.loader.db.FileLoadAction

com.alibaba.otter.node.etl.OtterController

com.alibaba.otter.shared.common.utils.thread.ExecutorTemplate

All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.