Skip to content

Perform cache line size study with variable cache miss latency #555

Open
pavelkryukov opened this issue Sep 3, 2018 · 0 comments
Open
Labels
2 Small features, tests coverage, simple laboratory works laboratory Adds a new study report to Wiki. S2 — Caches To solve the issue, you NEED knowledge about caches. OOO hierarchy etc.

Comments

@pavelkryukov
Copy link
Member

@alex19999 performed a study and found 1 / (1 + ax) dependency of IPC to cache line study.

However, in real life larger the large cache line size, the greater latency to get data from memory is. The low is linear, and we may consider that latency is 1 cycle to fetch 4 bytes of data.

The target is to study cache line size varying miss penalty latency, get new IPC dependency from cache line size, find a "sweet point" where IPC has a maximum, and provide analytic explanation if possible.

Use the report cited above as an example of report, and continue it under "Varying cache miss penalty" section.

@pavelkryukov pavelkryukov added 2 Small features, tests coverage, simple laboratory works S2 — Caches To solve the issue, you NEED knowledge about caches. OOO hierarchy etc. laboratory Adds a new study report to Wiki. labels Sep 3, 2018
Sign up for free to subscribe to this conversation on GitHub. Already have an account? Sign in.
Labels
2 Small features, tests coverage, simple laboratory works laboratory Adds a new study report to Wiki. S2 — Caches To solve the issue, you NEED knowledge about caches. OOO hierarchy etc.
Projects
None yet
Development

No branches or pull requests

1 participant