Search - FIFO - CodeBus

Search - FIFO - List

[Data structs] 模拟分页式存储管理 DL : 0: 模拟分页式存储管理中硬件的地址转换和用先进先出调度算法(FIFO)处理缺页中断-simulation tabbed storage management hardware address translation, and the use of FIFO scheduling algorithm (FIFO) interrupt handling missing pages
Date : 2025-12-22 Size : 1kb User : 夏雨
[Data structs] 页面置换算法fiof_lru DL : 0: fifo和lru页面置换算法-fifo and LRU algorithm replacement pages
Date : 2025-12-22 Size : 233kb User : 夏雨
[Data structs] FIFOandLRUarithmetic DL : 0: 最佳页面置换算法，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 length of string can be artificial interactive input.
Date : 2025-12-22 Size : 233kb User : 刘利辉
[Data structs] yemianzhihuan DL : 0: 页面置换算法，包括先进先出置换算法，最近最久未使用置换算法-Page replacement algorithms, including FIFO replacement algorithm, long the most recent use of replacement algorithm
Date : 2025-12-22 Size : 1kb User : 张三
[Data structs] packet DL : 0: 输入物品的个数和背包的负重大小；程序自动为每个物品的重量和价值赋一个随机值(范围10~80)，输出装入背包的物品的总价值最大的值和此时的总物品大小。实现方法：1 回溯法，2 FIFO分枝限界，3 LC分枝限界； -Enter the number of items and backpacks the size of the load procedure automatically for each of the weight and value of items given a random value (range 10 ~ 80), output load backpack items the total value of the largest and at this time the total value of goods大小. Realize Methods: 1 backtracking, 2 FIFO Branch and Bound, 3 LC Branch-and-Bound
Date : 2025-12-22 Size : 7kb User : lzhijun
[Data structs] ringbuffer DL : 0: 在通信程序中，经常使用环形缓冲区作为数据结构来存放通信中发送和接收的数据。环形缓冲区是一个先进先出的循环缓冲区，可以向通信程序提供对缓冲区的互斥访问。-In the communications program, frequently used as a ring buffer data structure to store communications to send and receive data. Ring buffer is a FIFO buffer of the cycle can be provided to the communication program of the mutually exclusive access to the buffer zone.
Date : 2025-12-22 Size : 1kb User : angle
[Data structs] Pagereplacementalgorithm DL : 0: 页面置换算法设计和实现最佳置换算法、随机置换算法、先进先出置换算法、最近最久未使用置换算法、简单Clock置换算法及改进型Clock置换算法；通过支持页面访问序列随机发生实现有关算法的测试及性能比较。-Page replacement algorithm design and realization of the best replacement algorithm, random permutation algorithm, FIFO replacement algorithm, the most recently used replacement algorithm for long, simple Clock replacement algorithm and improved Clock replacement algorithm page views by supporting the realization of random sequences of the algorithm testing and performance comparison.
Date : 2025-12-22 Size : 335kb User : 张帅
[Data structs] DS2 DL : 0: 使用STL queue adapter，实现队列先入先出。通过.run文件中的内容，实现相应的输出。-Using the STL queue adapter, to achieve queue FIFO. Through. Run the contents of the document to achieve a corresponding output.
Date : 2025-12-22 Size : 1.38mb User : lavender
[Data structs] FIFOLRUOPT DL : 0: 页式管理缺页中断优化FIFO LRU OPT.rar 三种算法-Page-style management page fault FIFO LRU OPT.rar three kinds of optimization algorithms
Date : 2025-12-22 Size : 428kb User : 璐
[Data structs] FIFO-c DL : 0: 操作系统先来先服务调度算法模拟（C描述）-Operating a first-come first-served scheduling simulation (C description)
Date : 2025-12-22 Size : 1kb User : olivejy
[Data structs] FIFO DL : 0: fifo调度先来先服务程序-fifo yemiandiaoduchengxu
Date : 2025-12-22 Size : 76kb User : qiang
[Data structs] FIFO DL : 0: 里面包含各种关于FIFO的文章，介绍了各种实现方式，让大家借鉴-Which contains a variety of articles on the FIFO introduces a variety of implementations, so that we learn
Date : 2025-12-22 Size : 10.17mb User : 甘超
[Data structs] FIFO DL : 0: 模拟内存页式管理中的FIFO算法（用c语言描述）-Analog memory page-style management in the FIFO algorithm (described by c language)
Date : 2025-12-22 Size : 1kb User : 吴仕海
[Data structs] cache-fifo DL : 0: CPU缓存算法，FIFO的模拟程序，通过VC2010编译，包括数据查找，替换算法-CPU caching algorithm FIFO algorithm FIF simulation, including data whether the hit, replace, contained on this basis can be done other algorithms,
Date : 2025-12-22 Size : 2kb User : 秋光亮
[Data structs] FIFO DL : 0: 队列是一个先进先出的数据结构，支持业务enque（添加一个项目的结构）和dequeue（删除一个项目从结构）。作为一个FIFO数据结构，项目将在相同的顺序，他们原本排队出列。-A queue is a FIFO data structure that supports the operations enque (to add an item to the structure) and dequeue (to remove an item from the structure). As a FIFO data structure, the items are dequeued in the same order they were originally enqueued.
Date : 2025-12-22 Size : 1kb User : 马龙
[Data structs] fifo DL : 0: algoritmo de paginacion de fifo en c-algoritmo de paginacion de fifo en c++
Date : 2025-12-22 Size : 1kb User : pabloindili
[Data structs] Stack-and-Queue-FIFO DL : 0: Queue是先进先出的集合而Stack是后进先出的集合-Queue is a collection of FIFO Stack is a LIFO collection
Date : 2025-12-22 Size : 5kb User : hlh
[Data structs] Stack--FIFO DL : 0: Queue是先进先出的集合而Stack是后进先出的集合-Queue is a collection of FIFO Stack is a LIFO collection
Date : 2025-12-22 Size : 4kb User : hlh
[Data structs] FIFO-Replacement-algorithm DL : 0: FIFO 置换算法操作系统大作业FIFO源代码-FIFO Replacement algorithm
Date : 2025-12-22 Size : 1kb User :
[Data structs] FIFO DL : 0: FIFO算法，即First In First Out算法-FIFO algorithm, First In First Out method
Date : 2025-12-22 Size : 1kb User : Rain

« 12 3 »