Please login using the form on menu list.|
It is required to login for Full-Text PDF.
On the Time Complexity of Dijkstra's Three-State Mutual Exclusion Algorithm
IEICE TRANSACTIONS on Information and Systems Vol.E92-D No.8 pp.1570-1573
Publication Date: 2009/08/01
Online ISSN: 1745-1361
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Computation and Computational Models
analysis of algorithms,
Full Text: PDF(78KB)
In this letter we give a lower bound on the worst-case time complexity of Dijkstra's three-state mutual exclusion algorithm by specifying a concrete behavior of the algorithm. We also show that our result is more accurate than the known best bound.