Fault-tolerant broadcast in anonymous systems

被引:0
作者
Ernesto Jiménez
Sergio Arévalo
Jian Tang
机构
[1] Universidad Politécnica de Madrid,
[2] EPN,undefined
来源
The Journal of Supercomputing | 2015年 / 71卷
关键词
Distributed computing; Fault tolerance; Reliable, uniform and atomic broadcast services; Failure detector; Anonymous distributed system;
D O I
暂无
中图分类号
学科分类号
摘要
The broadcast service spreads a message m among all processes of a distributed system, such that each process eventually delivers m. A basic broadcast service does not impose any delivery guarantee in a system with failures. Fault-tolerant broadcast is a fundamental problem in distributed systems that adds certainty in the delivery of messages when crashes can happen in the system. Traditionally, the fault-tolerant broadcast service has been studied in classical distributed systems when each process has a unique identity. However, very recently have appeared new distributed systems, such as sensor networks, where unique identity is not always possible to be included in each sensor node (due to small storage capacity, reduced computational power, a huge number of elements to be identified, etc.). In this paper, we study the definition and implementability of the fault-tolerant broadcast service in anonymous asynchronous systems, that is, in asynchronous systems where all processes have the same identity, and, hence, they are indistinguishable (they may have the same code).
引用
收藏
页码:4172 / 4191
页数:19
相关论文
共 59 条
[1]  
Akyildiz IF(2002)Wireless sensor networks: a survey Comput Netw 38 393-422
[2]  
Weilian S(2006)Computation in networks of passively mobile finite-state sensors Distrib Comput 18 235-253
[3]  
Sankarasubramaniam Y(1990)A parallel algorithm for the arbitrary rotation of digitized images using process-and-data-decomposition approach J Parallel Distrib Comput 10 188-192
[4]  
Cayirci E(1996)Parallel stereocorrelation on a reconfigurable multi-ring network J Supercomput 10 243-269
[5]  
Angluin D(1987)Arbitrary rotation of raster images with SIMD machine architectures Comput Graph Forum 6 3-11
[6]  
Aspnes J(1987)A transputer network for the arbitrary rotation of digitised images Comput J 30 425-432
[7]  
Diamadi Z(1989)A transputer network for fast operations on digitised images Comput Graph Forum 8 3-11
[8]  
Fischer MJ(2006)A classification of total order specifications and its application to fixed sequencer-based implementations J Parallel Distrib Comput 66 108-127
[9]  
Peralta R(1995)The hough transform on a reconfigurable multi-ring network J Parallel Distrib Comput 24 107-114
[10]  
Arabnia HR(1995)The REFINE multiprocessor—theoretical properties and algorithms Parallel Comput 21 1783-1805