Concurrency of assignment statement in C# Programming - 葵花宝典
s*n
1 楼
请问各位大侠你们都在哪下电影啊？
现在迅雷被封了，给推荐几个网站呗。
好像看电影啊。
现在迅雷被封了，给推荐几个网站呗。
好像看电影啊。
t*z
2 楼
看凤凰卫视还有其他的直播节目的时候，经常自动退出来，不知道是怎么回事。多谢了！
s*y
3 楼
【 以下文字转载自 FleaMarket 讨论区 】
发信人: superpanjy (Roger), 信区: FleaMarket
标 题: 【出售】自用的两条4GB 1066MHz DDR3 SDRAM - 2x4GB 可用于MBP imac
发信站: BBS 未名空间站 (Fri Jun 17 14:00:34 2011, 美东)
Kingston Apple 8GB Kit (2 X 4GB Modules) DDR3 1066MHz SODimm C7 iMac and
Macbook Pro Memory
因为apple 给我调换了机器 这两条内存用不上了
kingston
用在我2009年的MBP上没有什么问题
如有需要 请联系我
谢谢
发信人: superpanjy (Roger), 信区: FleaMarket
标 题: 【出售】自用的两条4GB 1066MHz DDR3 SDRAM - 2x4GB 可用于MBP imac
发信站: BBS 未名空间站 (Fri Jun 17 14:00:34 2011, 美东)
Kingston Apple 8GB Kit (2 X 4GB Modules) DDR3 1066MHz SODimm C7 iMac and
Macbook Pro Memory
因为apple 给我调换了机器 这两条内存用不上了
kingston
用在我2009年的MBP上没有什么问题
如有需要 请联系我
谢谢
s*r
4 楼
This one is on sale, is it good?
M*n
5 楼
I have the following statement in a function in one thread.
a = b;
Both a and b are 4-byte global variables. Now I have another thread that is
reading variable a too.
Is the above assignment atomic in x86_64?
If not, when the assignment resumes execution, will the stale b value (b
could have already been changed) or the updated b value be assigned to a?
a = b;
Both a and b are 4-byte global variables. Now I have another thread that is
reading variable a too.
Is the above assignment atomic in x86_64?
If not, when the assignment resumes execution, will the stale b value (b
could have already been changed) or the updated b value be assigned to a?
g*g
6 楼
http://www.icefilms.info/
or
bing icefilms xbmc
or
bing icefilms xbmc
t*b
7 楼
凤凰的就是他们的官方的直播源，但非常不稳定。一旦断了就得重新进入。
凤凰的大多节目都有点播了，如果您喜欢的没有，请告知或者帮助我们添加。
凤凰的大多节目都有点播了，如果您喜欢的没有，请告知或者帮助我们添加。
I*8
8 楼
哥，什马价格？
在内存和ssd之间犹豫
在内存和ssd之间犹豫
p*o
9 楼
What do you mean by atomic? Do you know memory barrier?
is
【在 M**********n 的大作中提到】
: I have the following statement in a function in one thread.
: a = b;
: Both a and b are 4-byte global variables. Now I have another thread that is
: reading variable a too.
: Is the above assignment atomic in x86_64?
: If not, when the assignment resumes execution, will the stale b value (b
: could have already been changed) or the updated b value be assigned to a?
is
【在 M**********n 的大作中提到】
: I have the following statement in a function in one thread.
: a = b;
: Both a and b are 4-byte global variables. Now I have another thread that is
: reading variable a too.
: Is the above assignment atomic in x86_64?
: If not, when the assignment resumes execution, will the stale b value (b
: could have already been changed) or the updated b value be assigned to a?
m*s
10 楼
为啥divx web player 1.5下载不能啊
t*z
11 楼
明白了！多谢！
【在 t**b 的大作中提到】
: 凤凰的就是他们的官方的直播源，但非常不稳定。一旦断了就得重新进入。
: 凤凰的大多节目都有点播了，如果您喜欢的没有，请告知或者帮助我们添加。
【在 t**b 的大作中提到】
: 凤凰的就是他们的官方的直播源，但非常不稳定。一旦断了就得重新进入。
: 凤凰的大多节目都有点播了，如果您喜欢的没有，请告知或者帮助我们添加。
P*a
12 楼
如果已经4G内存了，先上SSD
【在 I***8 的大作中提到】
: 哥，什马价格？
: 在内存和ssd之间犹豫
【在 I***8 的大作中提到】
: 哥，什马价格？
: 在内存和ssd之间犹豫
M*n
13 楼
By non-atomic/atomic, I mean the assignment may be not completely finishged
before the context is switched to another thread.
【在 p***o 的大作中提到】
: What do you mean by atomic? Do you know memory barrier?
:
: is
before the context is switched to another thread.
【在 p***o 的大作中提到】
: What do you mean by atomic? Do you know memory barrier?
:
: is
f*j
14 楼
我看很多直播都会不断loading,然后有时候就退出了, 会是因为我的网络速度不够吗?
d*e
15 楼
make sure b is volatile socit is not cached in register
is
【在 M**********n 的大作中提到】
: I have the following statement in a function in one thread.
: a = b;
: Both a and b are 4-byte global variables. Now I have another thread that is
: reading variable a too.
: Is the above assignment atomic in x86_64?
: If not, when the assignment resumes execution, will the stale b value (b
: could have already been changed) or the updated b value be assigned to a?
is
【在 M**********n 的大作中提到】
: I have the following statement in a function in one thread.
: a = b;
: Both a and b are 4-byte global variables. Now I have another thread that is
: reading variable a too.
: Is the above assignment atomic in x86_64?
: If not, when the assignment resumes execution, will the stale b value (b
: could have already been changed) or the updated b value be assigned to a?
f*o
16 楼
同问，刚买了roku, 点播很好，直播几乎不能看。
我看很多直播都会不断loading,然后有时候就退出了, 会是因为我的网络速度不够吗?
【在 f*******j 的大作中提到】
: 我看很多直播都会不断loading,然后有时候就退出了, 会是因为我的网络速度不够吗?
我看很多直播都会不断loading,然后有时候就退出了, 会是因为我的网络速度不够吗?
【在 f*******j 的大作中提到】
: 我看很多直播都会不断loading,然后有时候就退出了, 会是因为我的网络速度不够吗?
w*g
17 楼
问单个赋值操作是不是atomic没有意义。连续若干个读写操作才会有atomic或者memory
barrier的问题。
is
【在 M**********n 的大作中提到】
: I have the following statement in a function in one thread.
: a = b;
: Both a and b are 4-byte global variables. Now I have another thread that is
: reading variable a too.
: Is the above assignment atomic in x86_64?
: If not, when the assignment resumes execution, will the stale b value (b
: could have already been changed) or the updated b value be assigned to a?
barrier的问题。
is
【在 M**********n 的大作中提到】
: I have the following statement in a function in one thread.
: a = b;
: Both a and b are 4-byte global variables. Now I have another thread that is
: reading variable a too.
: Is the above assignment atomic in x86_64?
: If not, when the assignment resumes execution, will the stale b value (b
: could have already been changed) or the updated b value be assigned to a?
M*n
18 楼
Thanks
【在 d******e 的大作中提到】
: make sure b is volatile socit is not cached in register
:
: is
【在 d******e 的大作中提到】
: make sure b is volatile socit is not cached in register
:
: is
M*n
19 楼
It matters to us since we need lokc-free concurrency.
We need to make sure that when the assignment occurs (no matter atomic or
non-atomic in that sense), the latest and updated value of b is used in the
assignment.
memory
【在 w***g 的大作中提到】
: 问单个赋值操作是不是atomic没有意义。连续若干个读写操作才会有atomic或者memory
: barrier的问题。
:
: is
We need to make sure that when the assignment occurs (no matter atomic or
non-atomic in that sense), the latest and updated value of b is used in the
assignment.
memory
【在 w***g 的大作中提到】
: 问单个赋值操作是不是atomic没有意义。连续若干个读写操作才会有atomic或者memory
: barrier的问题。
:
: is
p*o
20 楼
You need to understand memory barrier in order to implement your own
lock-free code.
the
【在 M**********n 的大作中提到】
: It matters to us since we need lokc-free concurrency.
: We need to make sure that when the assignment occurs (no matter atomic or
: non-atomic in that sense), the latest and updated value of b is used in the
: assignment.
:
: memory
lock-free code.
the
【在 M**********n 的大作中提到】
: It matters to us since we need lokc-free concurrency.
: We need to make sure that when the assignment occurs (no matter atomic or
: non-atomic in that sense), the latest and updated value of b is used in the
: assignment.
:
: memory
M*n
21 楼
Thanks. I am not familiar with memory barrier. Just took a quick look at the
wiki page.
We don't care how compiler or CPU reordering the instructions.
All we care is that when that assignment is executed, the value assigned to
a is the value retrieved from b's actual memory address instead of some temp
register. Can this be guaranteed?
【在 p***o 的大作中提到】
: You need to understand memory barrier in order to implement your own
: lock-free code.
:
: the
wiki page.
We don't care how compiler or CPU reordering the instructions.
All we care is that when that assignment is executed, the value assigned to
a is the value retrieved from b's actual memory address instead of some temp
register. Can this be guaranteed?
【在 p***o 的大作中提到】
: You need to understand memory barrier in order to implement your own
: lock-free code.
:
: the
M*n
22 楼
Here is the illustration of a and b in two threads.
Thread 1 only writes to b and read a.
Thread 2 only writes to a and read b.
Thread 1 execution:
b = -1;
b = 0;
b = 1;
if(a != 0)
{
//do this
}
Thread 2 execution:
a = b;
// do that
Question is this:
Can the if condition be satisfied in thread 1 and 0 is assigned to a in
thread 2 (assuming a is initialized to -1 before both threads are started)?
【在 p***o 的大作中提到】
: You need to understand memory barrier in order to implement your own
: lock-free code.
:
: the
p*o
23 楼
Sure, why not ...
1 For Thread 2, a=b can be compiled into two instructions.
2 Even if you can make a=b a single instruction, compiler/processor
can reorder the writes to b and reads from a in Thread 1.
Here is the book if you have time to read:
Is Parallel Programming Hard, And, If So, What Can You Do About It?
Otherwise try to find a library instead of writing your own code.
【在 M**********n 的大作中提到】
:
: Here is the illustration of a and b in two threads.
: Thread 1 only writes to b and read a.
: Thread 2 only writes to a and read b.
: Thread 1 execution:
: b = -1;
: b = 0;
: b = 1;
: if(a != 0)
: {
1 For Thread 2, a=b can be compiled into two instructions.
2 Even if you can make a=b a single instruction, compiler/processor
can reorder the writes to b and reads from a in Thread 1.
Here is the book if you have time to read:
Is Parallel Programming Hard, And, If So, What Can You Do About It?
Otherwise try to find a library instead of writing your own code.
【在 M**********n 的大作中提到】
:
: Here is the illustration of a and b in two threads.
: Thread 1 only writes to b and read a.
: Thread 2 only writes to a and read b.
: Thread 1 execution:
: b = -1;
: b = 0;
: b = 1;
: if(a != 0)
: {
m*s
24 楼
On 32bit machine, the assignment is atomic.
If both threads run on same cpu core, nothing to worry about.
However, if it's multi core, the read thread potentially run on another core
might still see stale "a" due to lack of memory barrier. You need to ask
for sync to achieve lock free.
Hope this helps.
By non-atomic/atomic, I mean the assignment may be not completely finishged
before the c........
【在 M**********n 的大作中提到】
: By non-atomic/atomic, I mean the assignment may be not completely finishged
: before the context is switched to another thread.
If both threads run on same cpu core, nothing to worry about.
However, if it's multi core, the read thread potentially run on another core
might still see stale "a" due to lack of memory barrier. You need to ask
for sync to achieve lock free.
Hope this helps.
By non-atomic/atomic, I mean the assignment may be not completely finishged
before the c........
【在 M**********n 的大作中提到】
: By non-atomic/atomic, I mean the assignment may be not completely finishged
: before the context is switched to another thread.
w*x
25 楼
thread 1 execution:
try this:
b = -1;
smp_wb();
b = 0;
smp_wb();
b = 1;
smp_wb();
if(ACCESS_ONCE(a) != 0)
{
//do this
}
Thread 2 execution:
a = b;
smp_mb();
// do that
try this:
b = -1;
smp_wb();
b = 0;
smp_wb();
b = 1;
smp_wb();
if(ACCESS_ONCE(a) != 0)
{
//do this
}
Thread 2 execution:
a = b;
smp_mb();
// do that
M*n
26 楼
Thanks.
We have loads/assignments between these instructions that serve as memory
barrier already. If compiler reorder these instructions, it will break
single thread logic.
[发表自未名空间手机版 - m.mitbbs.com]
【在 w***x 的大作中提到】
: thread 1 execution:
: try this:
: b = -1;
: smp_wb();
: b = 0;
: smp_wb();
: b = 1;
: smp_wb();
: if(ACCESS_ONCE(a) != 0)
: {
We have loads/assignments between these instructions that serve as memory
barrier already. If compiler reorder these instructions, it will break
single thread logic.
[发表自未名空间手机版 - m.mitbbs.com]
【在 w***x 的大作中提到】
: thread 1 execution:
: try this:
: b = -1;
: smp_wb();
: b = 0;
: smp_wb();
: b = 1;
: smp_wb();
: if(ACCESS_ONCE(a) != 0)
: {
w*x
27 楼
mb/rb include both compiler memory barrier & cpu barriers.
r*s
28 楼
All "lock free" concurrency are implemented using atomic instructions
such as compare and swap, which use memory barrier to ensure safety.
It is non-sensible that you use lock free concurrency without
understanding memory barrier. Even if you get this one right you would
make other serious mistakes somewhere else.
Usually compilers won't allocate registers across instructions that
carries memory barrier behavior. However sometimes compiler may get
confused because of programmer's mistake. For example, if your
variable has an alias, and that alias is assigned to a temp variable
you are doomed either way.
the
【在 M**********n 的大作中提到】
: It matters to us since we need lokc-free concurrency.
: We need to make sure that when the assignment occurs (no matter atomic or
: non-atomic in that sense), the latest and updated value of b is used in the
: assignment.
:
: memory
such as compare and swap, which use memory barrier to ensure safety.
It is non-sensible that you use lock free concurrency without
understanding memory barrier. Even if you get this one right you would
make other serious mistakes somewhere else.
Usually compilers won't allocate registers across instructions that
carries memory barrier behavior. However sometimes compiler may get
confused because of programmer's mistake. For example, if your
variable has an alias, and that alias is assigned to a temp variable
you are doomed either way.
the
【在 M**********n 的大作中提到】
: It matters to us since we need lokc-free concurrency.
: We need to make sure that when the assignment occurs (no matter atomic or
: non-atomic in that sense), the latest and updated value of b is used in the
: assignment.
:
: memory
z*3
29 楼
不一定
immutable一样可以满足lock free concurrency的需要
不过这贴我没看上下文，你们继续
【在 r***s 的大作中提到】
: All "lock free" concurrency are implemented using atomic instructions
: such as compare and swap, which use memory barrier to ensure safety.
: It is non-sensible that you use lock free concurrency without
: understanding memory barrier. Even if you get this one right you would
: make other serious mistakes somewhere else.
: Usually compilers won't allocate registers across instructions that
: carries memory barrier behavior. However sometimes compiler may get
: confused because of programmer's mistake. For example, if your
: variable has an alias, and that alias is assigned to a temp variable
: you are doomed either way.
immutable一样可以满足lock free concurrency的需要
不过这贴我没看上下文，你们继续
【在 r***s 的大作中提到】
: All "lock free" concurrency are implemented using atomic instructions
: such as compare and swap, which use memory barrier to ensure safety.
: It is non-sensible that you use lock free concurrency without
: understanding memory barrier. Even if you get this one right you would
: make other serious mistakes somewhere else.
: Usually compilers won't allocate registers across instructions that
: carries memory barrier behavior. However sometimes compiler may get
: confused because of programmer's mistake. For example, if your
: variable has an alias, and that alias is assigned to a temp variable
: you are doomed either way.
r*s
30 楼
I strongly suggest you give up your efforts and find someone to help you
No. Loads and assignments don't serve as memory barrier.
They can either be served
From cache or even registers. With multi core the chance
Of your code run as you expected is near 0
The topic of concurrent programming is a complex one and clearly
You don't even know the basics.
【在 M**********n 的大作中提到】
: Thanks.
: We have loads/assignments between these instructions that serve as memory
: barrier already. If compiler reorder these instructions, it will break
: single thread logic.
:
: [发表自未名空间手机版 - m.mitbbs.com]
No. Loads and assignments don't serve as memory barrier.
They can either be served
From cache or even registers. With multi core the chance
Of your code run as you expected is near 0
The topic of concurrent programming is a complex one and clearly
You don't even know the basics.
【在 M**********n 的大作中提到】
: Thanks.
: We have loads/assignments between these instructions that serve as memory
: barrier already. If compiler reorder these instructions, it will break
: single thread logic.
:
: [发表自未名空间手机版 - m.mitbbs.com]
相关阅读
K8S , golang别犹豫开始学习Haskell天上天下，唯我独尊 怎么解释哪位能科普一下人脸识别的算法可以在 gce app engine部署机器，但用 aws dynamoDB 吗？调度问题，说个笑话给大家听算法面试大全台巴子造谣被抓包： (转载)調度機器都是簡單的，調度人才是最難的。可能吗：盗用信用卡网上买货居然用了我的IP address如何评价横跨美印的软件项目golang 为啥进不去android？比kotlin好用多了。在中文媒体传疯了， Stanford 算法女神 (转载)【bssd】Nuro的朱家俊是目前混得最好的IT琐男了吧马工发财的机会来鸟 (转载)Linux就是数码界的丐帮，虽然恶心但是强大请教高手：python 的machine learning 算法 production code 在有些需要？请问有简单例子吗？golang scheduler in brief小印给我的任务合理吗？github可以让合作者不能push吗？