{"id":21220778,"url":"https://github.com/mutouyun/lock-free-queue","last_synced_at":"2026-04-01T21:50:37.196Z","repository":{"id":77466621,"uuid":"170846303","full_name":"mutouyun/lock-free-queue","owner":"mutouyun","description":"CN-CppUserGroup-2019-1，lock-free queue demo","archived":false,"fork":false,"pushed_at":"2020-08-13T13:14:42.000Z","size":4867,"stargazers_count":94,"open_issues_count":2,"forks_count":20,"subscribers_count":7,"default_branch":"master","last_synced_at":"2026-03-27T23:42:00.648Z","etag":null,"topics":["cpp","lock-free","lock-free-queue"],"latest_commit_sha":null,"homepage":"","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/mutouyun.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2019-02-15T10:23:50.000Z","updated_at":"2026-03-15T14:12:30.000Z","dependencies_parsed_at":"2023-04-30T17:46:15.889Z","dependency_job_id":null,"html_url":"https://github.com/mutouyun/lock-free-queue","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/mutouyun/lock-free-queue","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mutouyun%2Flock-free-queue","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mutouyun%2Flock-free-queue/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mutouyun%2Flock-free-queue/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mutouyun%2Flock-free-queue/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/mutouyun","download_url":"https://codeload.github.com/mutouyun/lock-free-queue/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/mutouyun%2Flock-free-queue/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":31292573,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-01T21:15:39.731Z","status":"ssl_error","status_checked_at":"2026-04-01T21:15:34.046Z","response_time":53,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["cpp","lock-free","lock-free-queue"],"created_at":"2024-11-20T22:14:05.042Z","updated_at":"2026-04-01T21:50:37.171Z","avatar_url":"https://github.com/mutouyun.png","language":"C++","readme":"# Lock-Free Queue\n\n[![Build Status](https://travis-ci.org/mutouyun/lock-free-queue.svg?branch=master)](https://travis-ci.org/mutouyun/lock-free-queue) [![Build status](https://ci.appveyor.com/api/projects/status/github/mutouyun/lock-free-queue?branch=master\u0026svg=true)](https://ci.appveyor.com/project/mutouyun/lock-free) [![](https://img.shields.io/badge/speech-bilibili-ff69b4.svg)](https://www.bilibili.com/video/av47644468/?p=1)\n\nlock-free linked-queue \u0026 ring-buffer queue\n* 演讲ppt：[Lock-Free Queue](lock-free.pptx)\n\n## Reference\n\n * [无锁队列的实现 | 酷 壳 - CoolShell](https://coolshell.cn/articles/8239.html)\n * [Yet another implementation of a lock-free circular array queue | CodeProject](https://www.codeproject.com/Articles/153898/Yet-another-implementation-of-a-lock-free-circular)\n * [无锁数据结构（基础篇）：原子性、原子性原语](http://blog.jobbole.com/90811/)\n * [无锁数据结构（基础篇）：内存栅障](http://blog.jobbole.com/101977/)\n * [无锁数据结构（基础篇）：内存模型](http://blog.jobbole.com/102360/)\n * [无锁数据结构（机制篇）：内存管理规则](http://blog.jobbole.com/107955/)\n * [3.5 可线性化性 - 51CTO.COM](http://book.51cto.com/art/201305/396684.htm)\n * [线性一致性(Linear consistency)，串行一致性(或顺序一致性Sequential consistency)，静态一致性(Quiescent consistency) | Jianning's space](https://jnxnj.wordpress.com/2009/01/30/%E7%BA%BF%E6%80%A7%E4%B8%80%E8%87%B4%E6%80%A7linear-consistency%EF%BC%8C%E4%B8%B2%E8%A1%8C%E4%B8%80%E8%87%B4%E6%80%A7%E6%88%96%E9%A1%BA%E5%BA%8F%E4%B8%80%E8%87%B4%E6%80%A7sequential-consistency/)\n * [多线程程序开发踩坑记 | _kawaiiQ's blog](https://kawaiiq.xyz/articles/11/)\n * [Lock-Free 编程 | 匠心十年 - 博客园](http://www.cnblogs.com/gaochundong/p/lock_free_programming.html)\n * [Java并发编程 | 金融通的博客](https://rongtongjin.github.io/2017/09/15/Java%E5%B9%B6%E5%8F%91%E7%BC%96%E7%A8%8B/)\n * [Category: 并行编程 - Yebangyu's Blog](http://www.yebangyu.org/blog/categories/bing-xing-bian-cheng/)\n * [测试分布式系统的线性一致性 - 知乎](https://zhuanlan.zhihu.com/p/29101097)\n * [分布式系统中的一致性 - 知乎](https://zhuanlan.zhihu.com/p/33711664)\n * [Linearizability 和 Serializability | io.Seeker](http://www.ioseeker.com/2018/03/16/linearizability_and_serializability/)\n\n## Papers\n\n * [Lock-Free Data Structures | Dr Dobb's](http://www.drdobbs.com/lock-free-data-structures/184401865)\n * [Implementing Lock-Free Queues - John D. Valois](http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.53.8674\u0026rep=rep1\u0026type=pdf)\n * [Simple, Fast, and Practical Non-Blocking and Blocking Concurrent Queue Algorithms - Maged M. Michael, Michael L. Scott](http://www.cs.rochester.edu/~scott/papers/1996_PODC_queues.pdf)\n * [On the Nature of Progress - Maurice Herlihy, Nir Shavit](http://www.cs.tau.ac.il/~shanir/progress.pdf)\n * [基于共享内存的多核时代数据结构研究 - 周维, 周可人, 栾钟治, 姚绍文, 钱德沛](http://www.jos.org.cn/ch/reader/create_pdf.aspx?file_no=5021\u0026journal_id=jos)\n\n## Books\n\n * [The Art of Multiprocessor Programming - Maurice Herlihy, Nir Shavit](http://courses.csail.mit.edu/6.852/08/papers/lists-book-chapter.pdf)\n * [C++ Concurrency in Action - Anthony Williams, 陈晓伟（译）](http://wiki.jikexueyuan.com/project/cplusplus-concurrency-action/)\n\n## Libraries\n\n * [Chapter 22. Boost.Lockfree - 1.69.0](https://www.boost.org/doc/libs/1_69_0/doc/html/lockfree.html)\n * [cameron314/concurrentqueue: A fast multi-producer, multi-consumer lock-free concurrent queue for C++11](https://github.com/cameron314/concurrentqueue)\n * [LMAX-Exchange/disruptor: High Performance Inter-Thread Messaging Library](https://github.com/LMAX-Exchange/disruptor)\n   * [高性能队列——Disruptor - 知乎](https://zhuanlan.zhihu.com/p/23863915)\n   * [高效内存无锁队列 Disruptor | shanshanpt](http://www.okyes.me/2016/11/01/disruptor.html)\n   * [剖析Disruptor:为什么会这么快？（一）Ringbuffer的特别之处 | 并发编程网 – ifeve.com](http://ifeve.com/dissecting-disruptor-whats-so-special/)\n * [MengRao/WFMPMC: A bounded wait-free(almost) zero-copy MPMC queue written in C++11, which can also reside in SHM for IPC](https://github.com/MengRao/WFMPMC)\n   * [一个Wait-Free MPMC队列的实现 - 知乎](https://zhuanlan.zhihu.com/p/46826262)\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmutouyun%2Flock-free-queue","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmutouyun%2Flock-free-queue","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmutouyun%2Flock-free-queue/lists"}