• Conference Object  

      Efficient counting network 

      Busch, Costas; Mavronicolas, Marios (1998)
      Counting networks were introduced as a new class of concurrent, distributed, low contention data structures suitable for implementing shared counters. Their structure is similar to that of sorting networks. High-performance ...
    • Conference Object  

      Impact of timing on linearizability in counting networks 

      Mavronicolas, Marios; Papatriantafilou, Marina; Tsigas, Philippas (IEEE, 1997)
      Counting networks form a new class of distributed, low-contention data structures, made up of interconnected balancers and are suitable for solving a variety of multiprocessor synchronization problems that can be expressed ...
    • Conference Object  

      Modeling value speculation 

      Sazeides, Yiannakis (IEEE Computer Society, 2002)
      Several studies of speculative execution based on values have reported promising performance potential. However, virtually all microarchitectures in these studies were described in an ambiguous manner, mainly due to the ...
    • Conference Object  

      Strength of counting networks 

      Busch, Costas; Mavronicolas, Marios (1996)
      This paper shows that any counting network, made up of balancers whose fan-in and fan-out vary arbitrarily, is, indeed, strong enough to simultaneously support both Fetch&Increment and Fetch&Decrement operations, once each ...