Pages that link to "Item:Q1268787"
From MaRDI portal
The following pages link to Nonblocking algorithms and preemption-safe locking on multiprogrammed shared memory multiprocessors (Q1268787):
Displaying 13 items.
- A scalable lock-free stack algorithm (Q666004) (← links)
- Real-time multiprocessor locks with nesting: optimizing the common case (Q779438) (← links)
- A general technique for proving lock-freedom (Q1001810) (← links)
- Trace-based derivation of a scalable lock-free stack algorithm (Q1019022) (← links)
- A temporal programming model with atomic blocks based on projection temporal logic (Q1633057) (← links)
- Inferential queueing and speculative push (Q1771148) (← links)
- An optimistic approach to lock-free FIFO queues (Q1954254) (← links)
- An optimal \(k\)-exclusion real-time locking protocol motivated by multi-GPU systems (Q2251367) (← links)
- Nonblocking \(k\)-compare-single-swap (Q2272205) (← links)
- Shared Memory Consistency Conditions for Nonsequential Execution: Definitions and Programming Strategies (Q4388863) (← links)
- Proving that non-blocking algorithms don't block (Q5261502) (← links)
- Proving a non-blocking algorithm for process renaming with TLA\textsuperscript{+} (Q6536175) (← links)
- A wait-free queue with polylogarithmic step complexity (Q6658818) (← links)
