slides - Computing Systems Laboratory

ABFCP : Partitioning Algorithm• Select the best partition that maximises performance (hits)• Complexity– cores = 2 → possible partitions = 3– cores = 4 → possible partitions = 19– cores = 8 → possible partitions = 1107– cores = 16 → possible partitions = 5196627• Linear algorithm that selects the best partition or a goodapproximation thereof.– N/2 comparisons (worst case) → O(N)