An impossibility about failure detectors in the iterated immediate snapshot model

被引:9
作者
Rajsbaum, Sergio [2 ]
Raynal, Michel [1 ]
Travers, Corentin [1 ]
机构
[1] IRISA, F-35042 Rennes, France
[2] Univ Nacl Autonoma Mexico, Inst Matemat, Mexico City 04510, DF, Mexico
关键词
Asynchronous shared memory system; Atomic read/write register; Distributed computing; Distributed computability; Failure detector; Iterated immediate snapshot model; Process crash; Snapshot operation;
D O I
10.1016/j.ipl.2008.05.001
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
The Iterated Immediate Snapshot model (IIS) is ail asynchronous computation model where processes communicate through a sequence of one-shot Immediate Snapshot (IS) objects. It is known that this model is equivalent to the usual asynchronous read/write shared memory model, for wait-free task solvability. Its interest lies in the fact that its runs are more structured and easier to analyze than the runs in the shared memory model. As the IIS model and the shared memory model are equivalent for wait-free task solvability, a natural question is the following: Are they still equivalent for wait-free task solvability, when they are enriched with the same failure detector? The paper shows that the answer to this question is "no". (C) 2008 Elsevier B.V. All rights reserved.
引用
收藏
页码:160 / 164
页数:5
相关论文
共 23 条
[1]   ATOMIC SNAPSHOTS OF SHARED-MEMORY [J].
AFEK, Y ;
ATTIYA, H ;
DOLEV, D ;
GAFNI, E ;
MERRITT, M ;
SHAVIT, N .
JOURNAL OF THE ACM, 1993, 40 (04) :873-890
[2]  
Afek Y, 2006, LECT NOTES COMPUT SC, V4308, P331
[3]   Atomic snapshots in O(n log n) operations [J].
Attiya, H ;
Rachman, O .
SIAM JOURNAL ON COMPUTING, 1998, 27 (02) :319-340
[4]  
Borowsky E., 1993, Proceedings of the Twelfth Annual ACM Symposium on Principles of Distributed Computing, P41, DOI 10.1145/164051.164056
[5]  
Borowsky E., 1997, Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, P189, DOI 10.1145/259380.259439
[6]   Unreliable failure detectors for reliable distributed systems [J].
Chandra, TD ;
Toueg, S .
JOURNAL OF THE ACM, 1996, 43 (02) :225-267
[7]   The weakest failure detector for solving Consensus [J].
Chandra, TD ;
Hadzilacos, V ;
Toueg, S .
JOURNAL OF THE ACM, 1996, 43 (04) :685-722
[8]   MORE CHOICES ALLOW MORE FAULTS - SET CONSENSUS PROBLEMS IN TOTALLY ASYNCHRONOUS SYSTEMS [J].
CHAUDHURI, S .
INFORMATION AND COMPUTATION, 1993, 105 (01) :132-158
[9]  
Delporte-Gallet C., 2004, PODC 04, P338
[10]   IMPOSSIBILITY OF DISTRIBUTED CONSENSUS WITH ONE FAULTY PROCESS [J].
FISCHER, MJ ;
LYNCH, NA ;
PATERSON, MS .
JOURNAL OF THE ACM, 1985, 32 (02) :374-382