搜索资源列表
os
- 采用页式分配存储方案，通过分别计算不同算法的命中率来比较算法的优劣，同时也考虑页面大小及内存实际容量对命中率的影响； 实现OPT 算法 (最优置换算法) 、LRU 算法 (Least Recently) 、 FIFO 算法 (First IN First Out)的模拟； -By page type allocation of storage solutions, were calculated by the hit rate of different algorithms to com
xunicunchuqi
- 模拟分页式虚拟存储管理中硬件的地址转换和缺页中断，以及选择页面调度算法处理缺页中断。 1．模拟分页式存储管理中硬件的地址转换和产生缺页中断。 2．用先进先出（FIFO）页面调度算法处理缺页中断。 3．用最近最少用（LRU）页面调度算法处理缺页中断。 -Analog paging virtual memory management hardware address translation and page fault, and choose a paging algorit
fifo
- 实现了fifo的基本功能。包括创建、添加、使用等。-Fifo implemented the basic functions. Including creating, adding, and so on.
FIFO
- 在分页式虚拟存储系统中，当硬件发出“缺页中断”后，引出操作系统来处理这个中断事件。如果主存中已经没有空闲块，则可用FIFO页面调度算法把该作业中最先进入主存的一页调出，存放到磁盘上。然后再把当前要访问的页装入该块。调出和装入后都要修改页表中对应页的标志。 FIFO页面调度算法总是淘汰该作业中最先进入主存的那一页，因此可以用一个数组来表示该作业已在主存的页面。-In the paging virtual memory system, when the hardware was given a
FIFO-Ver2
- 在VC环境下模拟操作系统的FIFO页式内存管理的实例-VC environment in the operating system simulation-style FIFO memory management example page
fifo
- 用FIFO方式进行简单的系统存储调用试验，利用队列的方法，编写了一个FIFO线程的交互程序-FIFO method with a simple call to test the system memory, using the queue method, the preparation of an interactive program FIFO thread
11
- lfu and fifo and optimal algoritm comparison
fifo-queue
- The advantage of using a FIFO structure for a data flow problem is that we can decouple the source and sink processes. Without the FIFO we would have to produce 1 piece of data, then process it, produce another piece of data, then process it. With th
FIFO
- 实现先进先出 页面置换算法 包括FIFO算法 LRU 置换算法等-FIFO page replacement algorithm to achieve, including FIFO replacement algorithm LRU algorithm
fifo
- FIFO algorithm in c-FIFO algorithm in c++
FIFO
- FIFO（先进先出）算法实现，分析该算法的缺页率和命中率-FIFO (First In First Out) algorithm to analyze the page fault rate and hit rate of the algorithm
fifo
- 同步fifo的verilog代码，很好的资料，值得学习-Synchronous fifo verilog code, very good information, it is worth learning
FIFO-LRU-OPT
- opt lru fifo 置换算法实现 c++实现 这个是写的报告 里面包含的全部的代码 能够运行-opt lru fifo page-replacement
FIFO
- 实现FIFO（先进先出）存储器设计,用VHDL实现 -to implement the FIFO meoney
FIFO
- 自己封装的FIFO，大家看下，有什么好的意见大家可以提下-Own package FIFO, look down, have any good ideas that we can put under
FIFO-C
- FIFO的C语言实现。buffer指向存放数据的缓冲区，size是缓冲区的大小，in是写指针下标，out是读指针下标,在len和(fifo->size - fifo->in + fifo->out)之间取一个较小的值赋给len。注意，当(fifo->in == fifo->out+fifo->size)时，表示缓冲区已满，此时得到的较小值一定是0，后面实际写入的字节数也全为0。-FIFO the C language. buffer point to the
fifo-code
- Verilog代码：同步\异步FIFO。包含格雷码计数器.-Verilog code: syncronous\asyncourous FIFO. containing gray counter.
fifo
- 异步fifo ,verilog 源代码，含工程文件，modosim 下运行-Asynchronous fifo verilog source code containing the project file run modosim
FIFO-interrupt
- EASY arm FIFO传输-EASY arm FIFO transmission
FIFO
- 通用FIFO,先进先出，队列满不覆盖数据，已经检测，没出现BUG。-Universal FIFO, first-in-first-out queue full coverage data has been detected, and no-show BUG.