尝试用户空间中的解决方案导致难于解决的竞态条件。
Attempting a solution in user space causes difficult-to-solve race conditions.
内核本身是动态的,而且有许多创建竞态条件的方法。
The kernel itself is dynamic, and race conditions can be created in a number of ways.
尽管有这一功能,开发人员仍要忍受同步问题、避免竞态条件。
Despite of this feature developers still have to bear with synchronization and avoiding race conditions.
尤其是潜在的竞态条件和死锁会突然间成为最令人头疼的问题。
Specifically, problems such as race conditions and deadlocks that lie dormant could suddenly become major problems.
甚至单处理器系统也必须要这样禁用抢占机制以防止竞态条件的产生。
Even uniprocessor systems must disable preemption in this way to avoid race conditions.
以前我们认为竞态条件是最重要的问题,因为它们会破坏数据,而且很难找到问题的根源。
Originally we thought that race conditions would be the most important problem, because they can cause data corruption and they are especially hard to work backwards to find a root cause.
甚至在确定了会产生问题的几行关键代码后,依旧难以解耦那些会导致竞态条件或者死锁的交叉存取事件。
Even after isolating a problem down to a few crucial lines of code, it can be difficult to untangle the interleaved events required to make a race condition or deadlock occur.
当计算结果依赖于两个或更多进程被调度的顺序,我们说这段代码是错的,这种情况被称为竞态条件,也叫竞态或竞争。
When the outcome of some computation depends on how two or more processes are scheduled, the code is incorrect. We say that there is a race condition.
如果将某个线程添加到列表末尾时,其他线程正在遍历该列表,那么可能会产生竞态条件(race condition)。
This could result in race conditions if one thread is adding to the end of the list while another is iterating through it.
我们这里遇到的情况叫做竞态条件(racecondition),是一种出错概率非常小的条件,意味着您只有非常快速或者非常运气不好才会遇到这种情况。
What you have here is called a "race condition," a condition where something can go wrong only during a small window, meaning that you have to be pretty fast, or pretty unlucky, to see the problem.
我们这里遇到的情况叫做竞态条件(racecondition),是一种出错概率非常小的条件,意味着您只有非常快速或者非常运气不好才会遇到这种情况。
What you have here is called a "race condition," a condition where something can go wrong only during a small window, meaning that you have to be pretty fast, or pretty unlucky, to see the problem.
应用推荐