文件名称:LRU
介绍说明－－下载内容均来自于网络，请自行研究使用
1、产生一个需要访问的指令地址流，它是一系列需要访问的指令的地址。为不失一般性，你可以适当地（用人工指定地方法或用随机数产生器）生成这个序列，使得 50％的指令是顺序执行的。25％的指令均匀地散布在前地址部分，25％的地址是均匀地散布在后地址部分。
2、指定合适的页面尺寸（例如以 1K或2K为1页）；
3、指定内存页表的最大长度，并对页表进行初始化；
4、每访问一个地址时，首先要计算该地址所在的页的页号，然后查页表，判断该页是否在主存——如果该页已在主存，则打印页表情况；如果该页不在主存且页表未满，则调入一页并打印页表情况；如果该页不足主存且页表已满，则按 LRU页面淘汰算法淘汰一页后调入所需的页，打印页表情况； 逐个地址访问，直到所有地址访问完毕。
-1, resulting in a need to access the instruction address stream, which is a series of instructions need to access the address. Is without loss of generality, you can properly (using manual methods or the designated land use random number generator) to generate this sequence, making the order of 50 of the orders are executed. 25 of the instruction evenly spread in the former parts of the address, 25 of the addresses are evenly spread in the latter part of the address.
2, specify the appropriate page size (such as 1K or 2K 1 page)
3, specify the maximum length of the memory page tables, and page table initialization
4, each visit to an address, we must first calculate the address of the page where the page number, and then check page table to determine whether the page in the main memory- if the page in main memory, then the printed page-table situation if the Page is not in main memory and the page tables below, then transferred to one and print the page-table situation if
2、指定合适的页面尺寸（例如以 1K或2K为1页）；
3、指定内存页表的最大长度，并对页表进行初始化；
4、每访问一个地址时，首先要计算该地址所在的页的页号，然后查页表，判断该页是否在主存——如果该页已在主存，则打印页表情况；如果该页不在主存且页表未满，则调入一页并打印页表情况；如果该页不足主存且页表已满，则按 LRU页面淘汰算法淘汰一页后调入所需的页，打印页表情况； 逐个地址访问，直到所有地址访问完毕。
-1, resulting in a need to access the instruction address stream, which is a series of instructions need to access the address. Is without loss of generality, you can properly (using manual methods or the designated land use random number generator) to generate this sequence, making the order of 50 of the orders are executed. 25 of the instruction evenly spread in the former parts of the address, 25 of the addresses are evenly spread in the latter part of the address.
2, specify the appropriate page size (such as 1K or 2K 1 page)
3, specify the maximum length of the memory page tables, and page table initialization
4, each visit to an address, we must first calculate the address of the page where the page number, and then check page table to determine whether the page in the main memory- if the page in main memory, then the printed page-table situation if the Page is not in main memory and the page tables below, then transferred to one and print the page-table situation if
(系统自动生成,下载前可以参看下载内容)
下载文件列表
LRU.cpp