University of Toronto

Huawei Technologies Canada Co., Ltd.

Kia Shakiba

Michael Stumm

Chung-Man Abelard Chow

Ming Chen

Albert Lee

Sari Sultan

For a given application, increasing the size of a cache is beneficial up to a certain point and the number of hits does not increase significantly with a greater cache size. This disclosure provides a method to determine a miss ratio curve, for a cache having data blocks with a time-to-live. A hashed value of a data block's key address can be used to generate a 2D HLL counter for storing expiry times of the data blocks. The 2D HLL counter can be converted to a 1D array, from which a stack distance can be calculated. A frequency distribution of stack distances can then be converted into a miss ratio curve, from which an appropriate cache size can be selected.

Systems and methods to generate a cache miss ratio curve where cache data has a time-to-live

A method to obtain a cache miss ratio curve where a memory blocks of a cache have variable block sizes. By stacking sets of counters, each set being for a different block size, a stack distance for variable block sizes can be obtained and used to determine a miss ratio curve. Such curve can then be used to select a cache size that is appropriate for an application without requiring excessive memory. Methods can be used for batches of request, can apply limits to block sizes, and rounding for intermediary block sizes, they can be used with pruning, and their space complexity can be held constant.

Systems and methods to generate a miss ratio curve for a cache with variable-sized data blocks

Growing community of inventors

Toronto, Canada

Kia Shakiba