Quote: if assume upper bound for shared memory access can transform a sequential implementation of data structure primitives into a fast, wait-free concurrent implementation

Quotation Skeleton

We consider the problem of transforming a given … We assume that there is a known upper … to the shared memory. This timing assumption is … stacks and synchronization primitives such as test- and-set … In the absence of contention, it guarantees that … a constant number of accesses to the shared …   Google-1   Google-2

Copyright clearance needed for quotation.

Related Topics

Topic: hard real time systems (64 items)
Topic: managing shared memory (74 items)