LockFreeVector 基于AtomicReferenceArray 实现的无锁的集合

最新推荐文章于 2023-10-24 16:57:21 发布

朝阳前的黑暗

最新推荐文章于 2023-10-24 16:57:21 发布

阅读量360

点赞数

分类专栏：线程文章标签： java

本文链接：https://blog.csdn.net/prettyboy2ge/article/details/84351260

版权

本文探讨了在多线程环境下，通过AtomicReferenceArray实现无锁集合LockFreeVector的学习过程，深入理解无锁编程与并发控制。

摘要由CSDN通过智能技术生成

最近在学多线程，阻塞，非阻塞，其中无锁的概念引出了

java.util.concurrent.atomic 包里的一些无锁对象，看到有人根据

AtomicReferenceArray实现了无锁Vector代码如下：

import java.util.AbstractList;
import java.util.concurrent.atomic.AtomicReference;
import java.util.concurrent.atomic.AtomicReferenceArray;

/**
 * It is a thread safe and lock-free vector.
 * This class implement algorithm from:<br>
 *
 * Lock-free Dynamically Resizable Arrays <br>
 *
 * Damian Dechev, Peter Pirkelbauer, and Bjarne Stroustrup<br>
 * Texas A&M University College Station, TX 77843-3112<br>
 * {dechev, peter.pirkelbauer}@tamu.edu, bs@cs.tamu.edu
 *
 *
 * @author Zhi Gan
 *
 * @param <E> type of element in the vector
 *
 */
public class LockFreeVector<E> extends AbstractList<E> {
    private static final boolean debug = false;
    /**
     * Size of the first bucket. sizeof(bucket[i+1])=2*sizeof(bucket[i])
     */
    private static final int FIRST_BUCKET_SIZE = 8;

    /**
     * number of buckets. 30 will allow 8*(2^30-1) elements
     */
    private static final int N_BUCKET = 30;

    /**
     * We will have at most N_BUCKET number of buckets. And we have
     * sizeof(buckets.get(i))=FIRST_BUCKET_SIZE**(i+1)
     */
    private final AtomicReferenceArray<AtomicReferenceArray<E>> buckets;

    /**
     * @author ganzhi
     *
     * @param <E>
     */
    static class WriteDescriptor<E> {
        public E oldV;
        public E newV;