So for example, instead of concurrent linked lists, we use dual concurrent lock circular arrays, so we have the benefits of non blocking concurrency without object creation.
因此，相对于并发链表，我们采用了二重并发锁循环数组（dual concurrent lock circular arrays），这样无需创建对象就能享受到非阻塞并发带来的好处。
With this type of lock, concurrent applications can read from or write to the locked table.
有了这一类型的锁，并发应用程序就可以读或写已锁定的表。
When a table holds a Z lock, no concurrent application can read or update data in that table.
当表持有z锁时，任何并发应用程序都不能读取和更新该表中的数据。
It returns the most recently committed version of the rows, even if another concurrent session holds an exclusive row-level lock.
即使另一个并发会话持有一个独占式行级锁，它仍然返回最近提交的行。
When a table holds an IX lock, the lock owner and concurrent applications can read and update data in that table.
当表持有IX锁时，锁拥有者和并发应用程序可以读和更新该表中的数据。
Mode: Specifies the type of access allowed for the lock owner as well as the type of access permitted for concurrent users of the locked data resource.
方式：指定了锁的拥有者所允许的访问类型，以及对锁定数据资源的并发用户许可的访问类型。
The s lock allows concurrent applications that use read-only queries to access the target table, but applications attempting to write data to the table are prevented from doing so.
s锁允许使用只读查询的并发应用程序访问目标表，但是防止应用程序写数据到表中。
Conversely, if an exclusive lock was able to be acquired, concurrent applications would not be able to access the file and could fail with a lock time-out.
相反地，如果能够获得互斥型锁，那么并发应用程序就无法访问文件，并因为锁超时失败。
No locks will be included; this kind of lock-free, concurrent data structure is also referred to as a non-blocking data structure.
这个堆栈没有锁；这种无锁的并发数据结构也称为非阻塞数据结构。
When having duplicate rows in the lock table (see the Create a DB2 table for resource locking section), concurrent use of the resource is possible.
如果锁表中有重复的行(参见为资源锁定创建一个DB 2表一节)，就可以对资源进行并发使用。
Atomic variables have memory semantics similar to that of volatile variables, but because they can also be modified atomically, they can be used as the basis for lock-free concurrent algorithms.
原子变量的内存语义与volatile变量类似，但是因为它们也可以被原子性地修改，所以可以把它们用作不使用锁的并发算法的基础。
This paper introduced the two key problems solved by the system: transactional operation and concurrent control, and proposed the lock tie mechanism based on PRI.
详细介绍了系统实现中解决的两个关键问题：事务型操作的处理和并发控制，并提出了基于优先级的锁绑定机制。
A concurrent control algorithm of distributed data management based on the lock is presented in this paper.
提出一种用于分布数据管理的基于锁定的并发控制算法。
A concurrent control algorithm of distributed data management based on the lock is presented in this paper.
提出一种用于分布数据管理的基于锁定的并发控制算法。
应用推荐