A tighter bound for the self-stabilization time in Herman's algorithm

ISCAS OpenIR

	A tighter bound for the self-stabilization time in Herman's algorithm
	Feng, Yuan (1); Zhang, Lijun (2); Zhang, L.(zhanglj@ios.ac.cn)
	2013
发表期刊	Information Processing Letters
ISSN	200190
卷号	113 期号:13 页码:486-488
摘要	We study the expected self-stabilization time of Herman's algorithm. For N processors the lower bound is 427N² (0.148N²), and an upper bound of 0.64N² is presented in Kiefer et al. (2011) [4]. In this paper we give a tighter upper bound 0.521N². © 2013 Published by Elsevier B.V.; We study the expected self-stabilization time of Herman's algorithm. For N processors the lower bound is 427N² (0.148N²), and an upper bound of 0.64N² is presented in Kiefer et al. (2011) [4]. In this paper we give a tighter upper bound 0.521N². © 2013 Published by Elsevier B.V.
收录类别	SCI ; EI
关键词	Formal Methods Self-stabilization Algorithm Herman's Algorithm Markov Chains
部门归属	(1) University of Technology Sydney, Australia University of Technology, Sydney, Australia; (2) State Key Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, China; (3) Technical University of Denmark, DTU Compute, Denmark
语种	英语
WOS记录号	WOS:000319493400006
引用统计
内容类型	期刊论文
URI标识	http://ir.iscas.ac.cn/handle/311060/16923
专题	中国科学院软件研究所
通讯作者	Zhang, L.(zhanglj@ios.ac.cn)
推荐引用方式 GB/T 7714	Feng, Yuan ,Zhang, Lijun ,Zhang, L.. 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 ,&Zhang, L..(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.