Showing papers by "Michael Merritt published in 1984"
27 Aug 1984
TL;DR: This paper presents two distributed algorithms for detecting and resolving deadlocks, each of which insuring that only one of the deadlock processes will detect it, and the problem of resolving the deadlocked process is simplified.
Abstract: This paper presents two distributed algorithms for detecting and resolving deadlocks. By insuring that only one of the deadlock processes will detect it, the problem of resolving the deadlock is simplified. That process could simply abort itself. In one version of the algorithm, an arbitrary process detects deadlock; and in a second version, the process with the lowest priority detects deadlock.
124 citations
27 Aug 1984
TL;DR: The news media often bombards the public with forecasts of election results, but the time at which the final results may be known with certainty depends upon the accuracy of the forecast, the number of disputed votes, and the closeness of the election.
Abstract: The news media often bombards the public with forecasts of election results. Polls predict, sometimes years in advance; exit polls are more accurate, and unofficial tallies tend to be closer to the final results. If close elections are disputed, it may take the courts weeks to determine the actual outcome of an election. If the election is nearly unanimous, however, a few disputed votes can have no outcome on the final results. The time at which the final results may be known with certainty thus depends upon the accuracy of the forecast (the number of disputed votes), and the closeness of the election.
14 citations