Hagit Attiya, Arie Fouren  Home/Search
Context Related
| cs.technion.ac.il/~hagit/...AF98f.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: cs.technion.ac.il/~hagit/pubs/ (more) Homepages: H.Attiya |
Rate this article:      (best)Comment on this article |
Abstract: In a shared-memory system, n independent asynchronous processes, with distinct names in the range {0, ..., N - 1}, communicate by reading and writing to shared registers. An algorithm is wait-free if a process completes its execution regardless of the behavior of other processes. This paper considers wait-free algorithms whose complexity adjusts to the level of contention in the system: An algorithm is adaptive (to total contention) if its step complexity depends only on the actual number of... (Update)
Cited by: More
A Simple Algorithmic Characterization of Uniform Solvability.. - Gafni (2002) (Correct)
Similar documents (at the sentence level):
47.6%: Adaptive and Efficient Algorithms for Lattice Agreement and.. - Attiya, Fouren (1999) (Correct)
16.6%: Fast Wait-free Algorithms for Lattice Agreement and Renaming - Attiya, Fouren (1999) (Correct)
Active bibliography (related documents): More All
0.9: An Adaptive Collect Algorithm with Applications - Attiya, Fouren (1999) (Correct)
0.6: Polynomial and Adaptive Long-lived (2k-1)-Renaming (Extended.. - Attiya, Fouren (2000) (Correct)
0.6: Adaptive Algorithms for Mutual Exclusion - Bortnikov (Correct)
Similar documents based on text: More All
0.2: Adaptive Long-Lived Renaming with Read and Write Operations - Attiya, Fouren (1999) (Correct)
0.2: Long-lived, Fast, Waitfree Renaming with Optimal.. - Eberly, Higham.. (Correct)
0.1: Real Time Pattern Matching Using Projection Kernels - Hel-Or, Hel-Or (Correct)
BibTeX entry: (Update)
H. Attiya and A. Fouren, "Adaptive and efficient algorithms for lattice agreement and renaming," SICOMP, to appear. An extended abstract appeared in [11]. http://citeseer.ist.psu.edu/article/attiya98adaptive.html More
@article{ attiya02adaptive,
author = "Hagit Attiya and Arie Fouren",
title = "Adaptive and Efficient Algorithms for Lattice Agreement and Renaming",
journal = "{SIAM} Journal on Computing",
volume = "31",
number = "2",
pages = "642--664",
year = "2002",
url = "citeseer.ist.psu.edu/article/attiya98adaptive.html" }
Citations (may not include all citations):107 A new solution of Dijkstra's concurrent programming problem (context) - Lamport - 1974
99 Atomic snapshots of shared memory - Afek, Attiya et al. - 1993
75 Renaming in an asynchronous environment (context) - Attiya, Bar-Noy et al. - 1990
61 Immediate atomic snapshots and fast renaming (context) - Borowsky, Gafni - 1993
40 Adaptive solutions to the mutual exclusion problem (context) - Choy, Singh - 1994
36 Wait-free made fast (context) - Afek, Dauber et al. - 1995
31 The topological structure of asynchronous computability - Herlihy, Shavit - 1999
28 Adaptive wait-free algorithms for lattice agreement and rena.. - Attiya, Fouren - 1998
24 Results about fast mutual exclusion (context) - Alur, Taubenfeld - 1992
23 The ambiguity of choosing (context) - Burns, Peterson - 1989
22 Long-lived renaming made adaptive - Afek, Attiya et al. - 1999
22 Atomic snapshots in O (context) - Attiya, Rachman - 1998
17 wait-free (context) - Afek, Merritt - 1999
16 long-lived renaming improved and simplified (context) - Moir - 1998
16 Atomic snapshots using lattice agreement (context) - Attiya, Herlihy et al. - 1995
15 Linear-time snapshot using multi-writer multi-reader registe.. (context) - Inoue, Chen et al. - 1994
11 A partial equivalence between shared-memory and messagepassi.. (context) - Bar-Noy, Dolev - 1993
9 Using local-spin k-exclusion algorithms to improve wait-free.. - Anderson, Moir - 1997
8 Wait-free algorithms for fast (context) - Moir, Anderson - 1995
6 Exponential examples for two renaming algorithms (context) - Fouren - 1999
5 Long-lived adaptive splitter and applications - Afek, Stupp et al. - 1999
4 Submitted for publication (context) - collect, applications - 1999
3 Adaptive and efficient mutual exclusion (context) - Attiya, Bortnikov - 2000
2 ACM Trans (context) - mutual, algorithm - 1987
1 Polynomial and adaptive long-lived (context) - adaptive, renaming et al. - 2000
Documents on the same site (http://www.cs.technion.ac.il/~hagit/pubs/): More
Local Labeling And Resource Allocation Using Preprocessing - Attiya, Shachnai, Tamir (1994) (Correct)
Long-Lived Renaming Made Adaptive (Extended Abstract) - Afek, al. (1999) (Correct)
The Combinatorial Structure of Wait-free Solvable Tasks - Attiya, Rajsbaum (1996) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC