Examples of LinkedBlockingQueue

edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingQueue
An optionally-bounded {@linkplain BlockingQueue blocking queue} based onlinked nodes. This queue orders elements FIFO (first-in-first-out). The head of the queue is that element that has been on the queue the longest time. The tail of the queue is that element that has been on the queue the shortest time. New elements are inserted at the tail of the queue, and the queue retrieval operations obtain elements at the head of the queue. Linked queues typically have higher throughput than array-based queues but less predictable performance in most concurrent applications.
The optional capacity bound constructor argument serves as a way to prevent excessive queue expansion. The capacity, if unspecified, is equal to {@link Integer#MAX_VALUE}. Linked nodes are dynamically created upon each insertion unless this would bring the queue above capacity.
This class and its iterator implement all of the optional methods of the {@link Collection} and {@link Iterator} interfaces.
This class is a member of the Java Collections Framework. @since 1.5 @author Doug Lea
java.util.concurrent.LinkedBlockingQueue
An optionally-bounded {@linkplain BlockingQueue blocking queue} based onlinked nodes. This queue orders elements FIFO (first-in-first-out). The head of the queue is that element that has been on the queue the longest time. The tail of the queue is that element that has been on the queue the shortest time. New elements are inserted at the tail of the queue, and the queue retrieval operations obtain elements at the head of the queue. Linked queues typically have higher throughput than array-based queues but less predictable performance in most concurrent applications.
The optional capacity bound constructor argument serves as a way to prevent excessive queue expansion. The capacity, if unspecified, is equal to {@link Integer#MAX_VALUE}. Linked nodes are dynamically created upon each insertion unless this would bring the queue above capacity.
This class and its iterator implement all of the optional methods of the {@link Collection} and {@link Iterator} interfaces.
This class is a member of the Java Collections Framework. @since 1.5 @author Doug Lea @param < E> the type of elements held in this collection
org.drools.util.concurrent.locks.LinkedBlockingQueue
An optionally-bounded {@linkplain BlockingQueue blocking queue} based onlinked nodes. This queue orders elements FIFO (first-in-first-out). The head of the queue is that element that has been on the queue the longest time. The tail of the queue is that element that has been on the queue the shortest time. New elements are inserted at the tail of the queue, and the queue retrieval operations obtain elements at the head of the queue. Linked queues typically have higher throughput than array-based queues but less predictable performance in most concurrent applications.
The optional capacity bound constructor argument serves as a way to prevent excessive queue expansion. The capacity, if unspecified, is equal to {@link Integer#MAX_VALUE}. Linked nodes are dynamically created upon each insertion unless this would bring the queue above capacity.
This class and its iterator implement all of the optional methods of the {@link Collection} and {@link Iterator} interfaces.
This class is a member of the Java Collections Framework. @since 1.5 @author Doug Lea

Examples of edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingQueue


      // Support async execution of tasks
      // this.blockingQueue = new SynchronousQueue(); // has no capacity but
      // blocks until other thread takes it out
      final int capacity = 10000;
      this.blockingQueue = new LinkedBlockingQueue(capacity);
      Consumer c = new Consumer(this.blockingQueue);
      Thread t = new Thread(c);
      t.setName("XmlBlaster.Consumer");
      t.setDaemon(true);
      t.start();

View Full Code Here

Examples of edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingQueue

    public DefaultArtifactResolver()
    {
        super();
        resolveArtifactPool = 
            new ThreadPoolExecutor( DEFAULT_POOL_SIZE, DEFAULT_POOL_SIZE, 3, TimeUnit.SECONDS,
                                    new LinkedBlockingQueue() );
    }

View Full Code Here

Examples of edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingQueue

        }
    }


    protected synchronized LinkedBlockingQueue getMessageQueue(){
        if(messageQueue==null){
            messageQueue=new LinkedBlockingQueue(this.asyncQueueDepth);
        }
        return messageQueue;
    }

View Full Code Here

Examples of edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingQueue

        if( !started.compareAndSet(false, true) )
            return;
        
        longTermPersistence.setUseExternalMessageReferences(false);


        checkpointExecutor = new ThreadPoolExecutor(maxCheckpointWorkers, maxCheckpointWorkers, 30, TimeUnit.SECONDS, new LinkedBlockingQueue(), new ThreadFactory() {
            public Thread newThread(Runnable runable) {
                Thread t = new Thread(runable, "Journal checkpoint worker");
                t.setPriority(7);
                return t;
            }

View Full Code Here

Examples of edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingQueue


    public synchronized void start() throws Exception {
        if( !started.compareAndSet(false, true) )
            return;
        
        checkpointExecutor = new ThreadPoolExecutor(maxCheckpointWorkers, maxCheckpointWorkers, 30, TimeUnit.SECONDS, new LinkedBlockingQueue(), new ThreadFactory() {
            public Thread newThread(Runnable runable) {
                Thread t = new Thread(runable, "Journal checkpoint worker");
                t.setPriority(7);
                return t;
            }

View Full Code Here

Examples of edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingQueue

        if( !started.compareAndSet(false, true) )
            return;
        
        longTermPersistence.setUseExternalMessageReferences(true);


        checkpointExecutor = new ThreadPoolExecutor(maxCheckpointWorkers, maxCheckpointWorkers, 30, TimeUnit.SECONDS, new LinkedBlockingQueue(), new ThreadFactory() {
            public Thread newThread(Runnable runable) {
                Thread t = new Thread(runable, "Journal checkpoint worker");
                t.setPriority(7);
                return t;
            }

View Full Code Here

Examples of edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingQueue

        this.transport = transport;
        this.clientIdGenerator = clientIdGenerator;
        this.factoryStats = factoryStats;
        
        // Configure a single threaded executor who's core thread can timeout if idle
        asyncConnectionThread = new ThreadPoolExecutor(1,1,5,TimeUnit.SECONDS, new LinkedBlockingQueue(), new ThreadFactory() {
            public Thread newThread(Runnable r) {
                Thread thread = new Thread(r, "AcitveMQ Connection Worker: "+transport);
                thread.setDaemon(true);
                return thread;
            }});

View Full Code Here

Examples of edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingQueue

     * @param threadPriority priority for the threads.
     */
    public ThreadFiringStatsRecorder(int initialThreads, int maxThreads, int threadPriority) {
        this.threadPool 
            = new ThreadPoolExecutor(initialThreads, maxThreads, 0L, 
                    TimeUnit.MILLISECONDS, new LinkedBlockingQueue(), 
                    new PriorityThreadFactory(threadPriority));
    }

View Full Code Here

Examples of edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingQueue

    public void start() throws AxisFault {
        // create thread pool of workers
        workerPool = new ThreadPoolExecutor(
                1,
                WORKERS_MAX_THREADS, WORKER_KEEP_ALIVE, TIME_UNIT,
                new LinkedBlockingQueue(),
                new org.apache.axis2.util.threadpool.DefaultThreadFactory(
                        new ThreadGroup("JMS Worker thread group"),
                        "JMSWorker"));


        Iterator iter = connectionFactories.values().iterator();

View Full Code Here

Examples of edu.emory.mathcs.backport.java.util.concurrent.LinkedBlockingQueue

    /**
     * Create the executor used to launch the single requestConnectionListener
     */
    public ExecutorService newListenerExecutor(int port) {
        return new ThreadPoolExecutor(1, 1, 0L, TimeUnit.MILLISECONDS,
                                      new LinkedBlockingQueue(),
                                      new DefaultThreadFactory(
                                              new ThreadGroup("Listener thread group"),
                                              "HttpListener-" + this.port));
    }

View Full Code Here

0 1 2 3 4 5

TOP

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.