Approximate timing for various operations on a typical PC
Posted yaoyaohust
tags:
篇首语：本文由小常识网(cha138.com)小编为大家整理，主要介绍了Approximate timing for various operations on a typical PC相关的知识，希望对你有一定的参考价值。
| execute typical instruction | 1/1,000,000,000 sec = 1 nanosec |
| fetch from L1 cache memory | 0.5 nanosec |
| branch misprediction | 5 nanosec |
| fetch from L2 cache memory | 7 nanosec |
| Mutex lock/unlock | 25 nanosec |
| fetch from main memory | 100 nanosec |
| send 2K bytes over 1Gbps network | 20,000 nanosec |
| read 1MB sequentially from memory | 250,000 nanosec |
| fetch from new disk location (seek) | 8,000,000 nanosec |
| read 1MB sequentially from disk | 20,000,000 nanosec |
| send packet US to Europe and back | 150 milliseconds = 150,000,000 nanosec |
以上是关于Approximate timing for various operations on a typical PC的主要内容，如果未能解决你的问题，请参考以下文章
快速近似最近邻搜索库 FLANN - Fast Library for Approximate Nearest Neighbors
Approximate Nearest Neighbor Negative ContrastiveLearning for Dense Text Retrieval
Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval
Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval
Approximate Nearest Neighbor Negative Contrastive Learning for Dense Text Retrieval
每日一读SWOPE:Efficient Approximate Algorithms for Empirical Entropy and Mutual Information