Now showing items 1-1 of 1

    • Linearizable Counting Networks 

      Merlihy, Maurice; Shavit, Nir; Waarts, Orli (1991-11)
      The counting problem requires n asynchronous processors to assign themselves successive values. A solution is linearizable if the order of the values assigned reflects the real-time order in which they were requested. ...