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?
相关阅读
天方夜谭 节选Javascript Q: 怎样产生10个不同的随机数?招GPU工程师 (转载)让 os x file sharing 整郁闷了Core JavaVirtualBox 改 console resolution 方法How to write "ip address => integer" in perl, python, Javascript etc. ?网页input问题最近迷上了线性代数html 5 or angular storage面对老印的无底线道德,老中束手无策啊便宜的VPS (转载)有啥好轮子可以抓取网页里的不规则信息?请教怎么在laptop的ide上看server上的code?求教PostgreSQL数据库的教程最近的科技发展简直要逼死人了在学习ts如何紧跟潮流最近搞了一下bluemix,总体感觉还可以js里不允许任何html markup