南航计算机网络实验课的小项目，模拟实现四个主机和基站间的冲突避免过程，每个主机有单独的线程（界面），C/S模式，TCP协议，Qtcreator运行，注释较为详细
2022-06-07 11:05:44
53KB
命中率、缺失率、缺失损失
Hit: 要访问的信息在Cache中
Hit Rate(命中率)：在Cache中的概率
Hit Time (命中时间) ：在Cache中的访问时间，包括：
Time to determine hit/miss + Cache access time
(即： 判断时间 + Cache访问)
Miss: 要找的信息不在Cache中
Miss Rate (缺失率) = 1 - (Hit Rate)
Miss Penalty (缺失损失)：访问一个主存块所花时间
Hit Time << Miss Penalty （Why?）
*
A HIT is when the data the processor wants to access is found in the upper level (Blk X).
The fraction of the memory access that are HIT is defined as HIT rate.
HIT Time is the time to access the Upper Level where the data is found (X). It consists of:
(a) Time to access this level.
(b) AND the time to determine if this is a Hit or Miss.
If the data the processor wants cannot be found in the Upper level. Then we have a miss and we need to retrieve the data (Blk Y) from the lower level.
By definition (definition of Hit: Fraction), the miss rate is just 1 minus the hit rate.
This miss penalty also consists of two parts:
(a) The time it takes to replace a block (Blk Y to BlkX) in the upper level.
(b) And then the time it takes to deliver this new block to the processor.
It is very important that your Hit Time to be much much smaller than your miss penalty. Otherwise, there will be no reason to build a memory hierarchy.
+2 = 14 min. (X:54)
2021-10-12 22:39:40
4.81MB
1
替换算法-最近最少用(LRU)
总是把最近最少用的那一块淘汰掉。
例：假定主存中的5块{1,2,3,4,5}同时映射到Cache同一组中，对于同一地址流，考察3行/组、 4行/组、 5行/组的情况。
3
1
2
2
1
1
3
1
4
3
3
3
2
5
2
2
4
2
3
4
1
3
2
2
2
1
4
1
5
1
5
2
5
4
3
√ √
√ √ √ √
√ √ √ √ √ √ √
4
4
1
4
5
1
2
1 2 3 4 1 2 5 1 2 3 4 5
3
1
3
4
5
1
3行/组
4行/组
5行/组
总是把最长时间不看的书还回去！
2021-05-16 10:27:56
4.81MB
1