Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
From MaRDI portal
(Redirected from Publication:1268787)
Recommendations
- Performance issues in non-blocking synchronization on shared-memory multiprocessors
- Prevention of deadlocks in parallel programs of multiprocessor machines
- A Deadlock-Free Semantics for Shared Memory Concurrency
- Efficient synchronization of multiprocessors with shared memory
- A non-blocking locking method and performance evaluation on network of workstations
- Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies
Cited in
(16)- A general technique for proving lock-freedom
- Trace-based derivation of a scalable lock-free stack algorithm
- A temporal programming model with atomic blocks based on projection temporal logic
- Inferential queueing and speculative push
- An optimistic approach to lock-free FIFO queues
- An optimal \(k\)-exclusion real-time locking protocol motivated by multi-GPU systems
- Nonblocking \(k\)-compare-single-swap
- Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies
- Non-blocking timeout in scalable queue-based spin locks
- Proving that non-blocking algorithms don't block
- Performance issues in non-blocking synchronization on shared-memory multiprocessors
- A Wait-free Queue with Polylogarithmic Step Complexity
- Proving a non-blocking algorithm for process renaming with TLA\textsuperscript{+}
- A wait-free queue with polylogarithmic step complexity
- A scalable lock-free stack algorithm
- Real-time multiprocessor locks with nesting: optimizing the common case
This page was built for publication: Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1268787)
