Now showing items 1-2 of 2

    • Extremely fast (a,b)-trees at all contention levels 

      Srivastava, Anubhav (University of Waterloo, 2021-08-26)
      Many concurrent dictionary implementations are designed and evaluated with only low-contention workloads in mind. This thesis presents several concurrent linearizable (a,b)-tree implementations with the overarching goal ...
    • The Fence Complexity of Persistent Sets 

      Coccimiglio, Gaetano (University of Waterloo, 2021-09-21)
      This thesis studies fence complexity of concurrent sets in a non-volatile shared memory model. I consider the case where CPU registers and cache memory remain volatile while main memory is non-volatile. Flush instructions ...

      UWSpace

      University of Waterloo Library
      200 University Avenue West
      Waterloo, Ontario, Canada N2L 3G1
      519 888 4883

      All items in UWSpace are protected by copyright, with all rights reserved.

      DSpace software

      Service outages