Analysis of Data-Distribution

• I/O time: O(N/P)

• CPU time: O(Count)/P + overhead

• Comm volume: ?k O(N) per CPU

• Message count: ?k O(P)

• Each pass require all DB to be communicated

• Works for MPPs with high bisection bwidth

Previous slide

Next slide

Back to first slide

View graphic version