Lock-free deques and doubly linked lists

We present a practical lock-free shared data structure that efficiently implements the operations of a concurrent deque as well as a general doubly linked list. The implementation supports parallelism for disjoint accesses and uses atomic primitives which are available in modern computer systems. Previously known lock-free algorithms of doubly linked lists are either based on non-available atomic synchronization primitives, only implement a subset of the functionality, or are not designed for disjoint accesses. Our algorithm only requires single-word compare-and-swap atomic primitives, supports fully dynamic list sizes, and allows traversal also through deleted nodes and thus avoids unnecessary operation retries. We have performed an empirical study of our new algorithm on two different multiprocessor platforms. Results of the experiments performed under high contention show that the performance of our implementation scales linearly with increasing number of processors. Considering deque implementations and systems with low concurrency, the algorithm by Michael shows the best performance. However, as our algorithm is designed for disjoint accesses, it performs significantly better on systems with high concurrency and non-uniform memory architecture.     

一个TCP调试系统的设计与实现

TCP软件一般位于操作系统的核心,这种情况给TCP的研究和调试带来了很大的困难,在Sun Solaris平台上,我们使用系统提供的DLPI接口和有关多线程的系统调用,构建了一个TCP调试系统,简化了调试过程。     

用VC＋＋6．0开发计算机与GPS通信的应用程序

介绍了GPS的数据采集格式,和在Windows95以上环境下,用VC＋＋6．0开发基于Windows消息机制的多线制的多线程的GPS应用程序,并给出了一个实例。     

大型12个头环面蜗杆副的研制

在已具有设计、加工蜗杆头数Z1max=8、速比imin=5、中心矩αmax=500双锥面二次包络环面蜗杆副经验基础上,尝试蜗杆头数Z1=12,蜗轮齿数Z2=47、中心矩α=600双锥面二次包络环面蜗杆副设计、加工的可能.通过设计制作专用滚刀,应用现有加工设备与外部设备的结合,圆满制造出符合用户要求蜗轮副.此次研制的成功...