Efficient adaptive collect using randomization

No abstract is available for this paper.

• Publication year

  2004

• Venue

  Distributed computing

• Publication date

  2004-10-04

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1007/s00446-005-0143-6
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• The Probabilistic Method

  2015cited by this paper
• Algorithms adapting to point contention

  2003cited by this paper
• A generic framework for indulgent consensus

  2003cited by this paper
• Long lived adaptive splitter and applications

  2002cited by this paper
• An adaptive collect algorithm with applications

  2002influential reference
• Adaptive and efficient mutual exclusion

  2002cited by this paper
• A Time Complexity Bound for Adaptive Mutual Exclusion

  2001cited by this paper
• Long-lived and adaptive atomic snapshot and immediate snapshot (extended abstract)

  2000cited by this paper
• Indulgent algorithms (preliminary version)

  2000cited by this paper
• Time and Space Lower Bounds for Nonblocking Implementations

  2000cited by this paper
• Fast, wait-free (2k-1)-renaming

  1999cited by this paper
• Long-lived adaptive collect with applications

  1999cited by this paper
• The Probabilistic Method

  1998cited by this paper
• Wait-Free Algorithms for Fast, Long-Lived Renaming

  1995influential reference
• Wait-free synchronization

  1991cited by this paper
• Shared-memory Mutual Exclusion: Major Research Trends Since 1986

  1986cited by this paper

• An Almost-Logarithmic Lower Bound for Leader Election with Bounded Value Contention

  2025cites this paper
• Group Members

  2021cites this paper
• Efficient randomized test-and-set implementations

  2019cites this paper
• Allocate-On-Use Space Complexity of Shared-Memory Algorithms

  2018cites this paper
• Adversarial Input in Games and Markets

  2016cites this paper
• Asynchronous Adaptive Task Allocation

  2015cites this paper
• The Renaming Problem: Recent Developments and Open Questions

  2015cites this paper
• The Distributed Computing Column

  2015cites this paper
• Leader election and renaming with optimal message complexity

  2014cites this paper
• Tight Bounds for Asynchronous Renaming

  2014cites this paper
• Notes on Theory of Distributed Systems

  2014cites this paper
• On the time and space complexity of randomized test-and-set

  2012cites this paper
• Distributed Computing

  2012cites this paper
• Improved Randomized Upper Bounds for Conflict Detectors and Strong Group Renaming Computer Science 490 Project

  2012cites this paper
• Optimal-time adaptive strong renaming, with applications to counting

  2011cites this paper
• Slightly smaller splitter networks

  2010cites this paper
• Fast Randomized Test-and-Set and Renaming

  2010influential citation
• Fault-tolerant distributed algorithms

  2009cites this paper
• Warsaw University Faculty of Mathematics, Informatics and Mechanics

  2008cites this paper
• Asynchronous exclusive selection

  2008cites this paper
• Efficient adaptive collect algorithms

  2007cites this paper
• Adaptive Algorithms Using Bounded Memory Are Inherently Non-uniform

  2006cites this paper
• Reactive Concurrent Data Structures and Algorithms for Synchronization

  2006cites this paper
• On the cost of uniform protocols whose memory consumption is adaptive to interval contention

  2006cites this paper
• Distributed Coordination Collecting, Locking, and Matching

  2006cites this paper
• Efficient multi-word locking using randomization

  2005cites this paper
• Space and Step Complexity Efficient Adaptive Collect

  2005cites this paper
• Can Memory Be Used Adaptively by Uniform Algorithms?

  2005cites this paper
• An efficient long-lived adaptive collect algorithm

  2005influential citation
• Shared Memory 5.1 Model 5.2 Mutual Exclusion

  year unknowncites this paper
• Shared Memory 5.1 Introduction 5.2 Mutual Exclusion

  year unknowncites this paper
• Shared Memory 5.1 Model

  year unknowncites this paper
• Shared Memory 5.1 Model 5.2 Mutual Exclusion

  year unknowncites this paper
• Lecture 10 Mutual Exclusion and Store & Collect

  year unknowncites this paper
• 5.2 Mutual Exclusion

  year unknowncites this paper
• Shared Memory 5.1 Introduction

  year unknowncites this paper
• Shared Memory 4.1 Model

  year unknowncites this paper
• Efficient Randomized Test-And-Set Implementations

  year unknowncites this paper
• Efficient Randomized Test-And-Set Implementations

  year unknowncites this paper
• Shared Memory 5.1 Introduction

  year unknowncites this paper
• Shared Memory 4.1 Model 4.2 Mutual Exclusion

  year unknowncites this paper
• Shared Memory 5.1 Model

  year unknowncites this paper
• Shared Memory 5.1 Introduction

  year unknowncites this paper
• Shared Memory 5.1 Model 5.2 Mutual Exclusion

  year unknowncites this paper
• Shared Memory 5.1 Model

  year unknowncites this paper