TechQA.

Question

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

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

5

Answer

883

Views

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

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

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

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

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

score 968 · Answer 3 · 2016-12-29 10:09:58

Manual synchronization in OpenMP while loop

968 views Asked by topper91 At 29 December 2016 at 10:09

score 1433 · Answer 4 · 2017-01-02 09:54:26

Release-Consume ordering for reference counting

1.4k views Asked by Zizheng Tai At 02 January 2017 at 09:54

score 421 · Answer 5 · 2014-11-23 08:03:16

relaxed ordering of c++11 memory model

421 views Asked by kmalloc At 23 November 2014 at 08:03

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

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

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

score 760 · Answer 7 · 2013-12-05 10:55:22

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

760 views Asked by levzettelin At 05 December 2013 at 10:55

score 1297 · Answer 8 · 2013-12-12 17:14:44

Memory barriers and Linux kernel spinlock on TILE-Gx

1.2k views Asked by hakos At 12 December 2013 at 17:14

score 494 · Answer 9 · 2017-08-30 22:19:14

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

494 views Asked by BeeOnRope At 30 August 2017 at 22:19

score 415 · Answer 10 · 2017-08-31 02:39:58

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

415 views Asked by BeeOnRope At 31 August 2017 at 02:39

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