Stochastic analysis of distributed deadlock scheduling

  • Authors:

  • Shigang Chen;Yibei Ling

  • Affiliations:

  • University of Florida;Applied Research Laboratories, Telcordia Technologies. Email: lingy@research.telcordia.com/ yibei.ling@gmail.com

  • Venue:
  • Proceedings of the twenty-fourth annual ACM symposium on Principles of distributed computing
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

Deadlock detection scheduling is an important, yet oft-overlooked problem that can significantly affect the overall performance of deadlock handling.An excessive initiation of deadlock detection increases overall message usage, resulting in degraded system performance in the absence of deadlocks; while a deficient initiation of deadlock detection increases the deadlock persistence time, resulting in an increased deadlock resolution cost in the presence of deadlocks. Such a performance tradeoff, however, is generally missing in literature. In this paper we study the impact of deadlock detection scheduling on the system performance, and show that there exists an optimal deadlock detection frequency that yields the minimum long-run mean average cost associated with the message complexity of deadlock detection and resolution algorithms, and the rate of deadlock formation, λ. Based on the up-to-date deadlock detection and resolution algorithms, we show that the asymptotically optimal frequency of deadlock detection scheduling that minimizes the message overhead is cal O((λ n)1/3), when the total number of processes n is sufficiently large. Furthermore, we show that in general fully distributed (uncoordinated) deadlock detection scheduling can not be performed as efficiently as centralized (coordinated) deadlock detection scheduling.