Search - FIFO - CodeBus

Search - FIFO - List

[Process-Thread] conan DL : 0: 操作系统实验课程中模拟虚拟存储器的算法使用先进先出调度算法实现-experimental courses operating system virtual memory simulation algorithm using FIFO scheduling algorithm
Date : 2008-10-13 Size : 1.75kb User : Jessica
[Process-Thread] 操作系统部分算法模拟软件 DL : 0: 本软件设计的目的是: 通过编写程序,将操作系统部算法以可视化的方式模拟出来,最终达到对这些算法有一个比深的理解。本软件演示的算法有: 多种资源的银行家算法可变分区存储算法生产者——消费者(PV操作模拟) FIFO算法和LRU算法(页面淘汰算法) 请求分页算法 CUP——I/0利用率分析开发工具: Delphi 7.0 -The software is designed to : develop procedures of the operating system to the Department of algorithm visualization of simulation, and eventually to these algorithms over a deep understanding. The demonstration software algorithms : a variety of resources through variable algorithm bankers storage algorithm producers -- consumers (PV simulated operational) FIFO algorithm and LRU algorithm (pages out of algorithm) algorithm CUP request Pagination -- I / 0 utilization analysis of development tools : Delphi 7 .0
Date : 2008-10-13 Size : 1.26mb User : 刀尖
[Process-Thread] linux-fifo DL : 0: 在linux下使用C语言开发的进程控制程序-the use of C language development process control procedures
Date : 2008-10-13 Size : 1.07kb User : 鲍勃
[Process-Thread] wgq2 DL : 0: 进程调度进程调度算法有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 a few priority and FIFO scheduling algorithm (static priority).
Date : 2008-10-13 Size : 1.46kb User : www
[Process-Thread] threadphilosopher DL : 0: 利用线程方案实现实现哲学家问题.设置五个信号量代表五把叉子，初使值均为1，表示5把叉子均可以取，设置五个线程代表5个哲学家，其值分别为0～4，规定奇数号的哲学家先拿起他左边的叉子,然后再去拿他右边的叉子而偶数号的哲学家则相反.按此规定,将是1,2号哲学家竞争1号叉子,3,4号哲学家竞争3号叉子.即五个哲学家都竞争奇数号叉子,获得后,再去竞争偶数号叉子,最后总会有一个哲学家能获得两支叉子而进餐。而申请不到的哲学家进入阻塞等待队列，根FIFO原则，则先申请的哲学家会较先可以吃饭，因此不会出现饿死的哲学家。-use threaded program to achieve realization philosophers problem. Installed capacity on behalf of five signal five fork, in early values are one, five fork can take, and set up five representatives of five threads philosopher, the value of 0 to 4, provisions of the odd philosopher he first took up the left fork. then plain his right fork, and even philosophers, on the contrary. accordingly, will be one, on the 2nd philosopher competition on the 1st fork, 3, philosopher competition on the 4th on the 3rd fork. that is five philosophers competition odd, fork, access, even longer competitive, fork, they will eventually have access to a philosopher two fork and eat. But philosophers are not eligible to enter the queue waiting for obstruction, root FIFO principle, I will apply the first philosop
Date : 2008-10-13 Size : 1.06kb User : 林茜
[Process-Thread] yemianguanli DL : 0: 设计一个请求页式存储管理方案。并编写模拟程序实现之。产生一个需要访问的指令地址流。它是一系列需要访问的指令的地址。为不失一般性，你可以适当地（用人工指定地方法或用随机数产生器）生成这个序列，使得 50 ％的指令是顺序执行的。 25 ％的指令均匀地散布在前地址部分， 25 ％的地址是均匀地散布在后地址部分。页面替换算法采用 Fifo 页面替换算法，在发生页替换时，不仅需要更改页表，还需将被替换的页回到辅存。
Date : 2008-10-13 Size : 11.01kb User : 小明
[Process-Thread] threadpool-0_2_4-src DL : 0: boost线程池库。 boost库中未包含线程池，但sourceforge上有了实现，该线程池简单易用，支持丰富的调度策略（fifo, lifo和priority）。
Date : 2008-10-13 Size : 68.28kb User : txf
[Process-Thread] 操作系统算法 DL : 0: 操作系统中的先进先出，最佳淘汰等算法的比较。-the FIFO operating system, such as the best out of the comparison algorithm.
Date : 2008-10-13 Size : 7.71kb User : 王强
[Process-Thread] 操作系统算法 DL : 0: 操作系统中的先进先出，最佳淘汰等算法的比较。-the FIFO operating system, such as the best out of the comparison algorithm.
Date : 2025-12-21 Size : 7kb User : 王强
[Process-Thread] conan DL : 0: 操作系统实验课程中模拟虚拟存储器的算法使用先进先出调度算法实现-experimental courses operating system virtual memory simulation algorithm using FIFO scheduling algorithm
Date : 2025-12-21 Size : 1kb User : Jessica
[Process-Thread] 操作系统部分算法模拟软件 DL : 0: 本软件设计的目的是: 通过编写程序,将操作系统部算法以可视化的方式模拟出来,最终达到对这些算法有一个比深的理解。本软件演示的算法有: 多种资源的银行家算法可变分区存储算法生产者——消费者(PV操作模拟) FIFO算法和LRU算法(页面淘汰算法) 请求分页算法 CUP——I/0利用率分析开发工具: Delphi 7.0 -The software is designed to : develop procedures of the operating system to the Department of algorithm visualization of simulation, and eventually to these algorithms over a deep understanding. The demonstration software algorithms : a variety of resources through variable algorithm bankers storage algorithm producers-- consumers (PV simulated operational) FIFO algorithm and LRU algorithm (pages out of algorithm) algorithm CUP request Pagination-- I/0 utilization analysis of development tools : Delphi 7 .0
Date : 2025-12-21 Size : 1.26mb User : 刀尖
[Process-Thread] linux-fifo DL : 0: 在linux下使用C语言开发的进程控制程序-the use of C language development process control procedures
Date : 2025-12-21 Size : 1kb User : 鲍勃
[Process-Thread] wgq2 DL : 0: 进程调度进程调度算法有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 a few priority and FIFO scheduling algorithm (static priority).
Date : 2025-12-21 Size : 1kb User : www
[Process-Thread] threadphilosopher DL : 0: 利用线程方案实现实现哲学家问题.设置五个信号量代表五把叉子，初使值均为1，表示5把叉子均可以取，设置五个线程代表5个哲学家，其值分别为0～4，规定奇数号的哲学家先拿起他左边的叉子,然后再去拿他右边的叉子而偶数号的哲学家则相反.按此规定,将是1,2号哲学家竞争1号叉子,3,4号哲学家竞争3号叉子.即五个哲学家都竞争奇数号叉子,获得后,再去竞争偶数号叉子,最后总会有一个哲学家能获得两支叉子而进餐。而申请不到的哲学家进入阻塞等待队列，根FIFO原则，则先申请的哲学家会较先可以吃饭，因此不会出现饿死的哲学家。-use threaded program to achieve realization philosophers problem. Installed capacity on behalf of five signal five fork, in early values are one, five fork can take, and set up five representatives of five threads philosopher, the value of 0 to 4, provisions of the odd philosopher he first took up the left fork. then plain his right fork, and even philosophers, on the contrary. accordingly, will be one, on the 2nd philosopher competition on the 1st fork, 3, philosopher competition on the 4th on the 3rd fork. that is five philosophers competition odd, fork, access, even longer competitive, fork, they will eventually have access to a philosopher two fork and eat. But philosophers are not eligible to enter the queue waiting for obstruction, root FIFO principle, I will apply the first philosop
Date : 2025-12-21 Size : 1kb User : 林茜
[Process-Thread] FIFO_LRU DL : 0: 操作系统FIFO_LRU 操作系统FIFO_LRU-FIFO_LRU operating system operating system FIFO_LRU
Date : 2025-12-21 Size : 649kb User : kiki
[Process-Thread] yemianguanli DL : 0: 设计一个请求页式存储管理方案。并编写模拟程序实现之。产生一个需要访问的指令地址流。它是一系列需要访问的指令的地址。为不失一般性，你可以适当地（用人工指定地方法或用随机数产生器）生成这个序列，使得 50 ％的指令是顺序执行的。 25 ％的指令均匀地散布在前地址部分， 25 ％的地址是均匀地散布在后地址部分。页面替换算法采用 Fifo 页面替换算法，在发生页替换时，不仅需要更改页表，还需将被替换的页回到辅存。-Page request to design a storage management program. And to prepare the realization of simulation program. A need to access the instruction address stream. It is a series of instructions need to access the address. For losing the general, you can use an appropriate (designated land use of artificial methods or random number generator) to generate this sequence, making 50 of orders are the order of execution. 25 of the command to spread evenly in the former address of 25 percent of the addresses are evenly spread in the latter part of the address. Page replacement algorithm using Fifo page replacement algorithm, page replacement in the event of not only need to change the page tables, will be needed to replace the page to return to Des depositors.
Date : 2025-12-21 Size : 306kb User : 小明
[Process-Thread] threadpool-0_2_4-src DL : 0: boost线程池库。 boost库中未包含线程池，但sourceforge上有了实现，该线程池简单易用，支持丰富的调度策略（fifo, lifo和priority）。-boost the thread pool library. boost library does not contain a thread pool, but there is sourceforge realize that the easy-to-use thread pool to support the rich scheduling strategy (fifo, lifo, and priority).
Date : 2025-12-21 Size : 68kb User : txf
[Process-Thread] jincheng DL : 0: 给出几个进程的名称，状态，所需时间以及优先及，分别按先进先出算法和优先及调度算法来进行进程调度，并计算周转时间。-Several processes are given the name, status, priority and time required, as well as, respectively, by the FIFO algorithm and the priority and scheduling algorithm for process scheduling, and calculate the turnaround time.
Date : 2025-12-21 Size : 1kb User : 李家月
[Process-Thread] FIFO DL : 0: 用于模拟进程调度中的先到先服务算法其中进程不是5个的话可以修改#define中N 的变量需要几个进程修改成几就行了-Used to simulate the process of scheduling algorithm First come first serve process is not one of the five can be amended if# Define variables in the N process takes a few modifications into several on the list
Date : 2025-12-21 Size : 1kb User : 刘旭
[Process-Thread] fifo DL : 0: 完成进程调度，页面置换算法中先进先出算法（FIFO）的源代码，对学习操作系统很有用的~-The completion of the process of scheduling, the page replacement algorithm in the FIFO method (FIFO) of the source code, useful for learning the operating system ~
Date : 2025-12-21 Size : 1kb User : jessie

« 12 »