About the local detection of termination of local computations in graphs
SIROCCO(1997)
摘要
. In this paper we give a formalization of the problem of locallydetecting the global termination of distributed algorithms on graphs. Weintroduce the notion of quasi k\Gammacoverings. Using (quasi) k\Gammacoverings, wepresent methods for showing that it is not possible to detect locally theglobal termination of local computations in certain families of graphs.These methods also allow to show that some knowledge, e.g. the size ofthe graph, is necessary in order to solve certain problems...
更多查看译文
关键词
distributed algorithm
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络