LinkedBlockingQueue 的 Java 性能问题

I have a big performance regression with Java 6 LinkedBlockingQueue. In the first thread i generate some objects which i push in to the queue In the second thread i pull these objects out. The performance regression occurs when the take() method of the LinkedBlockingQueue is called frequently. I monitored the whole program and the take() method claimed the most time overall. And the throughput goes from ~58Mb/s to 0.9Mb/s...

队列 pop 和 take 方法是使用此类中的静态方法调用的

the queue pop and take methods ar called with a static method from this class

public class C_myMessageQueue {

    private static final LinkedBlockingQueue<C_myMessageObject> x_queue = new LinkedBlockingQueue<C_myMessageObject>( 50000 );

    /**
     * @param message
     * @throws InterruptedException
     * @throws NullPointerException
     */
    public static void addMyMessage( C_myMessageObject message )
            throws InterruptedException, NullPointerException {
        x_queue.put( message );
    }

    /**
     * @return Die erste message der MesseageQueue
     * @throws InterruptedException
     */
    public static C_myMessageObject getMyMessage() throws InterruptedException {
        return x_queue.take();
    }
}

如何调整 take() 方法以达到至少 25Mb/s，或者我可以使用其他类在队列"满或空时阻塞.

how can I tune the take() method to accomplish at least 25Mb/s, or is there a other class I can use which will block when the "queue" is full or empty.

亲切的问候

巴特

P.S.:抱歉我的英语不好，我来自德国；)

P.S.: sorry for my bad english, I'm from Germany ;)

推荐答案

您的生产者线程只是放入的元素比消费者消耗的多，因此队列最终达到其容量限制，因此生产者等待.

Your producer thread simply puts more elements than the consumer consumes, so the queue eventually hits its capacity limit, thus the producer waits.

巩固我原来的答案，因为现在我们基本上有了全貌:

Consolidating my original answer since now we have basically the full picture: