concurrent API提供了一个名为Lock的类,它将序列化控件以访问关键资源。它给出了park()和unpark()等方法。
如果我们可以使用synchronized关键字并使用wait()和notify() notifyAll()方法,我们也可以做类似的事情。
我想知道哪一个在实践中更好,为什么?
concurrent API提供了一个名为Lock的类,它将序列化控件以访问关键资源。它给出了park()和unpark()等方法。
如果我们可以使用synchronized关键字并使用wait()和notify() notifyAll()方法,我们也可以做类似的事情。
我想知道哪一个在实践中更好,为什么?
当前回答
为什么要使用synchronized或java.util.concurrent.Lock有4个主要因素。
注意:同步锁定就是我所说的内在锁定。
When Java 5 came out with ReentrantLocks, they proved to have quite a noticeble throughput difference then intrinsic locking. If youre looking for faster locking mechanism and are running 1.5 consider j.u.c.ReentrantLock. Java 6's intrinsic locking is now comparable. j.u.c.Lock has different mechanisms for locking. Lock interruptable - attempt to lock until the locking thread is interrupted; timed lock - attempt to lock for a certain amount of time and give up if you do not succeed; tryLock - attempt to lock, if some other thread is holding the lock give up. This all is included aside from the simple lock. Intrinsic locking only offers simple locking Style. If both 1 and 2 do not fall into categories of what you are concerned with most people, including myself, would find the intrinsic locking semenatics easier to read and less verbose then j.u.c.Lock locking. Multiple Conditions. An object you lock on can only be notified and waited for a single case. Lock's newCondition method allows for a single Lock to have mutliple reasons to await or signal. I have yet to actually need this functionality in practice, but is a nice feature for those who need it.
其他回答
Brian Goetz的《Java并发实践》一书,第13.3节: "...像默认的ReentrantLock一样,内在锁不提供确定性的公平性保证,但是 大多数锁定实现的统计公平性保证对于几乎所有情况都足够好……”
主要的区别是公平性,换句话说,请求是FIFO处理还是可以有驳船?方法级同步确保公平或FIFO分配锁。使用
synchronized(foo) {
}
or
lock.acquire(); .....lock.release();
不能保证公平。
如果您对锁有很多争用,那么您很容易遇到barging,即新请求获得锁而旧请求卡住。我曾经见过这样的情况:为了一个锁,200个线程在短时间内到达,而第二个到达的线程最后被处理。这对于某些应用程序是可行的,但对于其他应用程序则是致命的。
请参阅Brian Goetz的《Java并发实践》一书中的13.3节,以获得关于此主题的完整讨论。
为什么要使用synchronized或java.util.concurrent.Lock有4个主要因素。
注意:同步锁定就是我所说的内在锁定。
When Java 5 came out with ReentrantLocks, they proved to have quite a noticeble throughput difference then intrinsic locking. If youre looking for faster locking mechanism and are running 1.5 consider j.u.c.ReentrantLock. Java 6's intrinsic locking is now comparable. j.u.c.Lock has different mechanisms for locking. Lock interruptable - attempt to lock until the locking thread is interrupted; timed lock - attempt to lock for a certain amount of time and give up if you do not succeed; tryLock - attempt to lock, if some other thread is holding the lock give up. This all is included aside from the simple lock. Intrinsic locking only offers simple locking Style. If both 1 and 2 do not fall into categories of what you are concerned with most people, including myself, would find the intrinsic locking semenatics easier to read and less verbose then j.u.c.Lock locking. Multiple Conditions. An object you lock on can only be notified and waited for a single case. Lock's newCondition method allows for a single Lock to have mutliple reasons to await or signal. I have yet to actually need this functionality in practice, but is a nice feature for those who need it.
锁让程序员的生活更轻松。以下是使用锁可以轻松实现的几种情况。
Lock in one method, and release the lock in another method. If You have two threads working on two different pieces of code, however, in the first thread has a pre-requisite on a certain piece of code in the second thread (while some other threads also working on the same piece of code in the second thread simultaneously). A shared lock can solve this problem quite easily. Implementing monitors. For example, a simple queue where the put and get methods are executed from many other threads. However, you do not want multiple put (or get) methods running simultaneously, neither the put and get method running simultaneously. A private lock makes your life a lot easier to achieve this.
同时,锁和条件建立在同步机制之上。因此,当然可以实现与使用锁相同的功能。但是,使用同步解决复杂的场景可能会使您的生活变得困难,并可能使您偏离解决实际问题的方向。
锁和同步块都有相同的目的,但这取决于使用情况。考虑以下部分
void randomFunction(){
.
.
.
synchronize(this){
//do some functionality
}
.
.
.
synchronize(this)
{
// do some functionality
}
} // end of randomFunction
在上述情况下,如果一个线程进入同步块,另一个块也被锁定。如果在同一个对象上有多个这样的同步块,则所有的同步块都被锁定。在这种情况下,可以使用java.util.concurrent.Lock来防止不必要的块锁定