To divide their property, they have agreed on the following algorithm: Every morning, each one may send a letter to the other's lawyer requesting one item of property. Since it takes a day for letters to be delivered, they have agreed that if both discover that they have requested the same item on the same day, the next day they will send a letter canceling the request. Among their property is their dog, Woofer, Woofer's doghouse, their canary, Tweeter, and Tweeter's cage. The animals love their houses, so it has been agreed that any division of property separating an animal from its house is invalid, requiring the whole division to start over from scratch. Both Cinderella and the Prince desperately want the Woofer. So they can go on (separate) vacations, each spouse has programmed a personal computer to handle the negotiation. When they come back from vacation, the computers are still negotiating. Why? Is deadlock possible? Is starvation possible? :roll:
(from Tanenbaum: Modern Operating Systems, 2nd Edition)
Since both the Woofer and Tweeter are animals, starvation is of course possible. When the starving Woofer meets the Tweeter and the Tweeter doesn't escape swiftly enough, a deadlock between Woofer's teeth is also likely to happen.....
Honk if you love justice! And honk twice for tiny ads!