Cache Conscious Merge Sort Analysis

cache misses per key

sort each tile

final merge passes

Tile size is BC/2.

n/(BC/2) tiles to be merged in the end.

This take log2(n/(BC/2)) passes.

Previous slide

Next slide

Back to first slide

View graphic version