Give amore efficient solution to the previous exercise that avoids the use of notify All. (It is tempting to observe that the buffer can never

Question

37 users unlocked this solution today!

Give amore efficient solution to the previous exercise that avoids the use of notify All. (It is tempting to observe that the buffer can never be both full and empty at the same time, and to assume therefore that waiting threads are either all producers or all consumers. This need not be the case, however: if the buffer ever becomes even a temporary performance bottleneck, there may be an arbitrary number of waiting threads, including both producers and consumers.)