是否有必要对仅用于删除操作的列表进行同步

我有一个 LinkedList 已使用某些对象初始化。现在,元素将从 head 其中 linkedlist 来自多个线程。只要没有线程获得任何重复的元素,那么哪个线程获得什么元素并不重要。我想知道是否有必要对这个列表进行同步,以便按顺序删除,还是需要使用列表的任何并发变体。仅注释 linkedlist.poll() 方法将从其他线程调用。为了测试它,我还编写了一个测试,其中有一个整数列表,我从多个线程中提取几个整数并将它们相加。然后,当所有线程都完成时,我断言list拥有的整数的总和等于这些线程返回的所有和的总和。对我来说,如果没有同步,它永远不会失败,那么我的假设是正确的还是测试中有错误?

import java.util.Iterator;
import java.util.LinkedList;
import java.util.List;
import java.util.concurrent.*;
import java.util.function.BiFunction;
import java.util.stream.Collectors;
import java.util.stream.IntStream;

public class Demo {

    private final LinkedList<Integer> list;
    private static final int THREAD_COUNT = 5;
    private static final int LIST_SIZE = 250;

    public Demo(){
        list = IntStream.rangeClosed(1, LIST_SIZE)
                .collect(LinkedList::new, LinkedList::add, LinkedList::addAll);
    }

    private final static BiFunction<Demo, CountDownLatch, Callable<Integer>> callableFactory = (demo, latch) -> () -> {
        try {
            System.out.println("Here "+ Thread.currentThread().getName());
            latch.countDown();
            latch.await();
        } catch (InterruptedException e) {
            e.printStackTrace();
        }
        System.out.println("Running task on thread "+ Thread.currentThread().getName());
        return IntStream.rangeClosed(1, LIST_SIZE / THREAD_COUNT)
                .map(x -> demo.getNumber())
                .sum();
    };

    public static void main(String[] args) throws InterruptedException, ExecutionException {
        if(LIST_SIZE < THREAD_COUNT || LIST_SIZE % THREAD_COUNT != 0) throw new IllegalArgumentException("Wrong parameters to test");
        ExecutorService exe = Executors.newFixedThreadPool(THREAD_COUNT);
        CountDownLatch latch = new CountDownLatch(THREAD_COUNT);
        Demo d = new Demo();
        List<Future<Integer>> futures = exe.invokeAll(IntStream.rangeClosed(1, THREAD_COUNT).mapToObj(x-> callableFactory.apply(d, latch)).collect(Collectors.toList()));
        System.out.println("Tasks submitted");
        int sum = 0;
        for(Iterator<Future<Integer>> itr = futures.iterator(); itr.hasNext(); sum+=itr.next().get());
        System.out.println(sum);
        System.out.println(IntStream.rangeClosed(1, LIST_SIZE).sum());
        exe.shutdownNow();
    }

    public int getNumber(){
        return list.poll();
    }
}