The following pages link to Mark Moir (Q470039):
Displaying 26 items.
- Towards formally specifying and verifying transactional memory (Q470040) (← links)
- A simple proof technique for priority-scheduled systems (Q1607082) (← links)
- Wait-free algorithms for fast, long-lived renaming (Q1904367) (← links)
- A dynamic-sized nonblocking work stealing deque (Q1953649) (← links)
- Nonblocking \(k\)-compare-single-swap (Q2272205) (← links)
- (Q2843926) (← links)
- A Framework for Formally Verifying Software Transactional Memory Algorithms (Q2912700) (← links)
- Real-time object sharing with minimal system support (Q2942737) (← links)
- A simple local-spin group mutual exclusion algorithm (Q2942749) (← links)
- Wait-free synchronization in multiprogrammed systems (Q2942756) (← links)
- Nonblocking Algorithms and Backward Simulation (Q3646231) (← links)
- (Q4437136) (← links)
- (Q4643874) (← links)
- Using local-spin k -exclusion algorithms to improve wait-free object implementations (Q5137344) (← links)
- Laziness pays! Using lazy synchronization mechanisms to improve non-blocking constructions (Q5138361) (← links)
- Lock-free reference counting (Q5138383) (← links)
- Using <i>k</i>-exclusion to implement resilient, scalable shared objects (extended abstract) (Q5361404) (← links)
- Universal constructions for multi-object operations (Q5361453) (← links)
- Long-lived renaming made fast (Q5361455) (← links)
- Practical implementations of non-blocking synchronization primitives (Q5361485) (← links)
- Distributed Computing (Q5395138) (← links)
- SNZI (Q5401388) (← links)
- Formal Techniques for Networked and Distributed Systems – FORTE 2004 (Q5464482) (← links)
- Distributed Computing (Q5897399) (← links)
- Universal constructions for large objects (Q6084555) (← links)
- Fast, long-lived renaming improved and simplified (Q6570924) (← links)
