Laws of Order: Expensive Synchronization in Concurrent Algorithms Cannot Be Eliminated

Download Now
Provided by: Association for Computing Machinery
Topic: Big Data
Format: PDF
In this paper, the authors respond to this question. They prove that it is impossible to build concurrent implementations of classic and ubiquitous specifications such as sets, queues, stacks, mutual exclusion and read-modify-write operations that completely eliminate the use of expensive synchronization. They prove that one cannot avoid the use of either: Read-After-Write (RAW), where a write to shared variable A is followed by a read to a different shared variable B without a write to B in between or Atomic Write-After-Read (AWAR), where an atomic operation reads and then writes to shared locations.
Download Now

Find By Topic