Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of Graph Search.
This lecture discusses the impossibility of implementing an atomic SRSW register using a finite number of bounded regular registers without readers writing to the base registers. The slides cover concepts such as SRSW regular registers, atomic operations, and the limitations of constructing such a register. The lecture also explores the properties of digests for finite sequences of values and the challenges in achieving an atomic SRSW register. Various transformations and operations on registers are presented, highlighting the complexities involved in this implementation.