【发布时间】:2015-08-04 08:58:36
【问题描述】:
Condition JavaDoc 有以下代码示例:
class BoundedBuffer {
final Lock lock = new ReentrantLock();
final Condition notFull = lock.newCondition();
final Condition notEmpty = lock.newCondition();
final Object[] items = new Object[100];
int putptr, takeptr, count;
public void put(Object x) throws InterruptedException {
lock.lock();
try {
while (count == items.length)
notFull.await();
items[putptr] = x;
if (++putptr == items.length) putptr = 0;
++count;
notEmpty.signal();
} finally {
lock.unlock();
}
}
public Object take() throws InterruptedException {
lock.lock();
try {
while (count == 0)
notEmpty.await();
Object x = items[takeptr];
if (++takeptr == items.length) takeptr = 0;
--count;
notFull.signal();
return x;
} finally {
lock.unlock();
}
}
}
如果我实现了BoundedBuffer#take,我只会在count == (items.length - 2) 时才调用notFull.signal(),以避免在必要时向其他线程发出信号。我还注意到ArrayBlockingQueue#removeAt 正在热切地呼叫notFull.signal();。
问题:我的支票会引入错误吗?在条件为真时急切地发出信号是 Java 并发编程的最佳实践吗?我认为它会降低死锁的风险。它对性能有影响吗?
【问题讨论】:
-
这似乎没有什么不同,因为从另一个受同一个锁保护的块看时,
lock()和unlock()之间的一切似乎都是原子发生的。当锁被争用时,它会影响调度吗?这样看起来也更具可读性。
标签: java multithreading concurrency java.util.concurrent