<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Concurrency | ArshiA Akhavan</title><link>/tag/concurrency/</link><atom:link href="/tag/concurrency/index.xml" rel="self" type="application/rss+xml"/><description>Concurrency</description><generator>Wowchemy (https://wowchemy.com)</generator><language>en-us</language><lastBuildDate>Tue, 01 Aug 2023 00:00:00 +0000</lastBuildDate><image><url>/media/icon_hu4465ddf6480ee1ba1618677e0a319862_2549_512x512_fill_lanczos_center_3.png</url><title>Concurrency</title><link>/tag/concurrency/</link></image><item><title>Hash Map Based on Split-Ordered Lists</title><link>/project/split-ordered-hashmap/</link><pubDate>Tue, 01 Aug 2023 00:00:00 +0000</pubDate><guid>/project/split-ordered-hashmap/</guid><description>&lt;p>A concurrent hash map in Rust based on Shalev and Shavit&amp;rsquo;s split-ordered lists, which grow the table without moving items between buckets.&lt;/p></description></item><item><title>Hazard Pointers</title><link>/project/hazard-pointers/</link><pubDate>Tue, 01 Aug 2023 00:00:00 +0000</pubDate><guid>/project/hazard-pointers/</guid><description>&lt;p>Hazard pointers let a thread announce which shared nodes it is about to read, so that other threads defer freeing them. This implementation provides safe memory reclamation for lock-free data structures in Rust.&lt;/p></description></item></channel></rss>