avoid-deadlock

说明：  Unix 成组链接法 模拟UNIX系统的空闲块成组链接法，实现磁盘存储空间的管理(Unix Group Links UNIX System Simulation of spare pieces Group link, disk storage space to achieve the management)

1）设计一程序，由一个进程创建三个子进程，三个子进程一个是生产者进程，两个是消费者进程。 2）父子进程都使用父进程创建的共享存储区进行通信，由生产者进程将一个数组中的十个数值发送到由5个缓冲区组成的共享内存中。? 3）两个消费者进程轮流接收并输出这十个数值，同时将两个消费者进程读出的数值进行累加求各和。 4）考虑生产者进程生产的速度和消费者进程速度。(1) a program is designed to create three sub processes from one process, three sub processes is the producer process, and the two is the consumer process. 2) the father child process communicates with the shared storage area created by the parent process, and sends ten values in one array to the shared memory composed of 5 buffers by the producer process. L 3) the two consumer processes take turns to receive and output the ten values, and add values to each of the two consumer processes. 4) take into account the production speed of the producer process and the speed of the consumer process.)

MFC实现的，界面有好，实现了进程调度的算法 能够模拟操作系统的进程调度 适合初学者(MFC implementation, the interface is good, a process scheduling algorithm to achieve To simulate the operating system process scheduling for beginners)

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.)

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

磁盘文件系统：建立基于磁盘存储设备的UNIX文件系统，在windows系统下模拟UNIX文件管理系统，可用命令行进行基本的文件操作。(Disk file system: the UNIX file system based disk storage devices in the windows system simulation UNIX file management system, basic file operations available command line.)

操作系统作业源代码，方便学习操作系统课程的同学使用 (this is the codes for students who learn computer system.)

说明：  包含操作系统全部试验以及实验报告，稍微修改下就可以了(Contains the operating system all the tests and lab reports, a slight modification can be the next)

广东工业大学计算机学院操作系统4源代码 (Guangdong University of Computer Science 4 source code operating system)

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