Abortable and Query-abortable Types and Their Efficient Implementation

Abortable and Query-abortable Types and Their Efficient Implementation

Show other versions (1)

We introduce abortable and query-abortable object types intended for implementation in asynchronous shared-memory systems with low contention. Implementations of such types behave like ordinary objects when accessed sequentially, but may abort operations when accessed concurrently. An aborted operat...

Full description

Bibliographic Details
Main Author: Horn, Stephanie Lorraine
Other Authors: Toueg, Sam
Language:en_ca
Published: 2009
Subjects:
shared memory
memory contention
universal constructions
abortable types
query-abortable types
obstruction-freedom
inc&read counter
non-triviality
composability
0984
Online Access:http://hdl.handle.net/1807/17775

Internet

http://hdl.handle.net/1807/17775

Similar Items