FIFOLRU

驱动调度+操作系统+模拟电梯调动的算法程序，使用C++编写。(Driven scheduling algorithm procedures, the+ operating system+ simulated lift mobilize written using the C++.)

经典问题魔兽世界（wumpus world）的程序，还比较简单，只能在dos下文字表示，没有图示(classic World of Warcraft (chat world) procedures, but also relatively simple, only under the dos text, there is no icon)

哈夫曼编码和解码 LRU算法模拟 银行家算法模拟 页面地址重定位模拟 进程调度模拟 FIFO算法模拟(Huffman encoding and decoding algorithm simulates LRU algorithm simulation banker page address relocation simulation process scheduling simulation algorithm FIFO simulation)

1、 ：编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对进程进行调度。 “最高优先数优先调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。尝试静态优先数与动态优先数两种方法： a) 静态优先数是指优先数在整个进程运行期间不再改变。优先数可以在数据输入时指定，也可以根据到达顺序、运行时间确定。 b) 动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定原则修改优先数。例如进程获得一次CPU后就将其优先数减少1。或者进程等待的时间超过某一时限时增加其优先数的值。 2、 编写并调试一个模拟的进程调度程序，模拟实现多级反馈队列调度算法。 3、 编写并调试一个模拟的进程调度程序，模拟实现最低松弛度优先算法。 4、 程序与报告要求： a) 对上述要求1、2、3，至少要完成一项，鼓励尝试多种算法。 b) 输出结果要尽量详细清晰，能够反映调度后队列变化，PCB内部变化。 c) 可以选择在Windows或Linux环境下编写、运行程序 d) 鼓励使用不同的开发工具在不同平台环境上进行开发比较。 e) 在实验报告中，一方面可以对实验结果进行分析，一方面可以对各种算法进行比较，分析它们的优劣，说明各种算法适用于哪些情况下的调度。 (1 : Prepare a simulation and debugging process scheduling procedures, "Priority number of the highest priority" to the process of scheduling algorithms for scheduling. "Highest priority priority scheduling algorithm for the basic idea is to place the CPU allocated to the priority queue highest process. Taste Examination several static and dynamic priority priority number two methods : a) static priority number is priority number in operation during the entire process will not change. priority number in the designated input data, can be reached under the order, running time determine. b) dynamic priority number refers to several priorities for the process of the creation process can be given an initial value, and according to the principle of amending certain priority number.)

页面置换算法的模拟实现及命中率对比.通过模拟实现几种基本页面置换的算法，了解虚拟存储技术的特点(Simulation of page replacement algorithm, and the hit rate compared to several basic page replacement algorithm through simulation to understand the characteristics of virtual storage technology)

哲学家进餐的问题，用程序模拟实现，解释死锁的产生、解除以及预防(dining philosophers problem, simulation procedures, explained Deadlock in lifting and prevention)

这是一个进程调度问题~~~~还是有很多的问题哦(This is a process of scheduling problem ~ ~ ~ ~ still has many problems Oh)

操作系统的课程设计，段页式存储管理，visual studio 2008，mfc(Operating systems curriculum design, storage management section page, visual studio 2008, mfc)

模拟操作系统进程调度的算法采用时间片轮转法和优先权法(operating system simulation process scheduling algorithm-time Web-law and law priority)

说明：  几个算法分析和操作系统的上机小程序，vc,c#实现(several algorithm analysis and operating systems on the plane small program vc, c#)