Reports
On the Probability of Deadlock in Computer Sciences ; CU-CS-026-73 Public Deposited
https://scholar.colorado.edu/concern/reports/st74cr32f
- 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 proved which indicates that, within the types of systems considered, the probability of deadlock increases.
- Creator
- Date Issued
- 1973-08-01
- Academic Affiliation
- Last Modified
- 2019-12-21
- Resource Type
- Rights Statement
- Language
Relationships
Items
| Thumbnail | Title | Date Uploaded | Visibility | Actions |
|---|---|---|---|---|
|
|
onTheProbabilityOfDeadlockInComputerSciencesCuCs0267.pdf | 2019-12-21 | Public | Download |