The use of the implicit monitors in Java objects is powerful, but you can achieve a more subtle level of control through inter-process communication. As you will see, this is especially easy in Java.
Multithreading replaces event loop programming by dividing your tasks into discrete and logical units. Threads also provide a secondary benefit: they do away with polling. Polling is usually implemented by a loop that is used to check some condition repeatedly. Once the condition is true, appropriate action is taken. This wastes CPU time. For example, consider the classic queuing problem, where one thread is producing some data and another is consuming it. To make the problem more interesting, suppose that the producer has to wait until the consumer is finished before it generates more data. In a polling system, the consumer would waste many CPU cycles while it
waited for the producer to produce. Once the producer was finished, it would start polling, wasting more CPU cycles waiting for the consumer to finish, and so on. Clearly, this situation is undesirable.
To avoid polling, Java includes an elegant interrocess communication mechanism via the wait( ), notify( ), and notifyAll( ) methods. These methods are implemented as final methods in Object, so all classes have them. All three methods can be called only from within a synchronized method. Although conceptually advanced from a computer science perspective, the rules for using these methods are actually quite simple:
* wait( ) tells the calling thread to give up the monitor and go to sleep until some other
thread enters the same monitor and calls notify( ).
* notify( ) wakes up the first thread that called wait( ) on the same object.
* notifyAll( ) wakes up all the threads that called wait( ) on the same object. The
highest priority thread will run first.
These methods are declared within Object, as shown here:
final void wait( ) throws InterruptedException
final void notify( )
final void notifyAll( )
Additional forms of wait( ) exist that allow you to specify a period of time to wait. The following sample program incorrectly implements a simple form of the producer/consumer problem. It consists of four classes: Q, the queue that you're trying to synchronize; Producer, the threaded object that is producing queue entries; Consumer, the threaded object that is consuming queue entries; and PC, the tiny class that creates the single Q, Producer, and Consumer.
// An incorrect implementation of a producer and consumer.
class Q {
int n;
synchronized int get() {
System.out.println("Got: " + n);
return n;
}
synchronized void put(int n) {
this.n = n;
System.out.println("Put: " + n);
}
}
class Producer implements Runnable {
Q q;
Producer(Q q) {
this.q = q;
new Thread(this, "Producer").start();
}
public void run() {
int i = 0;
while (true) {
q.put(i++);
}
}
}
class Consumer implements Runnable {
Q q;
Consumer(Q q) {
this.q = q;
new Thread(this, "Consumer").start();
}
public void run() {
while (true) {
q.get();
}
}
}
class PC {
public static void main(String args[]) {
Q q = new Q();
new Producer(q);
new Consumer(q);
System.out.println("Press Control-C to stop.");
}
}
Although the put( )
and get( )
methods on Q
are
synchronized, nothing stops the producer from overrunning the consumer,
nor will anything stop
the consumer from consuming the same queue value twice. Thus, you get
the
erroneous output shown here (the exact output will vary with processor
speed and task load):
Put: 1
Got: 1
Got: 1
Got: 1
Got: 1
Got: 1
Put: 2
Put: 3
Put: 4
Put: 5
Put: 6
Put: 7
Got: 7
As you can see, after the producer put 1, the consumer started
and got the same 1 five times in a row. Then, the producer resumed and
produced 2
through 7 without letting the consumer have a chance to consume them.
The proper way to write this program in Java is to use wait(
)
and notify( )
to signal in both directions, as shown here:
package com.thread;
class Q {
int n;
boolean valueSet = false;
synchronized int get() {
if (!valueSet) {
System.out.println("a");// 测试
try {
wait();
} catch (InterruptedException e) {
System.out.println("InterruptedException caught");
}
}
System.out.println("b");// 测试
System.out.println("Got: " + n);
valueSet = false;
notify();
return n;
}
synchronized void put(int n) {
System.out.println("e");// 测试
if (valueSet) {
System.out.println("c");// 测试
try {
wait();
} catch (InterruptedException e) {
System.out.println("InterruptedException caught");
}
}
this.n = n;
valueSet = true;
System.out.println("d");// 测试
System.out.println("Put: " + n);
notify();
System.out.println("f");// 测试
}
}
class Producer implements Runnable {
Q q;
Producer(Q q) {
this.q = q;
new Thread(this, "Producer").start();
}
public void run() {
int i = 0;
while (i < 10) {
q.put(i++);
}
}
}
class Consumer implements Runnable {
Q q;
Consumer(Q q) {
this.q = q;
new Thread(this, "Consumer").start();
}
public void run() {
while (true) {
q.get();
}
}
}
class PCFixed {
public static void main(String args[]) {
Q q = new Q();
new Producer(q);
new Consumer(q);
System.out.println("Press Control-C to stop.");
}
}
Inside get( )
, wait( )
is called. This causes its
execution to suspend until the Producer
notifies you that some data is ready. When this happens,
execution inside get( )
resumes. After the data has been obtained, get( )
calls notify(
)
. This tells Producer
that it is okay to put more data in
the queue. Inside put( )
, wait(
)
suspends execution until the
Consumer
has removed the item from the queue. When execution
resumes, the next item of data is put in the queue, and notify( )
is
called.
This tells the Consumer
that it should now remove it.
Here is some output from this program, which shows the clean
synchronous behavior:
e
d
Press Control-C to stop.
Put: 0
f
e
c
b
Got: 0
a
d
Put: 1
f
e
c
b
Got: 1
a
d
Put: 2
f
e
c
b
Got: 2
a
d
Put: 3
f
e
c
b
Got: 3
a
d
Put: 4
f
e
c
b
Got: 4
a
d
Put: 5
f
e
c
b
Got: 5
a
d
Put: 6
f
e
c
b
Got: 6
a
d
Put: 7
f
e
c
b
Got: 7
a
d
Put: 8
f
e
c
b
Got: 8
a
d
Put: 9
f
b
Got: 9
a
This tutorial is an extract from the book "The complete Reference
Java 2" by Herbert Schildt
When used correctly, notify and wait don't need workarounds such
as valueSet.
Here's the improved version:
----------------------
// A correct implementation of a producer and consumer.
class Q {
int n;
synchronized int get() {
try {
notify();
wait();
} catch (InterruptedException e) {
System.out.println("InterruptedException caught");
}
System.out.println("Got: " + n);
return n;
}
synchronized void put(int n) {
try {
notify();
wait();
} catch (InterruptedException e) {
System.out.println("InterruptedException caught");
}
this.n = n;
System.out.println("Put: " + n);
}
}
public class Producer implements Runnable {
Q q;
Producer(Q q) {
this.q = q;
new Thread(this, "Producer").start();
}
public void run() {
int i = 0;
while (true) {
q.put(i++);
}
}
}
class Consumer implements Runnable {
Q q;
Consumer(Q q) {
this.q = q;
new Thread(this, "Consumer").start();
}
public void run() {
while (true) {
q.get();
}
}
}
class PCFixed {
public static void main(String args[]) {
Q q = new Q();
new Producer(q);
new Consumer(q);
System.out.println("Press Control-C to stop.");
}
}
扫一扫
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
