SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2001, Pages 151-160

A hierarchy of conditions for consensus solvability

(4) Mostefaoui, A a Rajsbaum, S a Raynal, M a Roy, M a

a CAMPUS DE BEAULIEU (France)

Author keywords

Asynchronous shared memory; Consensus; Fault tolerance; Snapshot; Step Complexity

Indexed keywords

FAULT TOLERANT COMPUTER SYSTEMS; HIERARCHICAL SYSTEMS; MATHEMATICAL MODELS; NETWORK PROTOCOLS; RELIABILITY;

ASYNCHRONOUS SHARED MEMORY; CONSENSUS; STEP COMPLEXITY;

VECTOR QUANTIZATION;

EID: 0034782130 PISSN: None EISSN: None Source Type: Conference Proceeding
DOI: 10.1145/383962.384006 Document Type: Conference Paper

Times cited : (16)

References (25)

1
- 0027660422
- Atomic snapshots of shared memory
- (1993) Journal of the ACM , vol.40 , Issue.4 , pp. 873-890
- Afek, Y.¹ Attiya, H.² Dolev, D.³ Gafni, E.⁴ Merritt, M.⁵ Shavit, N.⁶

2
- 0032277585
- Failure detection and randomization: A hybrid approach to solve consensus
- (1998) SIAM Journal of Computing , vol.28 , Issue.3 , pp. 890-903
- Aguilera, M.K.¹ Toueg, S.²

3
- 0000321660
- Atomic snapshots using lattice agreement
- (1995) Distributed Computing , vol.8 , Issue.3 , pp. 121-132
- Attiya, H.¹ Herlihy, M.P.² Rachman, O.³

4
- 0000438061
- Atomic snapshots in O(n log n) operations
- (1998) SIAM Journal of Computing , vol.27 , Issue.2 , pp. 319-340
- Attiya, H.¹ Rachman, O.²

5
- 0002992023
- McGraw-Hill
- Distributed Computing: Fundamentals, Simulations and Advanced Topics , vol.451 , pp. 1998
- Attiya, H.¹ Welch, J.²

6
- 0020976844
- Another advantage of free choice: Completely asynchronous agreement protocols
- ACM Press; Montreal (Canada)
- (1983) Proc. 2nd ACM Symposium on Principles of Distributed Computing (PODC'83) , pp. 27-30
- Ben-Or, M.¹

7
- 84896784367
- Adaptability and the usefulness of hints (extended abstract)
- (1998) 6th European Symposium on Algorithms (ESA'98), Venice (Italy). Springer-Verlag LNCS #1461 , pp. 271-282
- Garay, J.¹ Berman, P.²

8
- 0035390412
- The BG distributed simulation algorithm
- (2001) Distributed Computing
- Borowsky, E.¹ Gafni, E.² Lynch, N.A.³ Rajsbaum, S.⁴

9
- 38249016277
- A combinatorial characterization of the distributed 1-solvable tasks
- (1990) Journal of Algorithms , vol.11 , pp. 420-440
- Biran, O.¹ Moran, S.² Zaks, S.³

10
- 84902734616
- Deciding 1-solvability of distributed tasks in NP-hard
- (1990) Proc. 16th International Workshop on Graph-Theoretic Concepts in Computer Science (WG'90), Springer-Verlag LNCS #484 , pp. 206-220
- Biran, O.¹ Moran, S.² Zaks, S.³

11
- 0030102105
- Unreliable failure detectors for reliable distributed systems
- (1996) JACM , vol.43 , Issue.2 , pp. 225-267
- Chandra, T.¹ Toueg, S.²

12
- 0001197842
- More choices allow more faults: Set consensus problems in totally asynchronous systems
- (1993) Information and Computation , vol.105 , pp. 132-158
- Chaudhuri, S.¹

13
- 0023994903
- Consensus in the presence of partial synchrony
- (1988) JACM , vol.35 , Issue.2 , pp. 288-323
- Dwork, C.¹ Lynch, N.A.² Stockmeyer, L.³

14
- 0022754708
- Reaching approximate agreement in the presence of faults
- (1986) JACM , vol.33 , Issue.3 , pp. 499-516
- Dolev, D.¹ Lynch, N.A.² Pinter, S.³ Stark, E.W.⁴ Weihl, W.E.⁵

15
- 0022045868
- Impossibility of distributed consensus with one faulty process
- (1985) JACM , vol.32 , Issue.2 , pp. 374-382
- Fischer, M.J.¹ Lynch, N.A.² Paterson, M.S.³

16
- 0032256640
- Three-processor tasks are undecidable
- (1999) SIAM Journal of Computing , vol.28 , Issue.3 , pp. 970-983
- Gafni, E.¹ Koutsoupias, E.²

17
- 0030713848
- On the decidability of distributed decision tasks
- ACM Press
- (1997) Proc. 29th ACM Symposium on the Theory of Computing (STOC'97) , pp. 589-598
- Herlihy, M.P.¹ Rajsbaum, S.²

18
- 84949222007
- New perspectives in distributed computing
- (1999) Invited Talk, Proc. 24th Int. Symposium on Mathematical Foundations of Computer Science (MFCS'99), Springer-Verlag LNCS #1672 , pp. 170-186
- Herlihy, M.P.¹ Rajsbaum, S.²

19
- 85013422102
- Linear-time snapshot using multi-writer multi-reader registers
- October
- (1994) Proc. 8th Int. Workshop on Distributed Algorithms (WDAG'94), Springer-Verlag LNCS #857 , pp. 130-140
- Inoue, M.¹ Chen, W.² Masuzawa, T.³ Tokura, N.⁴

20
- 85028889773
- Linear-time snapshot protocols for unbalanced systems
- (1993) Proc. 7th Int. Workshop on Distributed Algorithms, Springer-Verlag LNCS #725 , pp. 26-38
- Israeli, A.¹ Shaham, A.² Shirazi, A.³

21
- 0004215089
- Distributed algorithms
- Morgan Kaufmann Pub., San Francisco (CA)
- (1996) , vol.872
- Lynch, N.A.¹

22
- 0034833012
- Conditions on input vectors for consensus solvability in asynchronous distributed systems
- ACM Press, Crete (Greece), July
- (2001) Proc. 33rd ACM Symposium on Theory of Computing (STOC'01)
- Mostefaoui, A.¹ Rajsbaum, S.² Raynal, M.³

23
- 0003043356
- A hierarchy of conditions for consensus solvability
- Research Report #1381, IRISA, University of Rennes, France, January
- (2001)
- Mostefaoui, A.¹ Rajsbaum, S.² Raynal, M.³ Roy, M.⁴

24
- 0004034288
- Condition-based protocols for set agreement problems
- Research Report #1393, IRISA, University of Rennes, France, April
- (2001) , pp. 21
- Mostefaoui, A.¹ Rajsbaum, S.² Raynal, M.³ Roy, M.⁴

25
- 0034590442
- The best of both worlds: A hybrid approach to solve consensus
- June
- (2000) Proc. IEEE Int. Conf. on Dependable Systems and Networks (DSN'00, Previously FTCS) , pp. 513-522
- Mostefaoui, A.¹ Raynal, M.² Tronel, F.³

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.