Sort by time | Sort by thread (beta)
Link to this comment:
Share to:
Loading...
- Your queue is empty. Add videos to your queue using this button:
or sign in to load a different list.
Loading...Saving...
@16.39 Rule (5) causal consistency:
For Processor 1 did we mean:
- mov [_y], 1
+ mov [_y], r1 << r1 not 1
w/o that not sure why store(y) is causally related to r1 = load(x) in Processor 1.
kuttyb6 10 months ago
No wonder google can put forty-minute long high quality videos on the tube...it owns it
Interesting topic btw...
Ovidius777 3 years ago
soy de peru esta interesante el video nos enseña mucho....
sigue asi! chau.
miltonvdl15 3 years ago
It seems to me that the total lock ordering must impose a fundamental scalability overhead. I haven't read the paper but it seems they're saying that they will supply an actual total ordering, rather than an "as-if" ordering. Meaning that two completely independent processes will get a total ordering on their critical sections, regardless of whether they could detect that or not. It's hard for me to see how a performance impact could be avoided.
ngeuey 3 years ago
it would be nice to see a talk from ulrich drepper as well, if he ever did one on the topic.
yoshi314 3 years ago