SCOPUS 정보 검색 플랫폼

Volumn 15, Issue 2, 2002, Pages 87-96

An adaptive collect algorithm with applications

(3) Attiya, Hagit a Fouren, Arie a Gafni, Eli b

a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY (Israel)

b University of California (United States)

Author keywords

Asynchronous shared memory systems; Atomic snapshots; Contention sensitive complexity; Immediate snapshots; Read write registers; Renaming; Wait free algorithms

Indexed keywords

BINARY CODES; DISTRIBUTED COMPUTER SYSTEMS; FAULT TOLERANT COMPUTER SYSTEMS; STORAGE ALLOCATION (COMPUTER);

ASYNCHRONOUS SHARED-MEMORY SYSTEMS; ATOMIC SNAPSHOTS; WAIT-FREE ALGORITHMS;

ADAPTIVE ALGORITHMS;

EID: 0036542278 PISSN: 01782770 EISSN: None Source Type: Journal
DOI: 10.1007/s004460100067 Document Type: Article

Times cited : (41)

References (29)

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

2
- 0032642246
- Long-lived renaming made adaptive
- (1999) Proc. 18th ACM Symp. Principles of Dist. Comp. , pp. 91-103
- Afek, Y.¹ Attiya, H.² Fouren, A.³ Stupp, G.⁴ Touitou, D.⁵

3
- 0002489559
- Wait-free made fast
- (1995) Proc. 27th ACM Symp. Theory of Comp. , pp. 538-547
- Afek, Y.¹ Dauber, D.² Touitou, D.³

4
- 0032673212
- Fast, wait-free (2k - 1)-renaming
- (1999) Proc. 18th ACM Symp. Principles of Dist. Comp. , pp. 105-112
- Afek, Y.¹ Merritt, M.²

5
- 0033332891
- Long-lived and adaptive collect with applications
- (1999) Proc. 40th IEEE Symp. Foundations of Comp. Sci. , pp. 262-272
- Afek, Y.¹ Stupp, G.² Touitou, D.³

6
- 0034514305
- Long-lived and adaptive atomic snapshot and immediate snapshot
- (2000) Proc. 19th ACM Symp. Principles of Dist. Comp. , pp. 71-80
- Afek, Y.¹ Stupp, G.² Touitou, D.³

7
- 0009437922
- The instancy of snapshots and commuting objects
- Jan.
- (1999) J. Alg. , vol.30 , Issue.1 , pp. 68-105
- Afek, Y.¹ Weisberger, E.²

8
- 84880879693
- Results about fast mutual exclusion
- Dec.
- (1992) Proceedings of the Real-Time Systems Symposium , pp. 12-22
- Alur, R.¹ Taubenfeld, G.²

9
- 0031381452
- Using local-spin k-exclusion algorithms to improve wait-free object implementation
- (1997) Dist. Comp. , vol.11 , Issue.1 , pp. 1-20
- Anderson, J.H.¹ Moir, M.²

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

11
- 0031630329
- Adaptive wait-free algorithms for lattice agreement and renaming
- (1998) Proc. 17th ACM Symp. Principles of Dist. Comp. , pp. 277-286
- Attiya, H.¹ Fouren, A.²

12
- 84958749823
- Polynomial and adaptive long-lived (2k-1)-renaming
- (2000) Proc. 14th Int. Symp. on Dist. Computing , pp. 149-163
- Attiya, H.¹ Fouren, A.²

13
- 0036248044
- Adaptive and efficient algorithms for lattice agreement and renaming
- to appear. An extended abstract appeared in [11]
- SIAM J. Comput.
- Attiya, H.¹ Fouren, A.²

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

15
- 0000438061
- Atomic snapshots in O(n log n) operations
- Mar.
- (1998) SIAM J. Comput. , vol.27 , Issue.2 , pp. 319-340
- Attiya, H.¹ Rachman, O.²

16
- 84955609444
- The combinatorial structure of wait-free solvable tasks
- Proc. 10th Int. Workshop on Dist. Algorithms, inger-Verlag, 1996. Also Technical Report #CS0924, Department of Computer Science, Technion, December
- (1997) Lecture Notes in Computer Science , vol.1151 , pp. 321-343
- Attiya, H.¹ Rajsbaum, S.²

17
- 0003765415
- PhD thesis, Department of Computer Science, UCLA
- (1995) Capturing the Power of Resiliency and Set-Consensus in Distributed Systems
- Borowsky, E.¹

18
- 0027225071
- Generalized FLP impossibility result for t-resilient asynchronous computations
- (1993) Proc. 25th ACM Symp. Theory of Comp. , pp. 91-100
- Borowsky, E.¹ Gafni, E.²

19
- 0027803339
- Immediate atomic snapshots and fast renaming
- (1993) Proc. 12th ACM Symp. Principles of Dist. Comp. , pp. 41-52
- Borowsky, E.¹ Gafni, E.²

20
- 0024913711
- The ambiguity of choosing
- (1989) Proc. 8th ACM Symp. Principles of Dist. Comp. , pp. 145-158
- Burns, J.E.¹ Peterson, G.L.²

21
- 0002264487
- Adaptive solutions to the mutual exclusion problem
- (1994) Dist. Comp. , vol.8 , Issue.1 , pp. 1-17
- Choy, M.¹ Singh, A.K.²

22
- 0027870155
- Bounded round numbers
- (1993) Proc. 12th ACM Symp. Principles of Dist. Comp. , pp. 53-64
- Dwork, C.¹ Herlihy, M.² Waarts, O.³

23
- 0003556280
- Aug.
- (1999) Exponential examples for two renaming algorithms
- Fouren, A.¹

24
- 0003959930
- PhD thesis, Department of Computer Science, The Technion, June
- (2001) Adaptive Wait-Free Algorithms for Asynchronous Shared-Memory Systems
- Fouren, A.¹

25
- 0025917643
- Wait-free synchronization
- Jan.
- (1991) ACM Trans. Prog. Lang. Syst. , vol.13 , Issue.1 , pp. 124-149
- Herlihy, M.¹

26
- 0023288130
- A fast mutual exclusion algorithm
- Feb.
- (1987) ACM Trans. Comput. Syst. , vol.5 , Issue.1 , pp. 1-11
- Lamport, L.¹

27
- 0032017594
- Fast, long-lived renaming improved and simplified
- May
- (1998) Sci. Comput. Programming , vol.30 , Issue.3 , pp. 287-308
- Moir, M.¹

28
- 0029389344
- Wait-free algorithms for fast, long-lived renaming
- Oct.
- (1995) Sci. Comput. Programming , vol.25 , Issue.1 , pp. 1-39
- Moir, M.¹ Anderson, J.H.²

29
- 0034541366
- Wait-free k-set agreement is impossible: The topology of public knowledge
- (2000) SIAM J. Comput. , vol.29 , Issue.5 , pp. 1449-1483
- Saks, M.¹ Zaharoglou, F.²

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