<?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>红黑树 on Answer</title>
    <link>https://answer.freetools.me/tags/%E7%BA%A2%E9%BB%91%E6%A0%91/</link>
    <description>Recent content in 红黑树 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/%E7%BA%A2%E9%BB%91%E6%A0%91/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>跳表：概率如何击败确定性复杂度</title>
      <link>https://answer.freetools.me/%E8%B7%B3%E8%A1%A8%E6%A6%82%E7%8E%87%E5%A6%82%E4%BD%95%E5%87%BB%E8%B4%A5%E7%A1%AE%E5%AE%9A%E6%80%A7%E5%A4%8D%E6%9D%82%E5%BA%A6/</link>
      <pubDate>Sat, 07 Mar 2026 04:35:05 +0800</pubDate>
      <guid>https://answer.freetools.me/%E8%B7%B3%E8%A1%A8%E6%A6%82%E7%8E%87%E5%A6%82%E4%BD%95%E5%87%BB%E8%B4%A5%E7%A1%AE%E5%AE%9A%E6%80%A7%E5%A4%8D%E6%9D%82%E5%BA%A6/</guid>
      <description>从William Pugh 1990年的原始论文出发，深入解析跳表的概率平衡原理、Redis与LevelDB的技术选型逻辑、与红黑树的权衡分析，以及为什么这种&amp;#34;用随机换简单&amp;#34;的设计哲学在高性能系统中持续发光。</description>
    </item>
    <item>
      <title>进程调度：为什么Linux放弃了O(1)的完美时间复杂度</title>
      <link>https://answer.freetools.me/%E8%BF%9B%E7%A8%8B%E8%B0%83%E5%BA%A6%E4%B8%BA%E4%BB%80%E4%B9%88linux%E6%94%BE%E5%BC%83%E4%BA%86o1%E7%9A%84%E5%AE%8C%E7%BE%8E%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6/</link>
      <pubDate>Thu, 05 Mar 2026 16:46:42 +0800</pubDate>
      <guid>https://answer.freetools.me/%E8%BF%9B%E7%A8%8B%E8%B0%83%E5%BA%A6%E4%B8%BA%E4%BB%80%E4%B9%88linux%E6%94%BE%E5%BC%83%E4%BA%86o1%E7%9A%84%E5%AE%8C%E7%BE%8E%E6%97%B6%E9%97%B4%E5%A4%8D%E6%9D%82%E5%BA%A6/</guid>
      <description>从1991年Linus Torvalds写下的20行调度代码，到2023年EEVDF取代统治十六年的CFS，Linux进程调度器的演进揭示了操作系统中看似已&amp;#34;解决&amp;#34;的问题如何在多核时代重新变得复杂。本文深入剖析O(1)调度器为何失败、CFS如何用O(log n)换取公平性、以及EEVDF如何用虚拟截止时间解决延迟困境。</description>
    </item>
  </channel>
</rss>
