分割如何提高埃拉托色尼筛的运行时间?

I came across a segmented implementation of sieve of Eratosthenes which promises to run many times faster than the conventional version. Can someone please explain how segmentation improves the running time? Note that I want to find prime numbers in I came across a segmented implementation of sie