IEICE Transactions on Information and Systems
Online ISSN : 1745-1361
Print ISSN : 0916-8532
Regular Section
On the Time Complexity of Dijkstra's Three-State Mutual Exclusion Algorithm
Masahiro KIMOTOTatsuhiro TSUCHIYATohru KIKUNO
著者情報
ジャーナル フリー

2009 年 E92.D 巻 8 号 p. 1570-1573

詳細
抄録
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.
著者関連情報
© 2009 The Institute of Electronics, Information and Communication Engineers
前の記事 次の記事
feedback
Top