黄姝娟, 容晓峰, 茹媛, 张雅. 一种采用Lock-Free同步机制的数据结构的研究[J]. 微电子学与计算机, 2016, 33(10): 72-77.
引用本文: 黄姝娟, 容晓峰, 茹媛, 张雅. 一种采用Lock-Free同步机制的数据结构的研究[J]. 微电子学与计算机, 2016, 33(10): 72-77.
HUANG Shu-juan, RONG Xiao-feng, RU Yuan, ZHANG Ya. A Lock-Free Synchronization Mechanism for Shared Data Structure[J]. Microelectronics & Computer, 2016, 33(10): 72-77.
Citation: HUANG Shu-juan, RONG Xiao-feng, RU Yuan, ZHANG Ya. A Lock-Free Synchronization Mechanism for Shared Data Structure[J]. Microelectronics & Computer, 2016, 33(10): 72-77.

一种采用Lock-Free同步机制的数据结构的研究

A Lock-Free Synchronization Mechanism for Shared Data Structure

  • 摘要: 随着多核芯片在嵌入式实时系统中的广泛应用, 采用传统锁机制对共享数据的访问会引起死锁、优先级翻转以及CPU饥饿现象, 进而会影响系统整体性能的发挥, 严重时还会导致不可估量的损失发生.为此, 针对Skip-list的共享数据结构提出了一种Lock-Free的同步机制方法, 对该方法的线性一致性进行了证明, 并将其应用于混合关键任务的共享优先级调度队列中.经过实验, 该方法在吞吐量、核利用率以及平均响应时间方面优于传统的基于锁机制的方法, 有效地提升了多核运行的效率.

     

    Abstract: With the multi-core chip wildly used in the embedded real-time system, the traditional lock synchronization may cause deadlock, priority inversion and cpu starvation. It may degrade performance and cause inestimable loss to the real-time system. This paper proposed a lock-free alogrithm for the Skip-list data structure and gave the proof for its linear consistency and used it as a shared priority queue for mixed-critical system. The experimental results show that this method has much better than the lock mechanism on average response time and utilization rate of multi-core processor and have the higher system throughput rate.

     

/

返回文章
返回