I read the paper https://arxiv.org/pdf/2402.05099. But there is a detail that I cannot understand. In section 4.6 performance model, why is there a "logn" in the equation that measures the communication time for the broadcast.
My guess: Do you use a non-naive tree pattern like a complete binary tree or a binomial heap rather than the naive tree which is like a "star" as you depict in paper for tree communication?
I read the paper https://arxiv.org/pdf/2402.05099. But there is a detail that I cannot understand. In section 4.6 performance model, why is there a "logn" in the equation that measures the communication time for the broadcast.
My guess: Do you use a non-naive tree pattern like a complete binary tree or a binomial heap rather than the naive tree which is like a "star" as you depict in paper for tree communication?