1 citations · 2 across the 5 of their papers we have counts for
5 papers
Deterministic and Fast Randomized Test-and-Set in Optimal Space
George Giakkoupis, Maryam Helmi, Lisa Higham +1
The test-and-set object is a fundamental synchronization primitive for shared memory systems. A test-and-set object stores a bit, initialized to 0, and supports one operation, test…
Space Bounds for Adaptive Renaming
Maryam Helmi, Lisa Higham, Philipp Woelfel
We study the space complexity of implementing long-lived and one-shot adaptive renaming from multi-reader multi-writer registers, in an asynchronous distributed system with pro…
Partition Consistency: A Case Study in Modeling Systems with Weak Memory Consistency and Proving Correctness of their Implementations
Steven Cheng, Lisa Higham, Jalal Kawash
Multiprocess systems, including grid systems, multiprocessors and multicore computers, incorporate a variety of specialized hardware and software mechanisms, which speed computatio…
The Space Complexity of Long-lived and One-Shot Timestamp Implementations
Maryam Helmi, Lisa Higham, Eduardo Pacheco +1
This paper is concerned with the problem of implementing an unbounded timestamp object from multi-writer atomic registers, in an asynchronous distributed system of n processors wit…
Linearizable Implementations Do Not Suffice for Randomized Distributed Computation
Wojciech Golab, Lisa Higham, Philipp Woelfel
Linearizability is the gold standard among algorithm designers for deducing the correctness of a distributed algorithm using implemented shared objects from the correctness of the…