• Article  

      The cost of concurrent, low-contention Read&Modify&Write 

      Busch, Costas; Mavronicolas, Marios; Spirakis, Paul G. (2005)
      The possibility or impossibility and the corresponding costs of devising concurrent, low-contention implementations of atomic Read&Modify&Write (or RMW) operations in a distributed system were addressed. A natural class ...
    • Article  

      Sequentially consistent versus linearizable counting networks 

      Mavronicolas, Marios; Merritt, M.; Taubenfeld, G. (2008)
      We compare the impact of timing conditions on implementing sequentially consistent and linearizable counters using (uniform) counting networks in distributed systems. For counting problems in application domains which do ...