Skip to main content
Article thumbnail
Location of Repository

Expected deadlock time in a multiprocessor system

By Kevin J. Compton and Chinya Ravishankar


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, m 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, generahzations of the Ramanujan Q-function arise. We use singularity analysis to obtain asymptotlcs ot coefficients of generalized Q-functions

Topics: General Terms, Performance, Theory Additional Key Words and Phrases, Asymptotic analysis, expected time analysis, singularity
Year: 1995
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.