SCOPUS 정보 검색 플랫폼

Volumn 31, Issue 4, 2002, Pages 1286-1313

The combinatorial structure of wait-free solvable tasks

a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY (Israel)

Author keywords

Atomic read write registers; Combinatorial topology; Consensus; Distributed systems; Renaming; Set consensus; Shared memory systems; Wait free solvable tasks

Indexed keywords

BOUNDARY CONDITIONS; DISTRIBUTED COMPUTER SYSTEMS; FINITE AUTOMATA; MATHEMATICAL MODELS; NETWORK PROTOCOLS; SET THEORY; THEOREM PROVING; VECTORS;

ATOMIC READ WRITE REGISTERS; COMBINATORIAL TOPOLOGY; RENAMING; SHARED MEMORY SYSTEMS; WAIT FREE SOLVABLE TASKS;

COMBINATORIAL MATHEMATICS;

EID: 0036520251 PISSN: 00975397 EISSN: None Source Type: Journal
DOI: 10.1137/S0097539797330689 Document Type: Article

Times cited : (58)

References (26)

1
- 0028462699
- Are wait-free algorithms fast?
- (1994) J. ACM , vol.41 , pp. 725-763
- Attiya, H.¹ Lynch, N.² Shavit, N.³

2
- 0025462628
- Renaming in an asynchronous environments
- (1990) J. ACM , vol.37 , pp. 524-548
- Attiya, H.¹ Bar-Noy, A.² Dolev, D.³ Peleg, D.⁴ Reischuk, R.⁵

3
- 84955609444
- The combinatorial structure of wait-free solvable tasks
- O. Babaoglu and K. Marzullo, eds., Springer-Verlag, Berlin
- (1996) Proceedings of the 10th International Workshop on Distributed Algorithms, Lecture Notes in Comput. Sci. , vol.1151 , pp. 321-343
- Attiya, H.¹ Rajsbaum, S.²

4
- 0003524084
- Elsevier, New York
- (1976) Graph Theory with Applications
- Bondy, J.A.¹ Murty, U.S.R.²

5
- 0010319986
- The combinatorics of colored triangulations of manifolds
- (1987) Geom. Dedicata , vol.22 , pp. 303-328
- Bracho, J.¹ Montejano, L.²

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

7
- 0027225071
- Generalized FLP impossibility result for t-resilient asynchronous computations
- Proceedings of the 25th ACM Symposium on Theory of Computing, San Diego, 1993 , pp. 91-100
- Borowsky, E.¹ Gafni, E.²

8
- 0027803339
- Immediate atomic snapshots and fast renaming
- Proceedings of the 12th Annual ACM Symposium on Principles of Distributed Computing, Ithaca, NY, 1993 , pp. 41-51
- Borowsky, E.¹ Gafni, E.²

9
- 0030692523
- A simple algorithmically reasoned characterization of wait-free computations
- Proceedings of the 16th Annual ACM Symposium on Principles of Distributed Computing, Santa Barbara, CA, 1997 , pp. 189-198
- Borowsky, E.¹ Gafni, E.²

10
- 0003674943
- The implication of the Borowsky-Gafni simulation on the set consensus hierarchy
- Technical report 930021, Computer Science Department, UCLA, Los Angeles, CA
- (1993)
- Borowsky, E.¹ Gafni, E.²

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

12
- 0027831284
- A tight lower bound for k-set agreement
- Proceedings of the 34th IEEE Symposium on Foundations of Computer Science, Palo Alto, CA, 1993 , pp. 206-217
- Chaudhuri, S.¹ Herlihy, M.² Lynch, N.³ Tuttle, M.⁴

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

14
- 0001683636
- Authenticated algorithms for Byzantine agreement
- (1983) SIAM J. Comput. , vol.12 , pp. 656-666
- Dolev, D.¹ Strong, H.R.²

15
- 0022045868
- Impossibility of distributed commit with one faulty process
- (1985) J. ACM , vol.32 , pp. 374-382
- Fischer, M.¹ Lynch, N.² Paterson, M.³

16
- 0032256640
- Three-processor tasks are undecidable
- (1999) SIAM J. Comput. , vol.28 , pp. 970-983
- Gafni, E.¹ Koutsoupias, E.²

17
- 0003780290
- Dover, New York
- (1994) A Combinatorial Introduction to Topology
- Henle, M.¹

18
- 0010319987
- manuscript
- (1994) A Tutorial on Algebraic Topology and Distributed Computation
- Herlihy, M.¹

19
- 85023045726
- Set consensus using arbitrary objects
- Proceedings of the 13th Annual ACM Symposium on Principles of Distributed Computing, Los Angeles, 1994 , pp. 324-333
- Herlihy, M.¹ Rajsbaum, S.²

20
- 85013711610
- Algebraic spans
- (2000) Math. Structures Comput. Sci. , vol.10 , pp. 549-573
- Herlihy, M.¹ Rajsbaum, S.²

21
- 85088330652
- On the decidability of distributed decision tasks
- Proceedings of the 29th ACM Symposium on Theory of Computation, El Paso, TX, 1997 , pp. 111-120
- Herlihy, M.¹ Rajsbaum, S.²

22
- 0027188178
- The asynchronous computability theorem for t-resilient tasks
- Proceedings of the 25th ACM Symposium on Theory of Computing, San Diego, CA, 1993 , pp. 111-120
- Herlihy, M.¹ Shavit, N.²

23
- 0028062298
- A simple constructive computability theorem for wait-free computation
- full version of [22] and [23] appeared in J. ACM, 46 (1999), pp. 858-923
- (1994) Proceedings of the 1994 ACM Symposium on Theory of Computing, Montréal, Québec, Canada , pp. 243-252
- Herlihy, M.¹ Shavit, N.²

24
- 0003734371
- Addison-Wesley, Menlo Park, CA
- (1993) Elements of Algebraic Topology
- Munkres, J.R.¹

25
- 0027188179
- Wait-free k-set agreement is impossible: The topology of public knowledge
- Proceedings of the 25th ACM Symposium on Theory of Computing, San Diego, CA, 1993 , pp. 101-110
- Saks, M.¹ Zaharoglou, F.²

26
- 0003807144
- Springer-Verlag, New York
- (1966) Algebraic Topology
- Spanier, E.H.¹

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