Is Speed-Independent Mutual Exclusion Implementable? (Invited Talk)

A mutual exclusion algorithm is called speed independent if its correctness does not depend on the relative speed of the components. Famous mutual exclusion protocols such as Dekker\u27s, Peterson\u27s and Lamport\u27s bakery are meant to be speed independent. In this talk I argue that speed-independent mutual exclusion may not be implementable on standard hardware, depending on how we believe reading and writing to a memory location is really carried out. It can be implemented on electrical circuits, however. This builds on previous work showing that mutual exclusion cannot be accurately modelled in standard process algebras