搜索资源列表
C8051F040_CAN_block
- This program configures the external memory interface and CAN to receieve data in a FIFO buffer and store the data in XRAM. Meant to receive data from another CAN device.-This program configures the external memory interface and CAN to receieve data
SerialFIFOForC51
- 89S52上实现51单片机的串口FIFO功能。即串口的收和发均采用了FIFO作为缓冲。相信这个程序有助于单片机的新手编写串口操作-89S52 achieve 51 MCU Serial FIFO functions. Serial admission that the hair and are used as a FIFO buffer. I believe this program helps prepare newcomers MCU serial operation
generic_fifos
- 用HDL语言编写的通用fifo源码,通过对fifo的宽度和深度进行配置,可以产生我们所需要的fifo,还包括fifo的测试程序和仿真Makefile脚本-with HDL prepared by the General fifo source, fifo of the breadth and depth configuration, can produce what we need fifo. also included fifo testing procedures and simulatio
fifo_VHDL
- 该文件是先入先出fifo的源代码和测试文件-the document is first-in-first out fifo the source code and test document
Pcidriver
- PCI驱动编程实例,通过PCI可实施操作: 2、通过DMA方式往SDRAM写数据的步骤: (1) 往OMB1写传输数据次数 (2) 往OMB2写所要访问的SDRAM地址 (3) 往FIFO写2 3、通过DMA方式从SDRAM读数据的步骤: (1) 往OMB1写传输数据次数 (2) 往OMB2写所要访问的SDRAM地址 (3) 往FIFO写3 -PCI-driven programming examples, can be implemented through
PROCESS1
- 进程调度,包括FIFO算法,优先数调度算法,时间片轮转调度算法-scheduling process, including FIFO algorithm, a few priority scheduling algorithm, time-Cycle Scheduling Algorithm
ymdd
- 页面调度算法主要有:FIFO,最近最少使用调度算法(LRU),最近最不常用调度算法(LFU),最佳算法(OPT) 题目要求: ① 实现三种算法:1、先进先出;2、OPT;3、LRU ② 页面序列从指定的文本文件(TXT文件)中取出 ③ 输出:第一行:每次淘汰的页面号,第二行:显示缺页的总次数
fifo88
- 8*8位的先入先出(fifo)数据缓冲器的vhdl源程序-8 * 8 of the first-in-first out (FIFO) buffers the data source VHDL
cz
- 操作系统的课程设计,分别是 题目一:模拟分页式存储管理中硬件的地址转换和产生缺页中断。 题目二:用先进先出(FIFO)页面调度算法处理缺页中断。 -operating system of curriculum design, is a topic : simulation tabbed storage management hardware address translation and have missing pages interruption. Topic 2 : FIFO
fifo_lru_opt
- 操作系统课程设计,页面置换算法,包含了先进先出fifo、最近最久未使用lru、还有最佳opt三种算法。代码简单易懂,编译通过。-courses on operating system design, page replacement algorithms, including the FIFO fifo. the most recent time on the use of LRU, the three best opt algorithm. Code straightforward compi
ztemplbase
- 基于deque实现的队列模板,可用作各种数据类型的先进先出缓冲。-based cohort achieved templates can be used as the various types of data FIFO buffer.
EZW_example
- EZW举例 该源代码包含有6个文件: EZW.H - EZW编码器头文件 EZW.C - EZW编码器文件 MATRIX2D.H MATRIX2D.C - 编码器数据结果定义和数据操作 FIFO.H FIFO.C - 扫描方式定义:先入先出原则 LIST.H LIST.C - 零树结构定义和操作 UNEZW.C - EZW解码器-EZW For the source code contains six documents : EZW.H - EZW-header
wgq2
- 进程调度 进程调度算法有FIFO,优先数调度算法,时间片轮转调度算法,分级调度算法,目前主要是考FIFO和优先数调度算法(静态优先级)。 -process scheduling process FIFO scheduling algorithm is priority number scheduling algorithm, time-Cycle Scheduling algorithm, grade scheduling algorithm, the key is to test
FIFOandLRUarithmetic
- 最佳页面置换算法,FIFO,LRU的仿真。页面调用和置换过程有动态显示。内存分配页面数目和页面引用串的长度可以进行人工交互输入。 -best pages replacement algorithm, FIFO, the LRU simulation. Page calls and replacement process is dynamic display. Memory allocation of the number of pages and pages cited the lengt
59c51
- 此程序在51上实现,很多个项目都用到,调试通过,做串口的FIFO很合适...... -this program to achieve the 51, many items are used, debugging, Serial FIFO done very suitable ......
threadphilosopher
- 利用线程方案实现实现哲学家问题.设置五个信号量代表五把叉子,初使值均为1,表示5把叉子均可以取,设置五个线程代表5个哲学家,其值分别为0~4,规定奇数号的哲学家先拿起他左边的叉子,然后再去拿他右边的叉子 而偶数号的哲学家则相反.按此规定,将是1,2号哲学家竞争1号叉子,3,4号哲学家竞争3号叉子.即五个哲学家都竞争奇数号叉子,获得后,再去竞争偶数号叉子,最后总会有一个哲学家能获得两支叉子而进餐。而申请不到的哲学家进入阻塞等待队列,根FIFO原则,则先申请的哲学家会较先可以吃饭,因此不会出现饿死的
pageChange
- 操作系统算法,关于页面置换算法的一个描述,其中写了两种算法,一种为先进先出,另一种为少用先出。-operating system algorithm, on the pages of a replacement algorithm descr iption, which was made two algorithms, for a FIFO, and the other for the use of first-out.
FX2_Slave_FIFO
- 68013 Usb2.0芯片Fifo驱动驱动程序源代码-68,013 Usb2.0 SC16CxxBUARTs driver chip driver source code
www[1].cnzz.cn
- 先进先出页面置换算法159 5.6.2最佳页面置换算法159 5.6.3最近最少使用页面置换算法160 5.6.4第2次机会页面置换算法161 5.6.5时钟页面置换 -FIFO replacement algorithm 159 pages 5.6.2 best replacement algorithm 159 pages recent 5.6.3 use at least 160 pages replacement algorithm 5.6.4 2nd chance pages repl
fjfu
- 这就是fifo算法,中文就是先进先出算法,,大家可以看看,不过很简单,,有部分实现的并不太好,,希望大家指点-algorithm, Chinese is FIFO algorithm, we can look at, but very simple. some achieved is not very good, and we hope the guidance