Summary: DISC, September 2005 1
Time and Space Lower Bounds
for Implementations Using kCAS
Hagit Attiya, Technion
Danny Hendler, University of Toronto
DISC, September 2005 Lower Bounds w/ kCAS 2
Shared-Memory Multi-processors
Asynchronous processes communicate through
shared base objects, using:
Read, write
Compare&swap P0 P1 P2
base
base
base
base base
base base
DISC, September 2005 Lower Bounds w/ kCAS 3
Implementing High-Level Objects
Base objects are encapsulated within other objects
Stacks, queues

Source: Attiya, Hagit - Department of Computer Science, Technion, Israel Institute of Technology

Collections: Computer Technologies and Information Sciences