1.本周工作.PDF

1. 1. C++ concurrency in actionChpater 7. Designing lock-free concurrent data structures 2. 1. SDK 2. Chpater 7. Designing lock-free concurrent data structures Chapter 7. Designing lock-free concurrent data structures 7.1 Definitions and consequences mutex, condition variablefuture blocking unblocking lock-free 7.1.1 Types of nonblocking data structures acquire-releaseatomic_flag 7.1.2 Lock-free data structures compare/exchange loop —— 7.1.3 Wait-free data strucutres wait- free. lock-freewait-free 7.1.4 The pros and cons of lock-free data structures lock_guard, live lock restart wait-free: By definition, wait-free code cant suffer from live lock wait-free non-wait-free 7.2 Examples of lock-free data structures atomic_flag “ Only std::atmoic_flag is guaranteed not to use locks. 7.2.1 Writing a thread-safe stack without locks 1. 2. nextstackhead 3. stackhead 2, 3 1. head 2. head-next 3. head-nexthead 4. data 5. templatetypename class thread_safe_stack { public: struct node; void push(const T data) { auto new_head = new node(data); new_head-_next = head.load(); while (pare_exchange_weak(new_head-_next, new_head)) {} } shared_ptrT pop() { auto old_head = head.load(); while (old_head pare_exchange_weak(old_head, old_head- _next)) {} // old_head-_next might result in undefined behavior if its deleted by other threads return old_head? old_head-_data: shar