Wayne Eberly, Lisa Higham, Jolanta Warpechowska-Gruca  Home/Search
Context
Related
| cpsc.ucalgary.ca/~hi...renaming_DISC.ps helios.cti.gr/disc/postsc...14990151.ps 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: cpsc.ucalgary.ca/~higham...papers (more) From: helios.cti.gr/disc/program (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The (n; k; l)-renaming problem requires that names from the set f1; : : : ; lg are assigned to processes from a set of size n, provided that no more than k l processes are simultaneously either holding or trying to acquire a name. A solution to this problem supplies a renaming object supporting both acquire and release operations so that no two processes ever simultaneously hold the same name. The protocol is waitfree if each participant successfully completes either operation in a bounded... (Update)
Active bibliography (related documents): More All
0.8: Long-Lived Renaming Made Fast - Buhrman, Garay, Hoepman (1997) (Correct)
0.5: A Decision-Theoretic Approach to Reliable Message Delivery - Chu, Halpern (Correct)
0.3: Long Lived and Adaptive Shared Memory Implementations - Stupp (2001) (Correct)
Similar documents based on text: More All
0.5: Wait-Free Consensus - Aspnes (1992) (Correct)
0.4: Wait-Free Data Structures in the Asynchronous PRAM Model - Aspnes, Herlihy (2000) (Correct)
0.4: Meeting Times of Random Walks on Graphs - Bshouty, Higham.. (1999) (Correct)
BibTeX entry: (Update)
@misc{ eberly-longlived,
author = "Wayne Eberly and Lisa Higham and Jolanta Warpechowska-Gruca",
title = "Long-lived, Fast, Waitfree Renaming with Optimal Name Space and High Throughput",
url = "citeseer.ist.psu.edu/65518.html" }
Citations (may not include all citations):181 ACM Transactions on Programming Languages and Systems (context) - Herlihy - 1991
95 The asynchronous computability theorem for t-resilient tasks - Herlihy, Shavit - 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
28 Adaptive wait-free algorithms for lattice agreement and rena.. - Attiya, Fouren - 1998
23 The ambiguity of choosing (context) - Burns, Peterson - 1989
16 long-lived renaming improved and simplified (context) - Moir, Garay - 1996
8 Wait-free test-and-set (context) - Afek, Gafni et al. - 1992
8 long-lived renaming (context) - Anderson, Moir - 1994
8 exclusion to implement resilient (context) - Anderson, Moir et al. - 1994
2 waitfree renaming with optimal name space and high throughpu.. (context) - Eberly, Higham et al. - 1998
2 Randomized waitfree naming - Panconesi, Papatriantafilou et al. - 1994
1 Long-lived remaning made fast (context) - Buhrman, Garay et al. - 1995
1 Linerizability: A correctness condition for concurrent objec.. (context) - Herlihy, Wing - 1990
Documents on the same site (http://www.cpsc.ucalgary.ca/~higham/papers.html): More
Optimal Algorithms for Probabilistic Solitude.. - Higham.. (Correct)
Optimal Cost-Sensitive Distributed Minimum Spanning Tree Algorithm - Przytycka (Correct)
Self-Stabilizing Token Circulation on Anonymous Message.. - Higham, Myers (1999) (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