Affiliation:
1. Department of Computer Science, University of Colorado, Boulder, Colorado
Abstract
As the number of processes and resources increases within a computer system, does the probability of that system's being in deadlock increase or decrease? This paper introduces Probabilistic Automata as a model of computer systems. This allows investigation of the above question for various scheduling algorithms. A theorem is proven which indicates that, within the types of systems considered, the probability of deadlock increases.
Publisher
Association for Computing Machinery (ACM)
Reference14 articles.
1. System Deadlocks
2. Ellis C. A. "Probabilistic Languages and Automata " Ph.D. dissertation Computer Science Department University of Illinois 1969. Ellis C. A. "Probabilistic Languages and Automata " Ph.D. dissertation Computer Science Department University of Illinois 1969.
3. The Halting Problem for Probabilistic Context-Free Generators
4. A concurrent algorithm for avoiding deadlocks in multiprocess multiple resource systems
5. Prevention of system deadlocks