The communication time of the algorithm is , so the startup latency is only one half of the startup latency of the two-tree broadcast. The drawback of the ESBT broadcast is that it does not work for other values of and it cannot be adapted for (non-commutative) reduction or prefix sum.