### Expected deadlock time in a multiprocessing systemExpected deadlock time in a multiprocessing system

Access Restriction
Subscribed

 Author Compton, Kevin J. ♦ Ravishankar, Chinya Source ACM Digital Library Content type Text Publisher Association for Computing Machinery (ACM) File Format PDF Copyright Year ©1995 Language English
 Subject Domain (in DDC) Computer science, information & general works ♦ Data processing & computer science Subject Keyword Asymptotic analysis ♦ Expected time analysis ♦ Singularity analysis Abstract 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 $\textit{Q}-function$ arise. we use singularity analysis to obtain asymptotics of coefficients of generalized $\textit{Q}-functions.$ ISSN 00045411 Age Range 18 to 22 years ♦ above 22 year Educational Use Research Education Level UG and PG Learning Resource Type Article Publisher Date 1995-05-01 Publisher Place New York e-ISSN 1557735X Journal Journal of the ACM (JACM) Volume Number 42 Issue Number 3 Page Count 22 Starting Page 562 Ending Page 583

#### Open content in new tab

Source: ACM Digital Library