On the probability of deadlock in computer systems

Authors:
Clarence A. Ellis
Affiliations:
Department of Computer Science, University of Colorado, Boulder, Colorado
Venue:
SOSP '73 Proceedings of the fourth ACM symposium on Operating system principles
Year:
1973

Citing 9
Cited 1

The Halting Problem for Probabilistic Context-Free Generators

Journal of the ACM (JACM)
System Deadlocks

ACM Computing Surveys (CSUR)
Some Deadlock Properties of Computer Systems

ACM Computing Surveys (CSUR)
Compact finite difference schemes for ocean models: 1. Ocean waves

Journal of Computational Physics
A concurrent algorithm for avoiding deadlocks in multiprocess multiple resource systems

SOSP '71 Proceedings of the third ACM symposium on Operating systems principles
DEADLOCK-FREE SHARING OF RESOURCES IN ASYNCHRONOUS SYSTEMS

DEADLOCK-FREE SHARING OF RESOURCES IN ASYNCHRONOUS SYSTEMS
On deadlock in computer systems

On deadlock in computer systems
Formal languages and their relation to automata

Formal languages and their relation to automata
Introduction to probabilistic automata (Computer science and applied mathematics)

Introduction to probabilistic automata (Computer science and applied mathematics)

Deadlock Detection in Distributed Systems

Computer

Quantified Score

Hi-index	0.00

Visualization

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.