A tighter bound for the self-stabilization time in Herman's algorithm
文献类型：期刊论文
| 作者 | Feng, Yuan (1) ; Zhang, Lijun (2) |
| 刊名 | Information Processing Letters
 |
| 出版日期 | 2013 |
| 卷号 | 113期号:13页码:486-488 |
| 关键词 | Formal methods Self-stabilization algorithm Herman's algorithm Markov chains |
| ISSN号 | 200190 |
| 通讯作者 | Zhang, L.(zhanglj@ios.ac.cn) |
| 中文摘要 | We study the expected self-stabilization time of Herman's algorithm. For N processors the lower bound is 427N2 (0.148N2), and an upper bound of 0.64N2 is presented in Kiefer et al. (2011) [4]. In this paper we give a tighter upper bound 0.521N2. © 2013 Published by Elsevier B.V. |
| 英文摘要 | We study the expected self-stabilization time of Herman's algorithm. For N processors the lower bound is 427N2 (0.148N2), and an upper bound of 0.64N2 is presented in Kiefer et al. (2011) [4]. In this paper we give a tighter upper bound 0.521N2. © 2013 Published by Elsevier B.V. |
| 收录类别 | SCI ; EI |
| 语种 | 英语 |
| WOS记录号 | WOS:000319493400006 |
| 公开日期 | 2014-12-16 |
| 源URL | [http://ir.iscas.ac.cn/handle/311060/16923]  |
| 专题 | 软件研究所_软件所图书馆_期刊论文 |
| 推荐引用方式 GB/T 7714 | Feng, Yuan ,Zhang, Lijun . A tighter bound for the self-stabilization time in Herman's algorithm[J]. Information Processing Letters,2013,113(13):486-488. |
| APA | Feng, Yuan ,&Zhang, Lijun .(2013).A tighter bound for the self-stabilization time in Herman's algorithm.Information Processing Letters,113(13),486-488. |
| MLA | Feng, Yuan ,et al."A tighter bound for the self-stabilization time in Herman's algorithm".Information Processing Letters 113.13(2013):486-488. |
入库方式： OAI收割
来源：软件研究所
浏览0
下载0
收藏0
其他版本
除非特别说明，本系统中所有内容都受版权保护，并保留所有权利。