Coins, weights and contention in balancing networks

No abstract is available for this paper.

• Publication year

  1994

• Venue

  ACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing

• Publication date

  1994-08-14

• Fields of study

  Computer Science

• Identifiers
  DOI 10.1145/197917.198090
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Diffracting trees

  1996cited by this paper
• A lower bound on wait-free counting

  1993cited by this paper
• Low contention load balancing on large-scale multiprocessors

  1992cited by this paper
• Counting networks with arbitrary fan-out

  1992cited by this paper
• Small-depth counting networks

  1992cited by this paper
• Counting networks and multi-processor coordination

  1991influential reference
• Low contention linearizable counting

  1991cited by this paper
• Wait-free synchronization

  1991cited by this paper
• Sorting inc logn parallel steps

  1983cited by this paper
• Sorting networks and their applications

  1968cited by this paper

• Parallel rotor walks on finite graphs and applications in discrete load balancing

  2013cites this paper
• Di racting Trees

  2011cites this paper
• A randomized, o(log w)-depth 2 smoothing network

  2009cites this paper
• The impact of randomization in smoothing networks

  2008cites this paper
• 1 Introduction 1 . 1 Motivation and Overview

  2008cites this paper
• 8 concluding remarks.

  2007cites this paper
• Self-stabilizing smoothing and balancing networks

  2006cites this paper
• 1 Concurrent Data Structures

  2005cites this paper
• Adaptive Counting Networks

  2005cites this paper
• Concurrent Data Structures

  2004cites this paper
• Randomized smoothing networks

  2004cites this paper
• Self-stabilizing smoothing and counting

  2003cites this paper
• A Combinatorial Characterization of Properties Preserved by Antitokens

  2000cites this paper
• A Combinatorial Characterization of Properties Preserved by Antitokens

  2000cites this paper
• A Study on Distributed Structures

  2000cites this paper
• Sequentially consistent versus linearizable counting networks

  1999cites this paper
• Supporting Increment and Decrement Operations in Balancing Networks

  1999cites this paper
• Timing Conditions for Linearizability in Uniform Counting Networks

  1999cites this paper
• Contention in balancing networks resolved (extended abstract)

  1998cites this paper
• An efficient counting network

  1998cites this paper
• A Survey on Counting Networks

  1998cites this paper
• Balancing Networks: State of the Art

  1997influential citation
• The impact of timing on linearizability in counting networks

  1997cites this paper
• A Wait-Free Sorting Algorithm

  1997cites this paper
• Linearizable counting networks

  1996cites this paper
• Counting networks are practically linearizable

  1996cites this paper
• Di racting Trees

  1996cites this paper
• A combinatorial treatment of balancing networks

  1996cites this paper
• Distributed, low contention task allocation

  1996cites this paper
• Diffracting trees

  1996cites this paper
• Public data structures: counters as a special case

  1995cites this paper
• 8. Concluding Remarks by Deenition of the Vectors E

  1995cites this paper
• Diiracting Trees

  1995influential citation
• Diiracting Trees

  1994cites this paper
• Contention in shared memory algorithms

  1993influential citation
• Contention in shared memory algorithms

  1993cites this paper
• Concurrent counting

  1992cites this paper
• Supporting Increment and Decrement Operations in Balancing Networks ?

  year unknowncites this paper
• BALANCING NETWORKS : STATE OF THE ART

  year unknowncites this paper