Browsing by Author "Herlihy, M."

Now showing items 1-3 of 3

    • Article  

      A combinatorial characterization of properties preserved by antitokens 

      Busch, Costas; Demetriou, Neophytos; Herlihy, M.; Mavronicolas, Marios (2000)
      Balancing networks are highly distributed data structures used to solve multiprocessor synchronization problems. Typically, balancing networks are accessed by tokens, and the distribution of the tokens on the network’s ...
    • Article  

      Supporting increment and decrement operations in balancing networks 

      Aiello, W.; Busch, Costas; Herlihy, M.; Mavronicolas, Marios; Shavit, N.; Touitou, D. (1999)
      Counting networks are a class of distributed data structures that support highly concurrent implementations of shared Fetch&Increment counters. Applications of these counters include shared pools and stacks, load balancing, ...
    • Article  

      Threshold counters with increments and decrements 

      Busch, Costas; Demetriou, Neophytos; Herlihy, M.; Mavronicolas, Marios (2002)
      A threshold counter is a shared data structure that assumes integer values. It provides two operations: Increment changes the current counter value from v to v+1, while Read returns the value [v/w], where v is the current ...