r*g
2 楼
zero miss rate?
u r kidding. Do not you consider the cold start?
u r kidding. Do not you consider the cold start?
t*l
6 楼
assuming it is for video processing, so at least there are a lot of spatial
localitis for data cache.
for the instructions, let's also assume we have all the profiling statistics
and tracing capabilities, and we also have the power to change whatever we
want including the hardware, the cache's replacement policy, the OS, and
even the complier or how you code your program...
is it possible to achieve 0 miss rate in cache?
【在 t****t 的大作中提到】![](/moin_static193/solenoid/img/up.png)
: given access pattern?
localitis for data cache.
for the instructions, let's also assume we have all the profiling statistics
and tracing capabilities, and we also have the power to change whatever we
want including the hardware, the cache's replacement policy, the OS, and
even the complier or how you code your program...
is it possible to achieve 0 miss rate in cache?
【在 t****t 的大作中提到】
![](/moin_static193/solenoid/img/up.png)
: given access pattern?
t*t
7 楼
i wouldn't say impossible, but surely it depends on your cache size vs data
size. I assume your 0 miss rate means for every data used, it's read from
memory once and only once.
Given an access pattern, you can calculate (or simulate) the minimum cache
size you need. For some deterministic case, you can get 0 miss rate. But
other than that, it really depends.
spatial
statistics
we
【在 t*******l 的大作中提到】![](/moin_static193/solenoid/img/up.png)
: assuming it is for video processing, so at least there are a lot of spatial
: localitis for data cache.
: for the instructions, let's also assume we have all the profiling statistics
: and tracing capabilities, and we also have the power to change whatever we
: want including the hardware, the cache's replacement policy, the OS, and
: even the complier or how you code your program...
: is it possible to achieve 0 miss rate in cache?
size. I assume your 0 miss rate means for every data used, it's read from
memory once and only once.
Given an access pattern, you can calculate (or simulate) the minimum cache
size you need. For some deterministic case, you can get 0 miss rate. But
other than that, it really depends.
spatial
statistics
we
【在 t*******l 的大作中提到】
![](/moin_static193/solenoid/img/up.png)
: assuming it is for video processing, so at least there are a lot of spatial
: localitis for data cache.
: for the instructions, let's also assume we have all the profiling statistics
: and tracing capabilities, and we also have the power to change whatever we
: want including the hardware, the cache's replacement policy, the OS, and
: even the complier or how you code your program...
: is it possible to achieve 0 miss rate in cache?
相关阅读
谁记得一个讨论c++的网站一个构造问题问一个关于convex set的数学问题 (转载)[合集] a problem about stl compose1有没有测试程序复杂程度的软件?闲聊:关于编程流程再问一个弱问题:为什么程序地址0-0x08000000是不可用的 (转载)操作建议:把CNN和Liar联系在一起 (转载)a C/C++ fopen mode question也问一下面试题:怎么判断计算机是不是连上intenet?What's the most efficient way to transform a 2d array intothere used to have MS and Google intereview questions?boost::function 的 syntax 问题电子版的书,大家打印看还是对着电脑看,还是干脆买本?菜鸟问题:关于写DataBase的问题 —— CDaoDatabasec vs c++[合集] thread safe or not???There is no public access to hell.com (转载)有什么可视化的debug工具么C++一个string的小问题