TechQA.

Question

Why is the standard C# event invocation pattern thread-safe without a memory barrier or cache invalidation? What about similar code?

score 880 · Answer 1 · 2015-06-10 14:48:37

5

Answer

880

Views

Why is the standard C# event invocation pattern thread-safe without a memory barrier or cache invalidation? What about similar code?

880 views Asked by Andrew Russell At 10 June 2015 at 14:48

score 699 · Answer 2 · 2015-06-20 07:57:23

Does C++11 guarantee memory ordering between a release fence and a consume operation?

699 views Asked by Edmund At 20 June 2015 at 07:57

score 964 · Answer 3 · 2024-11-24 00:25:58

Manual synchronization in OpenMP while loop

964 views Asked by topper91 At 24 November 2024 at 00:25

score 1429 · Answer 4 · 2024-11-24 00:33:55

Release-Consume ordering for reference counting

1.4k views Asked by Zizheng Tai At 24 November 2024 at 00:33

score 418 · Answer 5 · 2024-11-24 00:16:30

relaxed ordering of c++11 memory model

418 views Asked by kmalloc At 24 November 2024 at 00:16

score 146 · Answer 6 · 2014-11-27 21:23:39

Can a store-release be reordered with a subsequent sequential-consistent load in C++11?

146 views Asked by levzettelin At 27 November 2014 at 21:23

score 755 · Answer 7 · 2024-11-24 00:25:57

atomic<T>.load() with std::memory_order_release

755 views Asked by levzettelin At 24 November 2024 at 00:25

score 1292 · Answer 8 · 2024-11-24 00:37:51

Memory barriers and Linux kernel spinlock on TILE-Gx

1.2k views Asked by hakos At 24 November 2024 at 00:37

score 491 · Answer 9 · 2024-11-24 00:46:14

Is the example in the membarrier man page pointless in x86?

491 views Asked by BeeOnRope At 24 November 2024 at 00:46

score 413 · Answer 10 · 2024-11-24 00:55:44

Does std::atomic provide atomic behavior, regardless of ordering?

413 views Asked by BeeOnRope At 24 November 2024 at 00:55

TechQA.

List Question

Why is the standard C# event invocation pattern thread-safe without a memory barrier or cache invalidation? What about similar code?

Does C++11 guarantee memory ordering between a release fence and a consume operation?

Manual synchronization in OpenMP while loop

Release-Consume ordering for reference counting

relaxed ordering of c++11 memory model

Can a store-release be reordered with a subsequent sequential-consistent load in C++11?

atomic<T>.load() with std::memory_order_release

Memory barriers and Linux kernel spinlock on TILE-Gx

Is the example in the membarrier man page pointless in x86?

Does std::atomic provide atomic behavior, regardless of ordering?

Popular Questions

Popular Tags

Trending Questions