<?xml version="1.0" encoding="utf-8" standalone="yes"?>
<rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom" xmlns:content="http://purl.org/rss/1.0/modules/content/">
  <channel>
    <title>CAS on Answer</title>
    <link>https://answer.freetools.me/tags/cas/</link>
    <description>Recent content in CAS on Answer</description>
    <generator>Hugo -- 0.152.2</generator>
    <language>zh-cn</language>
    <lastBuildDate>Sun, 08 Mar 2026 16:09:54 +0800</lastBuildDate>
    <atom:link href="https://answer.freetools.me/tags/cas/index.xml" rel="self" type="application/rss+xml" />
    <item>
      <title>ConcurrentHashMap的十五年演进：从分段锁到CAS如何重塑Java并发基石</title>
      <link>https://answer.freetools.me/concurrenthashmap%E7%9A%84%E5%8D%81%E4%BA%94%E5%B9%B4%E6%BC%94%E8%BF%9B%E4%BB%8E%E5%88%86%E6%AE%B5%E9%94%81%E5%88%B0cas%E5%A6%82%E4%BD%95%E9%87%8D%E5%A1%91java%E5%B9%B6%E5%8F%91%E5%9F%BA%E7%9F%B3/</link>
      <pubDate>Sun, 08 Mar 2026 16:09:54 +0800</pubDate>
      <guid>https://answer.freetools.me/concurrenthashmap%E7%9A%84%E5%8D%81%E4%BA%94%E5%B9%B4%E6%BC%94%E8%BF%9B%E4%BB%8E%E5%88%86%E6%AE%B5%E9%94%81%E5%88%B0cas%E5%A6%82%E4%BD%95%E9%87%8D%E5%A1%91java%E5%B9%B6%E5%8F%91%E5%9F%BA%E7%9F%B3/</guid>
      <description>深入解析ConcurrentHashMap从JDK 7分段锁到JDK 8 CAS&#43;synchronized的重大架构演进。剖析Doug Lea的设计哲学、桶级细粒度锁策略、红黑树优化、多线程协作扩容机制、LongAdder式计数方案，以及synchronized在JVM层面的优化演进。</description>
    </item>
    <item>
      <title>一个int变量如何支撑起Java并发包的半壁江山：AQS的设计哲学与实现原理</title>
      <link>https://answer.freetools.me/%E4%B8%80%E4%B8%AAint%E5%8F%98%E9%87%8F%E5%A6%82%E4%BD%95%E6%94%AF%E6%92%91%E8%B5%B7java%E5%B9%B6%E5%8F%91%E5%8C%85%E7%9A%84%E5%8D%8A%E5%A3%81%E6%B1%9F%E5%B1%B1aqs%E7%9A%84%E8%AE%BE%E8%AE%A1%E5%93%B2%E5%AD%A6%E4%B8%8E%E5%AE%9E%E7%8E%B0%E5%8E%9F%E7%90%86/</link>
      <pubDate>Sun, 08 Mar 2026 16:03:32 +0800</pubDate>
      <guid>https://answer.freetools.me/%E4%B8%80%E4%B8%AAint%E5%8F%98%E9%87%8F%E5%A6%82%E4%BD%95%E6%94%AF%E6%92%91%E8%B5%B7java%E5%B9%B6%E5%8F%91%E5%8C%85%E7%9A%84%E5%8D%8A%E5%A3%81%E6%B1%9F%E5%B1%B1aqs%E7%9A%84%E8%AE%BE%E8%AE%A1%E5%93%B2%E5%AD%A6%E4%B8%8E%E5%AE%9E%E7%8E%B0%E5%8E%9F%E7%90%86/</guid>
      <description>深入解析Java并发包核心框架AQS的设计哲学。从Doug Lea 2004年的原始论文出发，探讨为何一个int类型的state变量能够支撑ReentrantLock、CountDownLatch、Semaphore等多种同步器的实现。剖析CLH队列变体的设计原理、公平与非公平锁的性能权衡，以及AQS如何用模板方法模式简化同步器开发。</description>
    </item>
    <item>
      <title>无锁编程的内存困境：为什么最难的竟不是算法本身</title>
      <link>https://answer.freetools.me/%E6%97%A0%E9%94%81%E7%BC%96%E7%A8%8B%E7%9A%84%E5%86%85%E5%AD%98%E5%9B%B0%E5%A2%83%E4%B8%BA%E4%BB%80%E4%B9%88%E6%9C%80%E9%9A%BE%E7%9A%84%E7%AB%9F%E4%B8%8D%E6%98%AF%E7%AE%97%E6%B3%95%E6%9C%AC%E8%BA%AB/</link>
      <pubDate>Fri, 06 Mar 2026 07:48:44 +0800</pubDate>
      <guid>https://answer.freetools.me/%E6%97%A0%E9%94%81%E7%BC%96%E7%A8%8B%E7%9A%84%E5%86%85%E5%AD%98%E5%9B%B0%E5%A2%83%E4%B8%BA%E4%BB%80%E4%B9%88%E6%9C%80%E9%9A%BE%E7%9A%84%E7%AB%9F%E4%B8%8D%E6%98%AF%E7%AE%97%E6%B3%95%E6%9C%AC%E8%BA%AB/</guid>
      <description>深入解析无锁编程中内存回收的核心难题。从ABA问题的底层原理，到Hazard Pointers、Epoch-Based Reclamation、RCU等五大内存回收技术的设计权衡。基于Maged Michael的经典论文、Trevor Brown的DEBRA研究、Crossbeam的实现经验，揭示这个被称为&amp;#34;共享内存并发中最困难的开放问题&amp;#34;的技术本质。</description>
    </item>
  </channel>
</rss>
