本文是两篇系列文章的第一篇，讨论如何在多线程环境中设计并发数据结构。
This article, the first in a two-part series, discusses the design of concurrent data structures in a multithreaded environment.
这个堆栈没有锁；这种无锁的并发数据结构也称为非阻塞数据结构。
No locks will be included; this kind of lock-free, concurrent data structure is also referred to as a non-blocking data structure.
这个问题也突显了并发数据结构的基本设计原则之一：决不要假设任何代码会连续执行。
This problem also highlights one of the fundamental design principles when it comes to working with parallel data structures: Do not assume sequential execution of any code, ever.
比如说，我们在Jetty中使用了并发技术，但却并没有使用常见的标准并发数据结构，因为这会创建太多的对象。
For example, we are using the concurrent techniques in Jetty, but we do not use many of the standard concurrent data structures as they create too many objects.
本文是本系列的最后一篇，讨论两个主题：关于实现基于互斥锁的并发链表的设计方法和设计不使用互斥锁的并发数据结构。
This article—the concluding part in this series—discusses two things: Design choices for implementing a mutex based concurrent list and designing concurrent data structures without mutexes.
对于后一个主题，我选择实现一个并发堆栈并解释设计这种数据结构涉及的一些问题。
For the latter topic, I have chosen to implement a concurrent stack and highlight some of the issues in designing such a data structure.
过去一年中，它之所以受到广泛关注，最主要的原因是其并发特性，如支持软件事务存储(Soft ware Transactional Memory——STM)及其他强大的数据结构。
Over the past year it has gained a lot of attention, mostly due to its concurrency features such as support for Software Transactional Memory (STM) and other powerful data structures.
TDB特别被编写来处理许多并发的编写器和二进制数据，例如内部数据结构。
The TDB in particular was written to handle many concurrent writers and binary data such as internal data structures.
并发Collections提供了线程安全、经过良好调优的数据结构，简化了并发编程。
Concurrent Collections make concurrent programming easier by providing thread-safe, well-tuned data structures.
考虑到时延对系统性能的影响，该文归纳出一种并发延时模型，并利用FIFO型数据结构设计了相应的并发延时算法。
To analyze the influence of time - delay on system performance, a parallelly triggered delaying model is induced and relevant algorithm is designed based on FIFO data structure.
该算法充分利用了Petri网的数学理论基础和描述并发系统的能力，其数据结构简单，便于计算机编程处理。
The algorithm fully takes advantage of mathematics foundation of Petri nets, is of parallel computing capability and simpler data structure. The method is much easier for implementation.
该算法充分利用了Petri网的数学理论基础和描述并发系统的能力，其数据结构简单，便于计算机编程处理。
The algorithm fully takes advantage of mathematics foundation of Petri nets, is of parallel computing capability and simpler data structure. The method is much easier for implementation.
应用推荐