An analysis of optimum caching
Journal of Algorithms
The logical design of operating systems (2nd ed.)
The logical design of operating systems (2nd ed.)
Generating functionology
Concrete mathematics: a foundation for computer science
Concrete mathematics: a foundation for computer science
EUROCRYPT '89 Proceedings of the workshop on the theory and application of cryptographic techniques on Advances in cryptology
Average-case analysis of algorithms and data structures
Handbook of theoretical computer science (vol. A)
Random Resource Allocation Graphs and the Probability of Deadlock
SIAM Journal on Discrete Mathematics
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Random Allocations and Probabilistic Languages
ICALP '88 Proceedings of the 15th International Colloquium on Automata, Languages and Programming
On the average behavior of set merging algorithms (Extended Abstract)
STOC '76 Proceedings of the eighth annual ACM symposium on Theory of computing
Uniform asymptotics of some Abel sums arising in coding theory
Theoretical Computer Science
| Hi-index | 0.01 |
We consider multiprocessing systems where processes make independent, Poisson distributed resource requests with mean arrival time 1. We assume that resources are not released. It is shown that the expected deadlock time is never less than 1, no matter how many processes and resources are in the system. Also, the expected number of processes blocked by deadlock time is one-half more than half the number of initially active processes. We obtain expressions for system statistics such as expected deadlock time, expected total processing time, and system efficiency, in terms of Abel sums. We derive asymptotic expressions for these statistics in the case of systems with many processes and the case of systems with a fixed number of processes. In the latter, generalizations of the Ramanujan Q-function arise. we use singularity analysis to obtain asymptotics of coefficients of generalized Q-functions.