文件名称:FIFO
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:1.63kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
在分页式虚拟存储系统中,当硬件发出“缺页中断”后,引出操作系统来处理这个中断事件。如果主存中已经没有空闲块,则可用FIFO页面调度算法把该作业中最先进入主存的一页调出,存放到磁盘上。然后再把当前要访问的页装入该块。调出和装入后都要修改页表中对应页的标志。
FIFO页面调度算法总是淘汰该作业中最先进入主存的那一页,因此可以用一个数组来表示该作业已在主存的页面。-In the paging virtual memory system, when the hardware was given a " page fault" , the leads to the operating system to handle the interrupt events. If the main memory has no free blocks, the FIFO paging algorithm can be used to enter the job in the first page of main memory recall, stored to disk. Then put into the current page to access the block. To be transferred out and change after loading the corresponding page table page logo. FIFO paging algorithm is always out of the operation into the main memory of that first page, so you can use an array to represent the job pages in main memory.
FIFO页面调度算法总是淘汰该作业中最先进入主存的那一页,因此可以用一个数组来表示该作业已在主存的页面。-In the paging virtual memory system, when the hardware was given a " page fault" , the leads to the operating system to handle the interrupt events. If the main memory has no free blocks, the FIFO paging algorithm can be used to enter the job in the first page of main memory recall, stored to disk. Then put into the current page to access the block. To be transferred out and change after loading the corresponding page table page logo. FIFO paging algorithm is always out of the operation into the main memory of that first page, so you can use an array to represent the job pages in main memory.
(系统自动生成,下载前可以参看下载内容)
下载文件列表
FIFO.txt
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.