All Downloads are FREE. Search and download functionalities are using the official Maven repository.

com.hazelcast.util.executor.StripedExecutor Maven / Gradle / Ivy

/*
 * Copyright (c) 2008-2013, Hazelcast, Inc. All Rights Reserved.
 *
 * Licensed under the Apache License, Version 2.0 (the "License");
 * you may not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * http://www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an "AS IS" BASIS,
 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

package com.hazelcast.util.executor;

import com.hazelcast.logging.ILogger;

import java.util.Random;
import java.util.concurrent.BlockingQueue;
import java.util.concurrent.Executor;
import java.util.concurrent.LinkedBlockingQueue;
import java.util.concurrent.RejectedExecutionException;
import java.util.concurrent.TimeUnit;
import java.util.concurrent.atomic.AtomicLong;

/**
 * The StripedExecutor internally uses a stripe of queues and each queue has its own private worker-thread.
 * When a task is 'executed' on the StripedExecutor, the task is checked if it is a StripedRunnable. If it
 * is, the right worker is looked up and the task put in the queue of that worker. If the task is not a
 * StripedRunnable, a random worker is looked up.
 * 

* If the queue is full and the runnable implements TimeoutRunnable, then a configurable amount of blocking is * done on the queue. If the runnable doesn't implement TimeoutRunnable or when the blocking times out, * then the task is rejected and a RejectedExecutionException is thrown. */ public final class StripedExecutor implements Executor { public static final AtomicLong THREAD_ID_GENERATOR = new AtomicLong(); private final int size; private final Worker[] workers; private final Random rand = new Random(); private final int maximumQueueSize; private final ILogger logger; private volatile boolean live = true; public StripedExecutor(ILogger logger, String threadNamePrefix, ThreadGroup threadGroup , int threadCount, int maximumQueueSize) { this.logger = logger; this.maximumQueueSize = maximumQueueSize; this.size = threadCount; this.workers = new Worker[threadCount]; for (int i = 0; i < threadCount; i++) { Worker worker = new Worker(threadGroup, threadNamePrefix); worker.start(); workers[i] = worker; } } /** * Returns the total number of tasks pending to be executed. * * @return total work queue size. */ public int getWorkQueueSize() { int size = 0; for (Worker worker : workers) { size += worker.workQueue.size(); } return size; } /** * Shuts down this StripedExecutor. *

* No checking is done if the StripedExecutor already is shut down, so it should be called only once. *

* If there is any pending work, it will be thrown away. */ public void shutdown() { live = false; for (Worker worker : workers) { worker.workQueue.clear(); worker.interrupt(); } } /** * Checks if this StripedExecutor is alive (so not shut down). * * @return */ public boolean isLive() { return live; } @Override public void execute(Runnable command) { if (command == null) { throw new NullPointerException("command can't be null"); } if (!live) { throw new RejectedExecutionException("Executor is terminated!"); } Worker worker = getWorker(command); worker.schedule(command); } private Worker getWorker(Runnable command) { final int key; if (command instanceof StripedRunnable) { key = ((StripedRunnable) command).getKey(); } else { key = rand.nextInt(); } final int index; if (key == Integer.MIN_VALUE) { index = 0; } else { index = Math.abs(key) % size; } return workers[index]; } private final class Worker extends Thread { private final BlockingQueue workQueue = new LinkedBlockingQueue(maximumQueueSize); private Worker(ThreadGroup threadGroup, String threadNamePrefix) { super(threadGroup, threadNamePrefix + "-" + THREAD_ID_GENERATOR.incrementAndGet()); } private void schedule(Runnable command) { long timeout = 0; TimeUnit timeUnit = TimeUnit.SECONDS; if (command instanceof TimeoutRunnable) { TimeoutRunnable timeoutRunnable = ((TimeoutRunnable) command); timeout = timeoutRunnable.getTimeout(); timeUnit = timeoutRunnable.getTimeUnit(); } boolean offered; try { if (timeout == 0) { offered = workQueue.offer(command); } else { offered = workQueue.offer(command, timeout, timeUnit); } } catch (InterruptedException e) { throw new RejectedExecutionException("Thread is interrupted while offering work"); } if (!offered) { throw new RejectedExecutionException("Task: " + command + " is rejected, the worker queue is full!"); } } @Override public void run() { for (;;) { try { try { Runnable task = workQueue.take(); process(task); } catch (InterruptedException e) { if (!live) { return; } } } catch (Throwable t) { //This should not happen because the process method is protected against failure. //So if this happens, something very seriously is going wrong. logger.severe(getName() + " caught an exception", t); } } } private void process(Runnable task) { try { task.run(); } catch (Throwable e) { logger.severe(getName() + " caught an exception while processing task:" + task, e); } } } }





© 2015 - 2024 Weber Informatics LLC | Privacy Policy