1.　　设计一个请求页式存储管理方案（自己指定页面大小），并予以程序实现。并产生一个 需要访问的指令地址流。它是一系列需要访问的指令的地址。为不失一般性，你可以适当地（用人工指定地方法或用随机数产生器）生成这个序列。

2.　　页面淘汰算法采用 FIFO页面淘汰算法，并且在淘汰一页时，只将该页在页表中抹去。而不再判断它是否被改写过，也不将它写回到辅存。

3.　　系统运行既可以在Windows，也可以在Linux。

-1 Design a requested page storage management solutions (specify your own page size), and be program. And generates a need to access the address of the instruction stream. It is a series of instructions need to access the address. Without loss of generality, you can properly (designated land use artificial methods or using a random number generator) to generate this sequence. 2 pages out FIFO algorithm algorithm pages out, and in an out, only to the page in the page table erase. Rather than judge whether it be redrafted before, it was not to return to the secondary storage. 3 The system can run both on Windows, can also Linux.